DocumentCode
1113638
Title
Fourier Transform Computers Using CORDIC Iterations
Author
Despain, Alvin M.
Author_Institution
Department of Electrical Engineering, Utah State University
Issue
10
fYear
1974
Firstpage
993
Lastpage
1001
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.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1974.223800
Filename
1672393
Link To Document