Abstract
Two's complement multiplication, defined in terms of adds, subtracts, and shifts, is derived from a novel expression relating a two's-complement number and its integer interpretation. Although the derived algorithm is considered well known, the derivation itself is believed to be original and easily grasped. Implementation of the algorithm in terms of computer arithmetic is shown to be safe from overflow except for the case when the multiplier is 10...0 (max. negative). In this case, the resulting product will have the proper magnitude but the wrong algebraic sign. The implementation can, however, be modified to handle this special case properly.
- QM-1 Hardware Level User's Manual, Second Edition, Revision 4, Nanodata Corporation, Williamsville, New York (March 1976).Google Scholar
Recommendations
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 ...
A Two's Complement Array Multiplier Using True Values of the Operands
A new algorithm for implementing the two's complement multiplication of an m n bit number is described. By interpreting certain positive partial product bits as negative, a parallel array is developed which has the advantage of using only one type of ...
Decimal Floating-Point Multiplication
Decimal multiplication is important in many commercial applications including financial analysis, banking, tax calculation, currency conversion, insurance, and accounting. This paper presents the design of two decimal floating-point multipliers: one ...






Comments