DocumentCode :
1009939
Title :
Introduction to the Role of Redundancy in Computer Arithmetic
Author :
Atkins, D.E.
Author_Institution :
The University of Michigan
Volume :
8
Issue :
6
fYear :
1975
fDate :
6/1/1975 12:00:00 AM
Firstpage :
74
Lastpage :
77
Abstract :
Redundancy, the state of being in excess of what is necessary, as applied in the implementation of computer arithmetic is motivated by three design goals: to improve reliability, to increase speed of operation, and/or to provide structural flexibility. In achieving the first goal, improvement of reliability, hardware redundancy and/or redundant arithmetic codes are applied to the detection and correction of faults. Although this is an increasingly vital area it will not be discussed in this paper. Rather, the focus will be on the other two potential benefits: more specifically, on the judicious use of number systems employing redundancy in representation. A positional number system with fixed radix, r, is redundant if the allowable digit set includes more than r distinct elements, thereby affording alternate representations of a given numeric value. Uniqueness. of representation is sacrificed with hope of greater gains. A novel, rigorous treatment of redundant, radix polynomial representation is included in Reference 1.
Keywords :
Acceleration; Adders; Computer aided manufacturing; Digital arithmetic; Fault detection; Finite wordlength effects; Polynomials; Redundancy;
fLanguage :
English
Journal_Title :
Computer
Publisher :
ieee
ISSN :
0018-9162
Type :
jour
DOI :
10.1109/C-M.1975.219001
Filename :
1649477
Link To Document :
بازگشت