Question: Show the step-by-step multiplication process using Booth algorithm (as in Table 10-3) when the following binary numbers are multiplied. Assume 5-bit registers that hold signed

Show the step-by-step multiplication process using Booth algorithm (as in Table 10-3) when the following binary numbers are multiplied. Assume 5-bit registers that hold signed numbers. The multiplicand in both cases is +15. 

a. (+15) x (+13) 

b. (+15) x (-13)

Table 10-3

TABLE 10-3 Example of Multiplication with Booth Algorithm BR = 10111 BR + 1 = 01001 en en+1 10 1 1 01 00 10

TABLE 10-3 Example of Multiplication with Booth Algorithm BR = 10111 BR + 1 = 01001 en en+1 10 1 1 01 00 10 Initial Subtract BR ashr ashr Add BR ashr ashr Subtract BR ashr AC 00000 01001 01001 00100 00010 10111 11001 11100 10110 11110 01011 QR en+1 10011 0 01001 00111 00011 11001 01100 10101 1 1 0 0 1 SC 101 100 011 010 001 000

Step by Step Solution

3.42 Rating (155 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Multiplication using the Booth Algorithm involves a series of additions subtractions and shifts Belo... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Computer System Architecture Questions!