Negative Radix Conversion

Authors:
S. Zohar
Affiliations:
-
Venue:
IEEE Transactions on Computers
Year:
1970

Citing 0
Cited 12

Arithmetic Algorithms in a Negative Base

IEEE Transactions on Computers
A Note on Base -2 Arithmetic Logic

IEEE Transactions on Computers
BCD and Radi x-2 Conversions

IEEE Transactions on Computers
New Hardware Realizations of Nonrecursive Digital Filters

IEEE Transactions on Computers
The Counting Recursive Digital Filter

IEEE Transactions on Computers
Rounding and Truncation in Radix (-2) Systems

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
An Algorithm for High-Speed Digital Filters

IEEE Transactions on Computers
A Realization of the RAM Digital Filter

IEEE Transactions on Computers
A Note on Conditional-Sum Addition for Base - 2 Systems

IEEE Transactions on Computers
A/D Conversion for Radix (-2)

IEEE Transactions on Computers

Quantified Score

Hi-index	15.02

Visualization

Abstract

Adoption of a negative radix for number representation results in a system that is totally indifferent to the sign of the number. Compared to the sign-magnitude representation, the approach considered here requires one extra digit.