Journal Articles IEEE Transactions on Circuits and Systems II: Express Briefs Year : 2014

Radix-2r Arithmetic for Multiplication by a Constant.

Abstract

In this paper, radix-2r 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-2r is lower than Dimitrov's estimated upper-bound (2.N/log(N)) using double base number system (DBNS). In comparison to canonical signed digit (CSD) and DBNS, the new radix-2r recoding requires an average of 23.12% and 3.07% less additions for 64-bit constant, respectively.

Domains

Fichier principal
Vignette du fichier
b9fd569d-1c0c-4054-a88c-d9accbfcdf11-author.pdf (421.45 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Licence
Loading...

Dates and versions

hal-01002468 , version 1 (06-06-2014)

Licence

Identifiers

Cite

Abdelkrim K. Oudjida, Nicolas Chaillet. Radix-2r Arithmetic for Multiplication by a Constant.. IEEE Transactions on Circuits and Systems II: Express Briefs, 2014, 61, pp.349-353. ⟨10.1109/TCSII.2014.2312799⟩. ⟨hal-01002468⟩
248 View
692 Download

Altmetric

Share

  • More