ScholarLens Back to search
2002•1993 IEEE International Symposium on Circuits and SystemsRequires access

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

Riccardo Bernardini, G.M. Cortelazzo, G.A. Mian

Open publisher page 0 citations

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.>

About this research paper

What this paper is about

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.>

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.>

Key concepts: Twiddle factor, Fast Fourier transform, Rader's FFT algorithm, Prime-factor FFT algorithm, Split-radix FFT algorithm, Cooley–Tukey FFT algorithm, Algorithm, Prime (order theory)

Related papers

Related paper 1Related paper 2
Back to paper searchBrowse research topicsOriginal source
A family of MD FFT algorithms of complexity intermediate between the MD Cooley-Tukey FFT and the MD prime-factor FFT — Research Paper | ScholarLens