Name
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1145/1837274.1837424 | DAC |
Keywords | Field | DocType |
constants,directed graphs,search problems,aggressive pruning,exhaustive search,optimal single constant multiplication algorithm,word length 19 bit,word length 32 bit,Single constant multiplication,common subexpression elimination,directed acyclic graphs,optimal algorithm | Common subexpression elimination,Algorithm design,Multiplication algorithm,Brute-force search,Adder,Computer science,Algorithm,Directed graph,Directed acyclic graph,Multiplication | Conference |
ISSN | Citations | PageRank |
0738-100X | 4 | 0.41 |
References | Authors | |
9 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jason Thong | 1 | 23 | 1.96 |
| Nicola Nicolici | 2 | 807 | 59.91 |