2012 IEEE Asia Pacific Conference on Circuits and Systems 2012
DOI: 10.1109/apccas.2012.6419086
|View full text |Cite
|
Sign up to set email alerts
|

Low-complexity rotators for the FFT using base-3 signed stages

Abstract: Abstract-Rotations by angles that are fractions of the unit circle find applications in e.g. fast Fourier transform (FFT) architectures. In this work we propose a new rotator that consists of a series of stages. Each stage calculates a micro-rotation by an angle corresponding to a power-of-three fractional parts. Using a continuous powers-of-three range, it is possible to carry out all rotations required. In addition, the proposed rotators are compared to previous approaches, based of shift-and-add algorithms,… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
8
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
3
2

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(8 citation statements)
references
References 13 publications
0
8
0
Order By: Relevance
“…The kernel achieves a precision of 22.69 correct bits by using 10 adders, as shown in Table VII. 3) Comparison: Figures 13 and 14 compare the proposed rotators from Table VII with other multiplierless rotators for W 16 and W 32 in the literature. The previous approaches include rotators based on MCM [5] 1 , Booth encoding [25], trigonometric identities [7], [24], base-3 rotators [27], MSR-CORDIC [23] 2 and non-redundant CORDIC [13]. The number of adders in the figures are for rotations in the range [0, π/4].…”
Section: Mcr With Uniform Scalingmentioning
confidence: 99%
See 4 more Smart Citations
“…The kernel achieves a precision of 22.69 correct bits by using 10 adders, as shown in Table VII. 3) Comparison: Figures 13 and 14 compare the proposed rotators from Table VII with other multiplierless rotators for W 16 and W 32 in the literature. The previous approaches include rotators based on MCM [5] 1 , Booth encoding [25], trigonometric identities [7], [24], base-3 rotators [27], MSR-CORDIC [23] 2 and non-redundant CORDIC [13]. The number of adders in the figures are for rotations in the range [0, π/4].…”
Section: Mcr With Uniform Scalingmentioning
confidence: 99%
“…This is done in [27], where all the rotations are generated by combining a small set of FFT angles. This set fits the rotation angles of the FFT better than that of the CORDIC, which results in a reduction in the rotation error, number of adders and latency of the circuit.…”
Section: Review Of Multiplierless Rotatorsmentioning
confidence: 99%
See 3 more Smart Citations