Very fast computation of the radix-2 discrete Fourier transform
- 1 August 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 30 (4) , 595-607
- https://doi.org/10.1109/tassp.1982.1163935
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Signal processing and complexity of computationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Low complexity robust linear predictive coding of speech signalsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- On the use of symmetry in FFT computationIEEE Transactions on Acoustics, Speech, and Signal Processing, 1979
- Comments on "A prime factor FFT algorithm using high-speed convolution"IEEE Transactions on Acoustics, Speech, and Signal Processing, 1978
- On Computing the Discrete Fourier TransformMathematics of Computation, 1978
- A prime factor FFT algorithm using high-speed convolutionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- A new principle for fast Fourier transformationIEEE Transactions on Acoustics, Speech, and Signal Processing, 1976
- The fast Fourier transform algorithm: Programming considerations in the calculation of sine, cosine and Laplace transformsJournal of Sound and Vibration, 1970
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965