Fast computation of the two-dimensional discrete Fourier transform
D. Sundararajan, M. Omair Ahmad · 2002
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.