Show the step-by-step multiplication process using Booth algorithm (as in Table 10-3) when the following binary numbers

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 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

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: