This work proposes an original multidimensional fast Fourier transform (FFT) algorithm where the computation is first organized into multiplier-free butterflies and then completed by 1-D FFTs. The properties of well-known 1-D FFT algorithms blend in quite nicely with those of the proposed multidimensional FFT scheme, extending their computational and structural characteristics to it. Strong points of the proposed method are that its total computational cost decreases as the signal space dimensions increase and that its efficiency is superior to that of any other multidimensional FFT algorithm
A new multidimensional FFT based on one-dimensional decompositions
BERNARDINI, Riccardo
2000-01-01
Abstract
This work proposes an original multidimensional fast Fourier transform (FFT) algorithm where the computation is first organized into multiplier-free butterflies and then completed by 1-D FFTs. The properties of well-known 1-D FFT algorithms blend in quite nicely with those of the proposed multidimensional FFT scheme, extending their computational and structural characteristics to it. Strong points of the proposed method are that its total computational cost decreases as the signal space dimensions increase and that its efficiency is superior to that of any other multidimensional FFT algorithmFile in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
