A Fast Fourier Transform for High-Speed Signal Processing
- 1 August 1971
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-20 (8) , 843-846
- https://doi.org/10.1109/t-c.1971.223359
Abstract
An arbitrary-radix fast Fourier transform algorithm and a design of its implementing signal processing machine are introduced. The algorithm yields an implementation with a level of parallelism proportional to the radix r of factorization of the discrete Fourier transform, allows 100 percent utilization of the arithmetic unit, and yields properly ordered Fourier coefficients without the need for pre- or postordering of data.Keywords
This publication has 5 references indexed in Scilit:
- The Design of a Class of Fast Fourier Transform ComputersIEEE Transactions on Computers, 1971
- FFT organizations for high-speed digital filteringIEEE Transactions on Audio and Electroacoustics, 1970
- Organization of Large Scale Fourier ProcessorsJournal of the ACM, 1969
- Fast Fourier transform hardware implementations--A surveyIEEE Transactions on Audio and Electroacoustics, 1969
- An Adaptation of the Fast Fourier Transform for Parallel ProcessingJournal of the ACM, 1968