John R. Ehrman
Abstract
In reference [1] algorithms for performing arithmetic with unsigned two's complement operands were described. The scheme for division was implemented in a set of multiple-precision floating-point arithmetic routines [2]. User experience with those routines showed that there is one case where the algorithm fails [3]. We give here a modification to the algorithm which eliminates the error condition. Equations are numbered beginning with (20), so that we may refer to equations in the original paper as well.
- 1 EHRMAN, J. R. "Logical" arithmetic on computers with two's complement binary arithmetic. Comm. ACM 11, 7 (July 1968), 517-520. Google Scholar
Digital Library
- 2 Multiple-precision floating-point arithmetic package. Program Number 360D-40.4.003, Program Information Department, IBM.Google Scholar
- 3 KUKI, HIRONDO. U. of Chicago, Chicago, Ill., (personal communication).Google Scholar
Recommendations
A Generalized Multibit Recoding of Two's Complement Binary Numbers and its Proof with Application in Multiplier Implementations
A multibit recoding algorithm for signed two's complement binary numbers is presented and proved. In general, a k+1-bit recoding will result in a signed-digit (SD) representation of the binary number in radix 2/sup k/, using digits -2/sup k-1/ to +2/sup ...
A Two's Complement Parallel Array Multiplication Algorithm
An algorithm for high-speed, two's complement, m-bit by n-bit parallel array multiplication is described. The two's complement multiplication is converted to an equivalent parallel array addition problem in which each partial product bit is the AND of a ...
Comments