A Two's Complement Parallel Array Multiplication Algorithm

  • Authors:
  • C. R. Baugh;B. A. Wooley

  • Affiliations:
  • Bell Laboratories;-

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1973

Quantified Score

Hi-index 15.01

Visualization

Abstract

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 multiplier bit and a multiplicand bit, and the signs of all the partial product bits are positive.