Low-complexity rotators for the FFT using base-3 signed stages
- 1 December 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 519-522
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, showing improvements in accuracy and number of adders.Keywords
This publication has 11 references indexed in Scilit:
- Accurate Rotations Based on Coefficient ScalingIEEE Transactions on Circuits and Systems II: Express Briefs, 2011
- Low-Complexity Constant Multiplication Based on Trigonometric Identities with Applications to FFTsIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2011
- A Difference Based Adder Graph Heuristic for Multiple Constant Multiplication Problems2007
- Low Power Small Area Modified Booth Multiplier Design for Predetermined CoefficientsIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2007
- Efficient Memoryless Cordic for FFT Computation2007
- Simplified Design of Constant Coefficient MultipliersCircuits, Systems, and Signal Processing, 2006
- New structures for complex multipliers and their noise analysis2002
- A survey of CORDIC algorithms for FPGA based computers1998
- Redundant CORDIC methods with a constant scale factor for sine and cosine computationIEEE Transactions on Computers, 1991
- The CORDIC Trigonometric Computing TechniqueIRE Transactions on Electronic Computers, 1959