Five-step FFT algorithm with reduced computational complexity
- 22 November 2006
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 101 (6) , 262-267
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The Design and Implementation of FFTW3Proceedings of the IEEE, 2005
- A fast Fourier transform compilerACM SIGPLAN Notices, 1999
- Index mapping approach of deriving the PM DFT algorithmsIEEE Transactions on Computers, 1998
- The Fastest Fourier Transform in the West1997
- A new technique for twiddle-factor elimination in multidimensional FFT'sIEEE Transactions on Signal Processing, 1994
- Fast fourier transforms: A tutorial review and a state of the artSignal Processing, 1990
- FFTs in external or hierarchical memoryThe Journal of Supercomputing, 1990
- Performance analysis of the FFT algorithm on a shared-memory parallel architectureIBM Journal of Research and Development, 1987
- Fast algorithms for the multidimensional discrete Fourier transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965