1998
DOI: 10.1109/92.661241
|View full text |Cite
|
Sign up to set email alerts
|

A CORDIC processor for FFT computation and its implementation using gallium arsenide technology

Abstract: In this paper, the architecture and the implementation of a complex fast Fourier transform (CFFT) processor using 0.6 m gallium arsenide (GaAs) technology are presented. This processor computes a 1024-point FFT of 16 bit complex data in less than 8 s, working at a frequency beyond 700 MHz, with a power consumption of 12.5 W. The architecture of the processor is based on the COordinate Rotation DIgital Computer (CORDIC) algorithm, which avoids the use of conventional multiplicationand-accumulation (MAC) units, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
5
0
1

Year Published

2003
2003
2023
2023

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 17 publications
(6 citation statements)
references
References 16 publications
(27 reference statements)
0
5
0
1
Order By: Relevance
“…The basic concept of CORDIC is to decompose the desired rotation angles into several easy-to-be-implemented subangles [12,13,14]. The subangles can be implemented by the shift-and-add.…”
Section: Processing Element (Pe) Designmentioning
confidence: 99%
“…The basic concept of CORDIC is to decompose the desired rotation angles into several easy-to-be-implemented subangles [12,13,14]. The subangles can be implemented by the shift-and-add.…”
Section: Processing Element (Pe) Designmentioning
confidence: 99%
“…In this sub-Section, we evaluate and compare the performance and complexity of a CORDIC and a complex multiplier in phase rotation. In Table 3, the conventional CORDIC algorithm refers to the radix-2 CORDIC, and radix-2=4 CORDIC refers to the work in [14] that enhances operation speed and reduces 25% of the micro-rotation stages. The complex multiplier used in the proposed chip consists of three multiplications and five additions [15].…”
Section: Complex Multiplier Against Cordicmentioning
confidence: 99%
“…To make a fair comparison, we set the precision to 16 bits in all algorithms. To avoid rounding error propagation [14,16], 19 bits are allocated in the data path of the CORDIC-based architectures.…”
Section: Complex Multiplier Against Cordicmentioning
confidence: 99%
See 1 more Smart Citation
“…In this paper, the DIT Radix-4 algorithm is derived and its efficient butterfly structure is proposed for SoC(System on a Chip) implementation. 방법이 제안되었다 [1][2][3][4] . 이와 비교하여 DIT는 순차적 인 출력을 낼 수 있는 장점이 있음에도 다양한 알고리 즘이 개발되지 못하였다 [5] .…”
unclassified