Multiplication Computer Program
Original Publication Date: 1979-Jul-01
Included in the Prior Art Database: 2005-Feb-20
When multiplying two numbers in a digital computer, it is desirable to utilize the minimum amount of time possible. The techniques suggested herein to minimize the time are to immediately cease on an overflow, to stop the multiplication algorithm as soon as the most significant bit of the multiplier has been utilized, and to operate on two bits simultaneously in both the multiplier and the multiplicand.