Real-valued fast Fourier transform algorithms
Authors:
- H. SorensenHSH. Sorensen
- D. JonesDJD. Jones
- M. HeidemanMHM. Heideman
- C. BurrusCBC. Burrus
- 1 June 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 35 (6) , 849-863
Abstract
No abstract availableThis publication has 27 references indexed in Scilit:
- A new FFT algorithm of radix 3,6, and 12IEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- On computing the split-radix FFTIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- On computing the discrete Hartley transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1985
- Simple FFT and DCT algorithms with reduced number of operationsSignal Processing, 1984
- On the use of symmetry in FFT computationIEEE Transactions on Acoustics, Speech, and Signal Processing, 1979
- On Computing the Discrete Fourier TransformMathematics of Computation, 1978
- The fast Fourier transform algorithm: Programming considerations in the calculation of sine, cosine and Laplace transformsJournal of Sound and Vibration, 1970
- The finite Fourier transformIEEE Transactions on Audio and Electroacoustics, 1969
- An economical method for calculating the discrete Fourier transform1968
- On computing the fast Fourier transformCommunications of the ACM, 1967