An efficient algorithm for the multiple constant multiplication problem

In this paper, we propose an efficient solution for the problem of multiple constant multiplication (MCM). We first propose a spring algorithm to search the common subexpressions not only across the columns of the digit matrix but also across the rows to reduce the number of additions and subtractions. Moreover, an elasticizing algorithm, which exploits the negation and scaling techniques, is proposed to improve the impact of the spring algorithm further. The experimental results are very promising.