Radix-2(r) Arithmetic for Multiplication by a Constant
| Affiliation auteurs | Affiliation ok |
| Titre | Radix-2(r) Arithmetic for Multiplication by a Constant |
| Type de publication | Journal Article |
| Year of Publication | 2014 |
| Auteurs | Oudjida AK, Chaillet N |
| Journal | IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS |
| Volume | 61 |
| Pagination | 349-353 |
| Date Published | MAY |
| Type of Article | Article |
| ISSN | 1549-7747 |
| Mots-clés | Double-base number system (DBNS), high-speed and low-power design, linear-time-invariant systems, multiplier-less single/mutiple constant multiplication (SCM/MCM), Radix-2(r) arithmetic |
| Résumé | In this brief, radix-2(r) arithmetic is explored to minimize the number of additions in the multiplication by a constant. We provide the formal proof that, for an N-bit constant, the maximum number of additions using radix-2(r) is lower than Dimitrov's estimated upper bound 2 . N/log(N) using the double-base number system (DBNS). In comparison with the canonical signed digit (CSD) and the DBNS, the new radix-2(r) recoding requires an average of 23.12% and 3.07% less additions for a 64-bit constant, respectively. |
| DOI | 10.1109/TCSII.2014.2312799 |