Fast computation of the two-dimensional discrete Fourier transform

In this paper, a new radix-2 2-D decimation-in-time discrete Fourier transform algorithm is presented. This algorithm uses an approach employing vectorized data to reduce the structural overhead of the algorithm compared with the Cooley-Tukey radix-2 2-D algorithm. Computational complexity and run-time comparison of the algorithm are also provided.

[1]  K. Schwarz,et al.  FFT implementation on DSP-chips-theory and practice , 1990, International Conference on Acoustics, Speech, and Signal Processing.

[2]  Chwen-Jye Ju.  Equivalent relationship and unified indexing of FFT algorithm , 1993, 1993 IEEE International Symposium on Circuits and Systems.