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.
No takes yet. Share an insight, caveat, or question.
Alvin M. Despain (1974) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: