Low-Complexity Multiplierless Constant Rotators Based on Combined Coefficient Selection and Shift-and-Add Implementation (CCSSI)
- 4 March 2014
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 61 (7) , 2002-2012
Abstract
This paper presents a new approach to design multiplierless constant rotators. The approach is based on a combined coefficient selection and shift-and-add implementation (CCSSI) for the design of the rotators. First, complete freedom is given to the selection of the coefficients, i.e., no constraints to the coefficients are set in advance and all the alternatives are taken into account. Second, the shift-and-add implementation uses advanced single constant multiplication (SCM) and multiple constant multiplication (MCM) techniques that lead to low-complexity multiplierless implementations. Third, the design of the rotators is done by a joint optimization of the coefficient selection and shift-and-add implementation. As a result, the CCSSI provides an extended design space that offers a larger number of alternatives with respect to previous works. Furthermore, the design space is explored in a simple and efficient way. The proposed approach has wide applications in numerous hardware scenarios. This includes rotations by single or multiple angles, rotators in single or multiple branches, and different scaling of the outputs. Experimental results for various scenarios are provided. In all of them, the proposed approach achieves significant improvements with respect to state of the art.Keywords
This publication has 37 references indexed in Scilit:
- Generation of all radix-2 fast Fourier transform algorithms using binary trees2011
- Search algorithms for the multiple constant multiplications problem: Exact and approximateMicroprocessors and Microsystems, 2010
- Addition Aware Quantization for Low Complexity and High Precision Constant MultiplicationIEEE Signal Processing Letters, 2009
- Time-Efficient Single Constant Multiplication Based on Overlapping Digit PatternsIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2009
- Multiplierless multiple constant multiplicationACM Transactions on Algorithms, 2007
- A Difference Based Adder Graph Heuristic for Multiple Constant Multiplication Problems2007
- Simplified Design of Constant Coefficient MultipliersCircuits, Systems, and Signal Processing, 2006
- Multiplierless Implementation of Rotators and FFTsEURASIP Journal on Advances in Signal Processing, 2005
- Multiplication by two integers using the minimum number of adders2005
- A specification invariant technique for regularity improvement between flow-graph clusters2002