Relation between integer and two's-complement addition. When x+y is less than 2=1, there is a negative overflow. When it is greater than or equal to 2x1, there is a posithe overflow. Case 1) Negative Overflow Case 2) The integer sum equals the 2's complement sum Case 3) The integer sum equals the 2's complement sum Case 4) Positive Overflow Example: Two's-complement addition examples. The bit-level representation of the 4-bit two's-complement sum can be obtained by performing binary addition of the operands and truncating the result to 4 bits. Solve: Give the integer values of the 5-bit arguments, the values of both their integer and two 's-contiplement sums, the bit-level representation of the two's-complement sum, and the case Example: As illustrations, Figure shows the results of multiplying different 3.bit numbers. For each pair of bitlevel operands, we perform both unsigoed and two's-complement multiplication, yielding 6-bit products, and then truncate these to 3 bits. The unsigned truncated prediet always equals x. y mod 8 . The bitlevel representations of both truncated products are identical for both unsigned and two's-eomplement multiplication, even though the full 6-bit representations differ