A novel optimal single constant multiplication algorithm

Authors:
Jason Thong;Nicola Nicolici
Affiliations:
McMaster University, Canada;McMaster University, Canada
Venue:
Proceedings of the 47th Design Automation Conference
Year:
2010

Citing 4
Cited 0

Multiplierless multiple constant multiplication

ACM Transactions on Algorithms (TALG)
Time-efficient single constant multiplication based on overlapping digit patterns

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Digital filter synthesis based on an algorithm to generate all minimal signed digit representations

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Exact and Approximate Algorithms for the Optimization of Area and Delay in Multiple Constant Multiplications

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

Existing optimal single constant multiplication (SCM) algorithms are limited to 19 bit constants. We propose an exact SCM algorithm. For 32 bit constants, the average run time is under 10 seconds. Optimality is ensured via an exhaustive search. The novelty of our algorithm is in how aggressive pruning is achieved by combining two SCM frameworks.