A New Representation for Decimal Numbers

@article{Yuen1977ANR,
  title={A New Representation for Decimal Numbers},
  author={C. Yuen},
  journal={IEEE Transactions on Computers},
  year={1977},
  volume={C-26},
  pages={1286-1288}
}
  • C. Yuen
  • Published 1977
  • Mathematics, Computer Science
  • IEEE Transactions on Computers
A new representation for decimal numbers is proposed. It uses a mixture of positive and negative radixes to ensure that the maximum value of a four bit decimal digit is 9. This eliminates the more complex carry generation process required in BCD addition. 

Tables and Topics from this paper

On the Generalized Binary System
TLDR
A carry-lookahead adder for fast addition of two operands in generalized binary numbers is developed and truncation errors for this type of representation are examined and rounding algorithms are presented to reduce these errors. Expand
Redundant Radix-4 Representation With High Speed Arithmetic Coprocessor Using Carry Save And Redundant Signed Digit Technique
TLDR
CS addition can be used in the arithmetic for division as well in that subtrahend chosen at any steps depends on the magnitude result of the preceding subtraction and that magnitude is not readily available with CS representation. Expand
Fully redundant decimal addition and subtraction using stored-unibit encoding
TLDR
The proposed digit set is faithfully encoded as a mix of posibits, negabits, and unibits and is shown to obviate the need for any compare-to-9 operations and leads to minimal penalty subtraction using the addition circuitry. Expand
A Bibliography of Publications on Floating-Point Arithmetic
This is a bibliography of material on floating-point arithmetic that I came up with while doing research on a floating-point package of my own. I don’t claim it to be anywhere near complete. TheExpand

References

SHOWING 1-5 OF 5 REFERENCES
A Note on Base -2 Arithmetic Logic
  • C. Yuen
  • Mathematics, Computer Science
  • IEEE Trans. Computers
  • 1975
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 forExpand
Comments on "A Note on Base -2 Arithmetic Logic"
  • D. Agrawal
  • Mathematics, Computer Science
  • IEEE Trans. Computers
  • 1977
TLDR
This correspondence presents a straightforward and complete proof for Yuen1's algorithmetic steps for positive-negative base conversion with comments on the choice of negabinary adders. Expand
Digital Computer Fundamentals
The purpose of this book is to present, as clearly as possible, the principles of modern digital computers. Many question-a number of which are entirely new-are included in a separate section of eachExpand
On Monte Carlo Testing of Logic Tree Networks
It is shown that by a proper selection of the probabilities of 0 and 1 at the inputs, the efficiency of random test generation can be improved. This correspondence includes some results describingExpand
The Art of Computer Programming
TLDR
The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid. Expand