If the product of two, n-bit, signed numbers in the 2's-complement representation can be represented in n bits, the manual multiplication algorithm shown in Figure 6.6a can be used directly, treating the sign bits the same as the other bits. Try this on each of the following pairs of 4-bit signed numbers:

(a) Multiplicand 1110 and Multiplier = 1101

(b) Multiplicand=0010 and Multiplier = 1110 Why does this work correctly?

LO1