When multiplying signed numbers, one way to get the correct answer is to convert the multiplier and multiplicand to positive numbers, save the original signs, and then adjust the final value accordingly. Using a table similar to that shown in Figure 3.7, calculate the product of A and B using the hardware described in Figure 3.4. You should show the contents of each register on each step, and include the step necessary to produce the correctly signed result. Assume A and B are stored in 6-bit sign-magnitude format.

Figure 3.7

Figure 3.4

The following table shows pairs of octal numbers.

Iteration 0 1 2 3 4 Step Initial values 1a: 1 Prod Prod + Mcand 2: Shift left Multiplicand 3: Shift right Multiplier 1a: 1 Prod = Prod + Mcand 2: Shift left Multiplicand 3: Shift right Multiplier 1: 0 No operation 2: Shift left Multiplicand 3: Shift right Multiplier 1: 0 No operation 2: Shift left Multiplicand 3: Shift right Multiplier Multiplier 0011 0011 0011 0001 0001 0001 0000 0000 0000 0000 0000 0000 0000 Multiplicand 0000 0010 0000 0010 0000 0100 0000 0100 0000 0100 0000 1000 0000 1000 0000 1000 0001 0000 0001 0000 0001 0000 0010 0000 0010 0000 Product 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