Rounding and Truncation in Radix (-2) Systems

Authors:
S. Zohar
Affiliations:
Jet Propulsion Laboratory, California. Institute of Technology
Venue:
IEEE Transactions on Computers
Year:
1976

Citing 7
Cited 1

Arithmetic Algorithms in a Negative Base

IEEE Transactions on Computers
Deterministic Division Algorithm in a Negative Base

IEEE Transactions on Computers
Negative Radix Conversion

IEEE Transactions on Computers
New Hardware Realizations of Nonrecursive Digital Filters

IEEE Transactions on Computers
The Counting Recursive Digital Filter

IEEE Transactions on Computers
Fast Hardware Fourier Transformation Through Counting

IEEE Transactions on Computers
An Algorithm for High-Speed Digital Filters

IEEE Transactions on Computers

On the Generalized Binary System

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

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.