Five-step FFT algorithm with reduced computational complexity

DOI10.1016/J.IPL.2006.10.009zbMATH Open1184.68267OpenAlexW1984254719MaRDI QIDQ845949FDOQ845949

Authors: Rami Al Na'mneh, W. David Pan 

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.10.009

Recommendations

• scientific article; zbMATH DE number 3942981
• Simple FFT and DCT algorithms with reduced number of operations.
• A Modified Split-Radix FFT With Fewer Arithmetic Operations
• scientific article; zbMATH DE number 4011887
• An efficient FFT algorithm based on the discrete sine transform
• Publication:3490922
• scientific article; zbMATH DE number 4072331
• Lesser known FFT algorithms
• On a fast algorithm for computing the Fourier transform

zbMATH Keywords

computational complexityfive-step fast Fourier transform

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• An Algorithm for the Machine Calculation of Complex Fourier Series
• Numerical recipes in C++. The art of scientific computing
• Fast Fourier transforms: A tutorial review and a state of the art
• A parallel 1-D FFT algorithm for the Hitachi SR8000
• Multiprocessor FFTs
• A comparison of optimal FFTs on torus and hypercube multicomputers

Cited In (1)

• Congruent Number Theta Coefficients to 1012

Uses Software

• FFTW

This page was built for publication: Five-step FFT algorithm with reduced computational complexity

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