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.
Keywords :
Algorithms, array processor, computer arithmetic, CORDIC, discrete Fourier transform (DFT), fast Fourier transform (FFT), Fourier transform, function generation, real-time transform, vector rotation.; Argon; Computer architecture; Costs; Digital arithmetic; Discrete Fourier transforms; Discrete transforms; Fast Fourier transforms; Finite wordlength effects; Fourier transforms; Frequency; Algorithms, array processor, computer arithmetic, CORDIC, discrete Fourier transform (DFT), fast Fourier transform (FFT), Fourier transform, function generation, real-time transform, vector rotation.;
