Perform 2's complement multiplication of (15) x (-13) using Booth's Mu | Microprocessor and Computer Architecture 2080.1

Microprocessor and Computer Architecture2080.15 marksNumerical: Booth's multiplication algorithmBooths multiplication algorithm

Perform 2's complement multiplication of (15) x (-13) using Booth's Multiplication algorithm. [5]

Multiplicand = 15 - Multiplier = −13 - Method: Booth's algorithm, 2's complement We need enough bits to represent both operands and their negatives in 2's complement. - $+15 = 01111$ needs 5 bits, but $+15$ in signed form requires a leading 0, so minimum is 5 bits. - $-13$ : magnitude 13 =

Multiplicand = 15 - Multiplier = −13 - Method: Booth's algorithm, 2's complement We need enough bits to represent both operands and their negatives in 2's complement. - $+15 = 01111$ needs 5 bits, but $+15$ in signed form requires a leading 0, so minimum is 5 bits. - $-13$: magnitude 13 =