scispace - formally typeset
Journal ArticleDOI

Multidimensional fast-Fourier-transform algorithm

B. Arambepola, +1 more
- 21 Jun 1979 - 
- Vol. 15, Iss: 13, pp 382-383
TLDR
A multiddimensional fast-Fourier-transform algorithm is developed for the computation of multidimensional Fourier and Fourier-like discrete transforms; it has considerably less multiplications than the conventional fast-fourier -transform methods.
Abstract
A multidimensional fast-Fourier-transform algorithm is developed for the computation of multidimensional Fourier and Fourier-like discrete transforms; it has considerably less multiplications than the conventional fast-Fourier-transform methods.

read more

Citations
More filters
Journal ArticleDOI

Polarization holding in birefringent single-mode fibers.

TL;DR: In this paper, the authors demonstrate wavelength averaging of the power in either mode, permitting a simple measurement of power transfer to the cross-polarized mode as a function of fiber length, and confirm experimentally the theory of random mode coupling between the polarization modes.
Journal ArticleDOI

Block realization of 2-D, IIR digital filters

TL;DR: In this paper, a new structure for the block realization of IIR, 2-D digital filters is proposed, which is based on a matrix representation of 2D convolutions and results in a 2D state variable description with block feedback.
Journal ArticleDOI

Flexibility in the length of convolutions computed using Fourier-like fast transform algorithms

TL;DR: An efficient method of achieving flexibility in the length of discrete convolutions, computed using Fourier and Fourier-like fast transform algorithms, is described and extended to discrete multidimensional convolutions computed using polynomial transforms.
Journal ArticleDOI

Algorithms for the reduction of the input-output operations in the calculation of the two-dimensional Discrete Fourier transform

TL;DR: The present paper proposes three new algorithms for the reduction of the input-output (I-O) operations and it is proven that the reduction achieved is of a logarithmic order of magnitude.
Book ChapterDOI

Number Theoretic Transformation Techniques

TL;DR: Finite-length sequences which have finite values in the range 0 ≤ n ≤ N−1 and whose values are zero outside this range are dealt with.