Name
Title | ||
|---|---|---|
Radix-2r Arithmetic for Multiplication by a Constant: Further Results and Improvements |
Abstract | ||
|---|---|---|
In a previous brief, we proposed a new sublinear-runtime recoding heuristic for the multiplication by a constant, accompanied by its upper bound complexity. In this brief, further results are provided, namely, the analytic expressions of the average number of additions and the maximum adder depth. Improvements to the proposed heuristic are considered as well, using a redundant recoding followed by a common-digit-elimination step. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/TCSII.2014.2387620 | Circuits and Systems II: Express Briefs, IEEE Transactions |
Keywords | Field | DocType |
adders,circuit complexity,multiplying circuits,redundant number systems,additions,analytic expressions,common-digit-elimination step,maximum adder depth,multiplication,radix-2r arithmetic,redundant recoding,sublinear-runtime recoding heuristic,upper bound complexity,High-Speed and Low-Power Design,High-speed and low-power design,Linear- Time-Invariant (LTI) Systems,Multiplierless Single/Mutiple Constant Multiplication (SCM/MCM),Radix-2r Arithmetic,linear time-invariant (LTI) systems,multiplierless single/multiple constant multiplication (SCM/MCM),radix-2r arithmetic | Heuristic,Adder,Expression (mathematics),Upper and lower bounds,Arithmetic,Radix,Multiplication,Mathematics | Journal |
Volume | Issue | ISSN |
62 | 4 | 1549-7747 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Abdelkrim Kamel Oudjida | 1 | 31 | 6.05 |
| Nicolas Chaillet | 2 | 118 | 23.35 |
| Mohamed L. Berrandjia | 3 | 4 | 1.13 |