Arithmetic Algorithms in a Negative Base
IEEE Transactions on Computers
Deterministic Division Algorithm in a Negative Base
IEEE Transactions on Computers
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
Complementary Two-Way Algorithms for Negative Radix Conversions
IEEE Transactions on Computers
A Note on Conditional-Sum Addition for Base - 2 Systems
IEEE Transactions on Computers
IEEE Transactions on Computers
On Little's Digital Filtering Algorithm
IEEE Transactions on Computers
A Novel Technique for Computing Negabinary Squares
IEEE Transactions on Computers
Signed Modified Reflected Binary Code
IEEE Transactions on Computers
On Classes of Positive, Negative, and Imaginary Radix Number Systems
IEEE Transactions on Computers
IEEE Transactions on Computers
On Negabinary-Binary Arithmetic Relationships and Their Hardware Reciprocity
IEEE Transactions on Computers
A New Representation for Decimal Numbers
IEEE Transactions on Computers
| Hi-index | 15.00 |
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.