Lesser known FFT algorithms

MaRDI QIDQ2772773zbMATH OpenFDO

Authors M. An, R. Tolimieri

Publication date 1 September 2002

zbMATH Keywords

algorithmscomplexityconvolutiondivide-and-conquer strategiesfast Fourier transformfinite Fourier transformharmonic analysisparallel computationreduced instruction set computerRISC

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• Modified FFTs for Fused Multiply-Add Architectures
• On hardware implementation of the split-radix FFT
• FFT algorithms and their adaptation to parallel processing
• FFT algorithms for prime transform sizes and their implementations on VAX, IBM3090VF, and IBM RS/6000
• Fast Fourier transforms: A tutorial review and a state of the art

Cited in

(2)

• Compiler Construction
• Five-step FFT algorithm with reduced computational complexity

This page was built for publication: Lesser known FFT algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2772773)