A family of MD FFT algorithms of complexity intermediate between the MD Cooley-Tukey FFT and the MD prime-factor FFT

Abstract

Twiddle-factors elimination in the multidimensional fast Fourier transform (FFT) is approached using changes of basis, either in the signal or in the transform domain, as tools for generating FFT algorithms. The approach brings a new technique for the computation of the twiddle-factor free multidimensional FFT which is applicable to a range of situations considerably broader than that allowed by the multidimensional prime factor FFT of Guessoum and Merserau. The approach allows the determination of a family of FFT algorithms with computational complexity intermediate between that of the M-D Cooley-tukey FFT and that of the M-D prime factor FFT. >