Fourier Transform Computers Using CORDIC Iterations

  • Authors:
  • A. M. Despain

  • Affiliations:
  • Department of Electrical Engineering, Utah State University

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1974

Quantified Score

Hi-index 14.99

Visualization

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.