Question:
Please implement booth’s algorithm in logisim to solve signed multiplication. The circuit should represent the one seen below.
The following inputs and outputs are required:
• Multiplicand: a 16-bit two’s complement input
• Multiplier: a 16-bit two’s complement input
• Mul (1-bit input): This input will be one if the instruction is the multiplication instruction
• Clock (1-bit input)
• Product: 32-bit two’s complement output
• M Ready (1-bit output): This output will be 1 if the product is ready
The inside circuit should use a register for the multiplier, the multiplicand, and the product. A ROM circuit should control the clock signal and what happens on each clock edge. The ROM circuit triggers the registers. The ROM circuit can be seen below:
Solution:
Booth’s algorithm is a multiplication algorithm that multiplies two signed binary numbers in 2’s compliment notation.-
