Twiddle-factors elimination in multidimensional FFT has been approached using changes of basis, either in the signal or in the transform domain, as tools for generating FFT algorithms. This novel approach has brought 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. Moreover, the approach allows the determination of a family of FFT algorithm with computational complexity intermediate between that of the M-D Cooley-tukey FFT and that of the M-D Prime Factor FFT.
Family of MD FFT algorithms of complexity intermediate between the MD Cooley-Tukey FFT and the MD prime-factor FFT
Bernardini R.;
1993-01-01
Abstract
Twiddle-factors elimination in multidimensional FFT has been approached using changes of basis, either in the signal or in the transform domain, as tools for generating FFT algorithms. This novel approach has brought 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. Moreover, the approach allows the determination of a family of FFT algorithm with computational complexity intermediate between that of the M-D Cooley-tukey FFT and that of the M-D Prime Factor FFT.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
