Two-dimensional recursive fast Fourier transform
Feihong Zhu · IEE Proceedings F Radar and Signal Processing · 1990
The paper presents a two-dimensional (2-D) recursive fast Fourier transform (RFFT) which consists of two recursive algorithms and a revised fast Fourier transform in the recursive process. This algorithm is applied to image processing as an example of 2-D signal processing. Compared with a standard FFT, the RFFT has the advantages of not requiring the number of input data points to be equal to the number of discrete frequencies and of being suitable for online processing. Compared with other recursive Fourier transforms, the RFFT has a shorter computation time.