Question 1: Multiplication (10 points) Given the unsigned binary multiplicand 01011010 and unsigned binary multiplier 01
Posted: Thu May 05, 2022 1:31 pm
Question 1: Multiplication (10 points) Given the unsigned binary multiplicand 01011010 and unsigned binary multiplier 01110001, compute the product with the optimized version of the multiplication hardware (slides 43 of Arithmetic note set) shown below. Multiplicand Product Shift right Write Control test 16 bits a) Fill as many rows below as needed to calculate the product. Explain the operations in the "Action" column. Hint: Operations can be "initial State", "no operation", "addition", and "shift right", which carry the same meaning as in lecture notes. (8 points) Iteration Multiplicand (M) Product (P) Action 00000000 01110001 Initial State 0 1 2 3 5 01011010 8-bit ALU 8 bits
7 8 b) If this is an 8-bit unsigned number system, does the calculation in part (a) result in an overflow? Justify you answer, no mark will be given if you just answer "yes" or "no". (2 points)
7 8 b) If this is an 8-bit unsigned number system, does the calculation in part (a) result in an overflow? Justify you answer, no mark will be given if you just answer "yes" or "no". (2 points)