DocumentCode
883259
Title
On the implementation of arithmetic support functions for generalized signed-digit number systems
Author
Parhami, Behrooz
Author_Institution
Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA
Volume
42
Issue
3
fYear
1993
fDate
3/1/1993 12:00:00 AM
Firstpage
379
Lastpage
384
Abstract
Ordinary signed-digit (OSD) number representation systems have been defined for any radix r ⩾3 with digit values ranging over the set {-α. . .,-1,0,1. . .,α}, where α is an arbitrary integer in the range r /2<α<r . The most important property of OSD number representation systems is the possibility of performing carry-free addition and (by changing all the digit signs in the subtrahend) borrow-free subtraction. Generalized signed-digit (GSD) number systems cover all useful redundant number representations as special cases. Most GSD number systems support carry-free addition and borrow-free subtraction, and even those that do not can be dealt with using limited-carry or limited-borrow algorithms which yield the i th sum or difference digit z i as a function of the digits x i, y i, x i-1, y i-1 , x i-2 and y i-2 of the operands x and y . Additional topics that are important for practical implementation of arithmetic functions using GSD number systems are treated. Because GSD number systems may have asymmetric digit sets, one must consider subtraction (or at least sign change for representations with α>0 and β>0) explicitly. Zero detection, sign detection, and overflow handling are also treated in depth
Keywords
digital arithmetic; OSD number representation; arithmetic support functions; borrow-free subtraction; carry-free addition; generalized signed-digit number systems; overflow handling; redundant number representations; sign detection; zero detection; Arithmetic; Propagation delay; Very large scale integration;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.210182
Filename
210182
Link To Document