Stephen Soule
Abstract
hnique; using it, one may add and subtract numbers represented in any radix, including a mixed radix, and stored one digit per byte in bytes of sufficient size. Radix conversion is unnecessary, no looping is required, and numbers may even be stored in a display (I/O) format. Applications to Cobol, MIX, and hexadecimal sums are discussed.
- 1 Grishman, R. Assembly Languages Programming foir the Control Data 6000 Series. Algorithmics Press, New York, 1971, pp. 191, 201.Google Scholar
- 2 Knuth, D.E. The Art of Computer Programming, Vol. 1, Fundamental Algorithms. Addison-Wesley, Reading, Mass., 1968, pp. 120-121. Google ScholarDigital Library
- 3 Neuhaus, J.O. Display coded character arithmetic on the 6000 series. CDC Tech. Rep. TER-04, Dec. 1966.Google Scholar
Index Terms
- Addition in an arbitrary base without radix conversion
Recommendations
On the Design of Modulo 2n±1 Subtractors and Adders/Subtractors
Novel architectures for designing modulo 2n+1 subtractors and combined adders/subtractors are proposed in this manuscript. Both the normal and the diminished-one representations of the operands are considered. Unit gate estimates and CMOS VLSI ...
A Radix-10 Digit-Recurrence Division Unit: Algorithm and Architecture
In this work, we present a radix-10 division unit that is based on the digit-recurrence algorithm. The previous decimal division designs do not include recent developments in the theory and practice of this type of algorithm, which were developed for {\...
Carry-Free Addition of Recoded Binary Signed-Digit Numbers
Signed-digital number representation systems have been defined for any radix r 3 with digit values ranging over the set (- alpha ,...,-1,0,1,..., alpha ), where alpha is an arbitrary integer in the range r/2> alpha >r. Such number representation systems ...
Comments