A multidimensional fast Fourier transform (FFT) algorithm is presented for signals with arbitrary symmetries and periodic on arbitrary lattices. Applications that can benefit from such an algorithm include Volterra filtering and analysis of x-ray diffraction data. The presented algorithm exploits signal redundancy to achieve a computational complexity of N log N, where <i>N</i> is the number of independent samples. To the authors’ knowledge, this is the only FFT that makes the frequency domain computation of Volterra filtering more convenient than the time domain approach.
© 1999 Optical Society of America
R. Bernardini, G. Cortelazzo, and G. A. Mian, "Multidimensional fast Fourier transform algorithm for signals with arbitrary symmetries," J. Opt. Soc. Am. A 16, 1892-1908 (1999)