DocumentCode :
1132560
Title :
Rounding and Truncation in Radix (−2) Systems
Author :
Zohar, Shalhav
Author_Institution :
Jet Propulsion Laboratory, California. Institute of Technology
Issue :
5
fYear :
1976
fDate :
5/1/1976 12:00:00 AM
Firstpage :
464
Lastpage :
469
Abstract :
Examination of rounding and truncation errors in radix (−2) systems establishes the following facts: 1) truncation error is 33 percent lower than in the positive radix case. 2) There is no 1-bit rounding algorithm. 3) The error bound of the standard (1-bit) positive radix rounding algorithm can be approached asymptotically by using more than one of the discarded bits. For N bits, this error bound is multiplied by 1 + (3. 2N−l)−1.
Keywords :
N-bit rounding algorithms, radix (−2), rounding error bounds, truncation errors.; Finite wordlength effects; Hardware; NASA; Propulsion; Roundoff errors; Space technology; N-bit rounding algorithms, radix (−2), rounding error bounds, truncation errors.;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.1976.1674634
Filename :
1674634
Link To Document :
بازگشت