Further reducing the redundancy of a notation over a minimally redundant digit set.

Abstract : 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.
Document type :
Reports
Complete list of metadatas

https://hal-lara.archives-ouvertes.fr/hal-02102107
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:14:25 AM
Last modification on : Sunday, April 28, 2019 - 1:23:05 AM

File

RR2000-09.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02102107, version 1

Collections

Citation

Marc Daumas, David W. Matula. Further reducing the redundancy of a notation over a minimally redundant digit set.. [Research Report] LIP RR-2000-09, Laboratoire de l'informatique du parallélisme. 2000, 2+14p. ⟨hal-02102107⟩

Share

Metrics

Record views

8

Files downloads

7