Suppose you have implemented a multiplier that uses a 10-bit adder to perform mu
ID: 3600406 • Letter: S
Question
Suppose you have implemented a multiplier that uses a 10-bit adder to perform multiplication of two 5-bit unsigned binary numbers. The value produced in cycle 4 are listed below. Find out the values generated in cycle 5 (the last cycle). In the following, each row has three binary numbers for multiplicand, product and multiplier, respectively. The multiplier is given.
What are the bits for the Multiplicand and Product in the 5th Cycle?
Multiplicand 0100100000 Cycle Multiplier Product 00001 0010010000 oo0o0Explanation / Answer
Shift and add multiplication replicates the ideal multiplication that we do by hand. Here we need to check the last bit of the multplier.
If the LSB of multiplier is 1, Add the multiplicand to product, Shift left the multiplicand and Shift right the multiplier.
If the LSB of multiplier is 0, Shift left multiplicand and Shift right multiplier.
Since the LSB of multiplier is 1, therefore following will be the sequence of steps.
1. Product = Product + Multiplicand = 0010010000 + 0100100000 = 0110110000
2. Shift left multiplicand: Multiplicand = 1001000000
3. Shift right multiplier: Multiplier= 00000
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.