The project multiplies two 8 bit signed numbers and generates a 16 bit product using Modified Booth Multiplier Algorithm
Two 8-bit signed numbers are fed as input to the multiplier, the multiplier bits are recoded and fed to a dadda multiplier design and the corresponding outputs are added in a carry lookahead adder to get the final 32 bit product
N.A
| # | Input | Output | Bidirectional |
|---|---|---|---|
| 0 | multiplicand[0] | product[0] | product[8] |
| 1 | multiplicand[1] | product[1] | product[9] |
| 2 | multiplicand[2] | product[2] | product[10] |
| 3 | multiplicand[3] | product[3] | product[11] |
| 4 | multiplicand[4] | product[4] | product[12] |
| 5 | multiplicand[5] | product[5] | product[13] |
| 6 | multiplicand[6] | product[6] | product[14] |
| 7 | multiplicand[7] | product[7] | product[15] |