Journal article
Time-Efficient Single Constant Multiplication Based on Overlapping Digit Patterns
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 …
Authors
Thong J; Nicolici N
Journal
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Vol. 17, No. 9, pp. 1353–1357
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Publication Date
September 1, 2009
DOI
10.1109/tvlsi.2008.2003004
ISSN
1063-8210