A Note on Base -2 Arithmetic Logic

Circuits for performing arithmetic operations using base –2 representations are considered. Study of the counting process leads to a negative binary up-down counter and new simple methods for positive-negative base conversions. The advantage of employing carry-borrow rather than carry-only during additions is pointed out. Certain special features of negation, arithmetic shift, multiplication, and division in base –2 are described.

[1]  S. Zohar.  Negative Radix Conversion , 1970, IEEE Transactions on Computers.

[2]  Zdzislaw Pawlak,et al.  Another Comment on "Negative Radix Conversion" , 1971, IEEE Trans. Computers.

[3]  Louis B. Wadel,et al.  Negative Base Number Systems , 1957, IRE Trans. Electron. Comput..

[4]  Shalhav Zohar,et al.  New Hardware Realizations of Nonrecursive Digital Filters , 1972, IEEE Transactions on Computers.

[5]  Dharma P. Agrawal.  Negabinary carry-look-ahead adder and fast multiplier , 1974 .

[6]  Shalhav Zohar.  A/D Conversion for Radix (-2) , 1973, IEEE Transactions on Computers.

[7]  Donald L. Dietmeyer,et al.  Conversion from Positive to Negative and Imaginary Radix , 1963, IEEE Transactions on Electronic Computers.

[8]  E. V. Krishnamurthy,et al.  Complementary Two-Way Algorithms for Negative Radix Conversions , 1971, IEEE Transactions on Computers.

[9]  Kenneth H. O'Keefe,et al.  A Note on Conditional-Sum Addition for Base - 2 Systems , 1973, IEEE Transactions on Computers.

[10]  P.V. Sankar,et al.  Arithmetic Algorithms in a Negative Base , 1973, IEEE Transactions on Computers.

[11]  E. V. Krishnamurthy,et al.  Logical design of a negative binary adder-subtracter , 1974 .

[12]  E. V. Krishnamurthy,et al.  Deterministic Division Algorithm in a Negative Base , 1973, IEEE Transactions on Computers.

[13]  Shalhav Zohar.  The Counting Recursive Digital Filter , 1973, IEEE Transactions on Computers.

[14]  Shalhav Zohar.  Fast Hardware Fourier Transformation Through Counting , 1973, IEEE Transactions on Computers.