An in-place, in-order prime factor FFT algorithm
Authors:
- C. BurrusCBC. Burrus
- P. EschenbacherPEP. Eschenbacher
- 1 August 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 29 (4) , 806-817
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Bounds on the minimum number of data transfers in WFTA and FFT programsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1979
- A comparative study of time efficient FFT and WFTA programs for general purpose computersIEEE Transactions on Acoustics, Speech, and Signal Processing, 1978
- On Computing the Discrete Fourier TransformMathematics of Computation, 1978
- New algorithms for digital convolutionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- A prime factor FFT algorithm using high-speed convolutionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- Index mappings for multidimensional formulation of the DFT and convolutionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- The Relationship Between Two Fast Fourier TransformsIEEE Transactions on Computers, 1971
- Discrete Fourier transforms when the number of data samples is primeProceedings of the IEEE, 1968