Issue No.10 - October (1974 vol.23)
A.M. Despain , Department of Electrical Engineering, Utah State University
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.
Algorithms, array processor, computer arithmetic, CORDIC, discrete Fourier transform (DFT), fast Fourier transform (FFT), Fourier transform, function generation, real-time transform, vector rotation.
A.M. Despain, "Fourier Transform Computers Using CORDIC Iterations", IEEE Transactions on Computers, vol.23, no. 10, pp. 993-1001, October 1974, doi:10.1109/T-C.1974.223800