TY - JOUR
T1 - Efficient algorithm for the multiple constant multiplication problem
AU - Chen, Michael
AU - Jou, Jing Yang
AU - Lin, Hen Ming
PY - 1999
Y1 - 1999
N2 - 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 sub-expressions 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.
AB - 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 sub-expressions 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.
UR - http://www.scopus.com/inward/record.url?scp=0032599340&partnerID=8YFLogxK
M3 - 會議論文
AN - SCOPUS:0032599340
SN - 1524-766X
SP - 119
EP - 122
JO - International Symposium on VLSI Technology, Systems, and Applications, Proceedings
JF - International Symposium on VLSI Technology, Systems, and Applications, Proceedings
T2 - Proceedings of the 1999 International Symposium on VLSI Technology, Systems, and Applications
Y2 - 7 June 1999 through 10 June 1999
ER -