Fourier Transform Computers Using CORDIC Iterations
- 1 October 1974
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-23 (10), 993-1001
- https://doi.org/10.1109/t-c.1974.223800
Abstract
The CORDIC iteration is applied to several Fourier transform algorithms. The number of operations is found as a function of transform method and radix representation. Using these representations, several hardware configurations are examined for cost, speed, and complexity tradeoffs. A new, especially attractive FFT computer architecture is presented as an example of the utility of this technique. Compensated and modified CORDIC algorithms are also developed.This publication has 9 references indexed in Scilit:
- Parallelism in fast Fourier transform hardwareIEEE Transactions on Audio and Electroacoustics, 1973
- A unified algorithm for elementary functionsPublished by Association for Computing Machinery (ACM) ,1971
- A Pipeline Fast Fourier TransformIEEE Transactions on Computers, 1970
- An algorithm for computing the mixed radix fast Fourier transformIEEE Transactions on Audio and Electroacoustics, 1969
- Fast Fourier transform hardware implementations--A surveyIEEE Transactions on Audio and Electroacoustics, 1969
- A Fast Fourier Transform Algorithm Using Base 8 IterationsMathematics of Computation, 1968
- What is the fast Fourier transform?Proceedings of the IEEE, 1967
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965
- The CORDIC Trigonometric Computing TechniqueIRE Transactions on Electronic Computers, 1959