Journal article
An Optimal and Practical Approach to Single Constant Multiplication
Abstract
We propose an exact solution to the single constant multiplication (SCM) problem. Existing optimal algorithms are limited to constants of up to 19 bits. Our algorithm requires less than 10 s on average to find a solution for a 32 bit constant. Optimality is guaranteed via an exhaustive search. We analyze two common SCM frameworks and the corresponding search strategies that each framework facilitates. Combining the strengths of both frameworks, …
Authors
Thong J; Nicolici N
Journal
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 30, No. 9, pp. 1373–1386
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Publication Date
September 1, 2011
DOI
10.1109/tcad.2011.2153853
ISSN
0278-0070