The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (1990 vol.39)
pp: 89-98
ABSTRACT
<p>Signed-digit (SD) number representation systems have been defined for any radix r≤3 with digit values ranging over the set (- alpha , . . ., -1, 0, 1, . . ., alpha ), where alpha is an arbitrary integer in the range 1/2r> alpha >r. Such number representation systems possess sufficient redundancy to allow for the annihilation of carry or borrow chains and hence result in fast propagation-free addition and subtraction. The author refers to the above as ordinary SD number systems and defines generalized SD number systems which contain them as a special symmetric subclass. It is shown that the generalization not only provides a unified view of all redundant number systems which have proven useful in practice (including stored-carry and stored-borrowed systems), but also leads to new number systems not examined before. Examples of such new number systems are stored-carry-or-borrow systems, stored-double-carry systems, and certain redundant decimal representations.</p>
INDEX TERMS
generalised signed-digit number systems; unifying framework; redundant number representations; carry; borrow; fast propagation-free addition; subtraction; digital arithmetic.
CITATION
B. Parhami, "Generalized Signed-Digit Number Systems: A Unifying Framework for Redundant Number Representations", IEEE Transactions on Computers, vol.39, no. 1, pp. 89-98, January 1990, doi:10.1109/12.46283
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool