A new 1D FFT-based algorithm for computing the MD FFT on arbitrary lattices
Riccardo Bernardini, G.M. Cortelazzo, Gian Antonio Mian · 2002
This work presents an original two-stages MD FFT algorithm where in the first stage the signal is processed by multiplier-free butterflies in such a way that at the second stage the computation only needs 1D FFT's. The proposed method is more efficient than any other MD FFT algorithm known to the authors.>