A new parallel algorithm for 2D DFT
Mingcai Wang, E.B. Lee · 2002
A 2D fast Fourier transform (FFT) algorithm is described. This algorithm offers a way to do 2D FFTs in both dimensions simultaneously. The amount of computation is reduced compared to traditional algorithms. Due to its good parallelism, a special arrangement of parallel processors saves a great deal of running time. This algorithm can be extended to discrete-time Fourier transforms in more than two dimensions