Time-Efficient Single Constant Multiplication Based on Overlapping Digit Patterns

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.