Further Reducing the Redundancy of a Notation Over a Minimally Redundant Digit Set - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue The Journal of VLSI Signal Année : 2003

Further Reducing the Redundancy of a Notation Over a Minimally Redundant Digit Set

Résumé

Redundant notations are used implicitly or explicitly in many digital designs. They have been studied in details and a general framework is known to reduce the redundancy of a notation down to the minimally redundant digit set. We present here an operator to further reduce the redundancy of such a representation. It does not reduce the number of allowed digits since removing one digit to a minimally redundant digit set is a conversion to a non redundant digit set and this is an expensive operation. Our operator introduces some correlation between the digits to reduce the number of possible redundant notations for any represented number. This reduction is visible in small useful operators like the elimination of leading zeros. We also present a key application with a CMOS Booth recoded multiplier. Our multiplier is able to accept both a redundant or a non redundant input with very little modifications and almost no penalty in time or space compared to state-of-the-art non redundant multipliers.
Fichier principal
Vignette du fichier
DauMat03.pdf (202.4 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-00157717 , version 1 (26-06-2007)

Identifiants

Citer

Marc Daumas, David Matula. Further Reducing the Redundancy of a Notation Over a Minimally Redundant Digit Set. The Journal of VLSI Signal, 2003, 33 (1-2), pp.7-18. ⟨10.1023/A:1021133616373⟩. ⟨hal-00157717⟩
92 Consultations
603 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More