Five-step FFT algorithm with reduced computational complexity

DOI10.1016/j.ipl.2006.10.009zbMath1184.68267OpenAlexW1984254719MaRDI QIDQ845949

W. David Pan, Rami Al Na'mneh

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

zbMATH Keywords

computational complexityfive-step fast Fourier transform

Mathematics Subject Classification ID

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

Related Items (1)

Congruent Number Theta Coefficients to 1012

Uses Software

• FFTW

Cites Work

• Unnamed Item
• A parallel 1-D FFT algorithm for the Hitachi SR8000
• Multiprocessor FFTs
• Fast Fourier transforms: A tutorial review and a state of the art
• An Algorithm for the Machine Calculation of Complex Fourier Series
• A comparison of optimal FFTs on torus and hypercube multicomputers

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