论文信息 - Index mappings for multidimensional formulation of the DFT and convolution

Index mappings for multidimensional formulation of the DFT and convolution

The mapping of one-dimensional arrays into two- or higher dimensional arrays is the basis of the fast Fourier transform (FFT) algorithms and certain fast convolution schemes. This paper gives the general conditions for these mappings to be unique and cyclic, and then considers the application to discrete Fourier transform (DFT) and convolution evaluation.

C. Burrus

[1] C. Rader. Discrete Fourier transforms when the number of data samples is prime , 1968 .

[2] Peter J. Nicholson,et al. Algebraic Theory of Finite Fourier Transforms , 1971, Journal of computer and system sciences (Print).

[3] Yechezkel Zalcstein,et al. A Note on Fast Cyclic Convolution , 1971, IEEE Transactions on Computers.

[4] I. J. Good,et al. The Relationship Between Two Fast Fourier Transforms , 1971, IEEE Transactions on Computers.

[5] C. Burrus,et al. Fast one-dimensional digital convolution by multidimensional techniques , 1974 .

[6] Shmuel Winograd. On computing the Discrete Fourier Transform. , 1976 .