- Booth's multiplication algorithm is a multiplication algorithm that multiplies two signed binary numbers in two's complement notation.
- Booth's algorithm can be implemented by repeatedly adding (with ordinary unsigned binary addition) one of two predetermined values A and S to a product P, then performing a rightward arithmetic shift on P. Let m and r be the multiplicand and multiplier, respectively; and let x and y represent the number of bits in m and r.
- Language - Verilog
Result on the monitor:
- 0ns : -16 * -16 = 256
- 10ns : -107 * 32 = -3424
- 20ns : 7 * 0 = 0
- 30ns : 1 * 1 = 1
- 40ns : 60 * 5 = 300
- 50ns : -86 * 35 = -3010
- 60ns : 17 * 28 = 476
- 70ns : 8 * -65 = -520