Issue No.05 - May (1971 vol.20)
This paper describes two sets of algorithms in positive radix arithmetic for conversions between positive and negative integral radix representation of numbers. Each set consists of algorithms for conversions in either direction; these algorithms are mutually complementary in the sense they involve inverse operations depending upon the direction of conversion. The first set of algorithms for conversion of numbers from positive to negative radix (negative to positive radix) proceeds serially from the least significant end of the number and involves complementation and addition (subtraction) of unity on single-digit numbers. The second set of algorithms for conversion of numbers from positive to negative radix (negative to positive radix) proceeds in parallel starting from the full number (the most significant end of the number) and involves complementation and right (left) shift operations. The applications of these algorithms to integers, mixed integer-fractions, floating-point numbers, and for real-time conversions are given.
Algorithms, complementary two-way algorithms, complementation, complement representation, left-to-right parallel algorithms, negative radix, positive radix, pseudodivision and pseudomultiplication algorithms, radix conversion, real-time radix conversions, right-to-left serial algorithms, shift operations, two-way algorithms.
E.V. Krishnamurthy, "Complementary Two-Way Algorithms for Negative Radix Conversions", IEEE Transactions on Computers, vol.20, no. 5, pp. 543-550, May 1971, doi:10.1109/T-C.1971.223288