Accurate Rotations Based on Coefficient Scaling
- 17 October 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 58 (10) , 662-666
Abstract
This brief presents a novel approach for improving the accuracy of rotations implemented by complex multipliers, based on scaling the complex coefficients that define these rotations. A method for obtaining the optimum coefficients that lead to the lowest error is proposed. This approach can be used to get more accurate rotations without increasing the coefficient word length and to reduce the word length without increasing the rotation error. This brief analyzes two different situations where the optimization method can be applied: rotations that can be optimized independently and sets of rotations that require the same scaling. These cases appear in important signal processing algorithms such as the discrete cosine transform and the fast Fourier transform (FFT). Experimental results show that the use of scaling for the coefficients clearly improves the accuracy of the algorithms. For instance, improvements of about 8 dB in the Frobenius norm of the FFT are achieved with respect to using non-scaled coefficients.Keywords
This publication has 14 references indexed in Scilit:
- A 2.4-GS/s FFT Processor for OFDM-Based WPAN ApplicationsIEEE Transactions on Circuits and Systems II: Express Briefs, 2010
- Addition Aware Quantization for Low Complexity and High Precision Constant MultiplicationIEEE Signal Processing Letters, 2009
- An improved scaled DCT architectureIEEE Transactions on Consumer Electronics, 2009
- High-Throughput VLSI Architecture for FFT ComputationIEEE Transactions on Circuits and Systems II: Express Briefs, 2007
- Efficient Memoryless Cordic for FFT Computation2007
- Architectures for Dynamic Data Scaling in 2/4/8K Pipeline FFT CoresIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2006
- An efficient multiplierless approximation of the fast Fourier transform using sum-of-powers-of-two (SOPOT) coefficientsIEEE Signal Processing Letters, 2002
- Passive cascaded-lattice structures for low-sensitivity FIR filter design, with applications to filter banksIEEE Transactions on Circuits and Systems, 1986
- Quantization errors in the fast Fourier transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1975
- Digital lattice and ladder filter synthesisIEEE Transactions on Audio and Electroacoustics, 1973