Time-Efficient Single Constant Multiplication Based on Overlapping Digit Patterns
Authors:
- 10 March 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 17 (9) , 1353-1357
Abstract
Common subexpression elimination (CSE) algorithms try to minimize the number of adders (or subtracters) required to implement constant multiplication by searching and substituting common patterns in the CSE representation of a constant. CSE algorithms, in general, cannot find certain patterns due to inherent restrictions in the CSE representation. We propose overlapping digit patterns (ODPs) to remove some of these restrictions. We integrate ODPs into H(k), the best existing heuristic algorithm for single constant multiplication (SCM). H(k) is not applicable to the multiple constant multiplication (MCM) problem, so we cannot consider this problem. Generally, H(k) finds solutions very close to optimal, so there is a strict limitation on any further improvement which applies to any new heuristic. Instead, by integrating ODPs within H(k), we can on average significantly improve the run time of the algorithm (typically by one order of magnitude) while still reducing the number of adders.Keywords
This publication has 8 references indexed in Scilit:
- Multiplierless multiple constant multiplicationACM Transactions on Algorithms, 2007
- Simplified Design of Constant Coefficient MultipliersCircuits, Systems, and Signal Processing, 2006
- Generation of Signed-Digit Representations for Integer MultiplicationIEEE Signal Processing Letters, 2004
- Using all signed-digit representations to design single integer multipliers using subexpression elimination2004
- Extended results for minimum-adder constant integer multipliers2003
- Digital filter synthesis based on an algorithm to generate all minimal signed digit representationsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2002
- Subexpression sharing in filters using canonic signed digit multipliersIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1996
- Signed-Digit Numbe Representations for Fast Parallel ArithmeticIEEE Transactions on Electronic Computers, 1961