Booth's multiplication algorithm multiplies two signed binary numbers in two's complement notation. It was invented by Andrew Donald Booth in 1950. The algorithm inspects two bits of the multiplier at a time, and either adds, subtracts, or leaves unchanged the partial product depending on whether the bits are 10, 01, or the same. It shifts the partial product and multiplier arithmeticly to the right after each step to inspect the next bits.