Recursive form of the discrete Fourier transform for two-dimensional signals

Abstract

In this paper, recursive fast Fourier transform is presented for twodimensional signals. When applying to real-time analysis, the computational efficiency is highly improved by integrating a recursive procedure. The recursive procedure highly reduces the number of complex arithmetic operations, and provide detailed spectral analysis for one or two-dimensional signals. In the first stage, the recursive algorithm is realized for one-dimensional signals. Then, recursive fast Fourier transform is presented for two-dimensional signals. The advantages of the recursive algorithm are presented by giving examples for one and two-dimensional signals.