The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1976 vol.25)
pp: 464-469
S. Zohar , Jet Propulsion Laboratory, California. Institute of Technology
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.
INDEX TERMS
N-bit rounding algorithms, radix (-2), rounding error bounds, truncation errors.
CITATION
S. Zohar, "Rounding and Truncation in Radix (-2) Systems", IEEE Transactions on Computers, vol.25, no. 5, pp. 464-469, May 1976, doi:10.1109/TC.1976.1674634
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool