ABSTRACT
In this chapter, we study FFT algorithms for computing DFT of two- and higher-dimensional data sequences. In most cases, algorithms are derived for two-dimensional data sequences and then generalized to higher dimensions. It is our feeling that FFT algorithms for two-dimensional data sequences depart significantly from their one-dimensional counterparts, but extend naturally to higher dimensions. The framework for the various algorithms is developed in a way that the extension of two-dimensional FFTs to higher dimensional FFTs could be obtained in a straightforward manner.
