COMPUTER ORGANIZATIONS COURSE

3.13 [20] Using a table similar to that shown in Figure 3.6, calculate the product of the hexadecimal unsigned 8-bit integers 62 and 12 using the hardware described in Figure 3.5. You should show the contents of each register on each step. Multiplicand 64 bits Product 64-bit ALU Iteration Step Multiplier Multiplicand 0 Initial values 0010 0000 0010 1 1a: 1 Prod - Prod + Mcand 0011 0000 0010 2: Shift left Multiplicand 0011 0000 0100 3. Shift right Multiplier DOCE 0000 0100 2 1a: 1 ProdProd. Meand 0001 0000 0100 2: Shift left Multiplicand 0001 0000 1000 3. Shift right Multiplier 000 0000 1000 3 1:0 No operation 0000 0000 1000 2: Shift left Multiplicand 0000 0001 0000 3: Shift right Multiplier 000 0001 0000 4 1: 0 No operation 0000 0001 0000 2: Shift left Multiplicand 0000 0010 0000 3: Shift right Multiplier 0000 0010 0000 FIGURE 3.6 Multiply example using algorithm in 0000 0000 0000 0010 0000 0010 0000 0010 0000 0110 0000 0110 0000 0110 0000 0110 0000 0110 0000 0110 0000 0110 0000 0110 0000 0110 Product Shift right Write Control test 129 bits FIGURE 3.6 Refined version of the multiplication hardware. 64 bits 64 54 bits 8.16 [20] Calculate the time necessary to perform a multiply using the approach given in Figure 3.7 if an integer is 8 bits wide and an adder takes four time units. 64 11++ TOT T Phochot127 Product25 Pod FIGURE 3.7 Fast multiplication hardware. 3) Multiply each of the following pairs of 8-bit numbers using binary representation, Booth's coding and bit-pairing coding of the multiplier: Multiplicand Multiplier A3 7C 4B 6E