An FPT algorithm with a modularized structure for computingtwo-dimensional discrete Fourier transforms

In this corresnondence, the fast polynomial transform (FPT) for computing two-dimensional (2-D) discrete Fourier transforms (DFT‘s) is modularized into identical modules. In this new method, only FPT's and FFT's of the same length are required. As a consequence, the architecture is more regular and naturally suitable for multiprocessor and VLSI implementations. © 1991 IEEE