Suppose A = (1111 1110)2 and B = (0001 0000) 2. Determine AxB using Booth's algorithm...

Transcribed Image Text:

Suppose A = (1111 1110)2 and B = (0001 0000) 2. Determine AxB using Booth's algorithm if A is the multiplier and B is the multiplicand. -Multiplicand: [Select] Multiplicand: [Select] Multiplier: [Select] Iteration Step Product 0 1 1 2 2 3 3 4 4 LO 5 5 6 6 7 7 8 8 1.00 0000 0000 1111 1110 1.2 0000 0000 0111 1111 2.10 1111 0000 0111 1111 2.2 0000 0000 1111 1110 3.11 1111 1000 0011 1111 3.2 1111 1100 0001 1111 4.2 4.11 1111 1100 0001 1111 [Select] 5.2 5.11 1111 1110 0000 1111 6.2 [Select] 6.11 1111 1111 0000 0111 1111 1111 0000 0111 8.2 1111 1111 1000 0011 7.11 1111 1111 1000 0011 7.2 1111 1111 1100 0001 8.11 1111 1111 1100 0001 [Select] Previous LSB Action 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 Initialize No action Shift [Select] Shift No action Shift No action Shift No action Shift No action Shift No action Shift [Select] Shift Suppose A = (1111 1110)2 and B = (0001 0000) 2. Determine AxB using Booth's algorithm if A is the multiplier and B is the multiplicand. -Multiplicand: [Select] Multiplicand: [Select] Multiplier: [Select] Iteration Step Product 0 1 1 2 2 3 3 4 4 LO 5 5 6 6 7 7 8 8 1.00 0000 0000 1111 1110 1.2 0000 0000 0111 1111 2.10 1111 0000 0111 1111 2.2 0000 0000 1111 1110 3.11 1111 1000 0011 1111 3.2 1111 1100 0001 1111 4.2 4.11 1111 1100 0001 1111 [Select] 5.2 5.11 1111 1110 0000 1111 6.2 [Select] 6.11 1111 1111 0000 0111 1111 1111 0000 0111 8.2 1111 1111 1000 0011 7.11 1111 1111 1000 0011 7.2 1111 1111 1100 0001 8.11 1111 1111 1100 0001 [Select] Previous LSB Action 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 Initialize No action Shift [Select] Shift No action Shift No action Shift No action Shift No action Shift No action Shift [Select] Shift

Answer rating: 100% (QA)

Multiplicand 0001 0000 Multiplicand 1111 0000 2s complement of the abo... View the full answer