Develop a Boolean equation for overflow detection_16 truth table for two inputs-CSDN博客

Arithmetic operations have a potential to run into a condition known as overflow.
Overflow occurs with respect to the size of the data type that must accommodate the result.
Overflow indicates that the result was too large or too small to fit in the original data type.
When two signed 2's complement numbers are added, overflow is detected if:
1. both operands are positive and the result is negative, or
2. both operands are negative and the result is positive.
When two unsigned numbers are added, overflow occurrs if
- there is a carry out of the leftmost bit.

Computers don't know the difference between signed and unsigned binary numbers.
This is a good thing, because it makes logic circuits fast.
This is also a bad thing, because distinguishing between signed and unsigned is our responsibility.
The distinction is very important when detecting an overflow after addition or subtraction.
Correct approach to detect the overflow is to consider two separate cases:
1. Overflow when adding unsigned numbers.
1. Overflow when adding signed numbers.

Let's first solve the problem for addition of one-bit quntities:
```
     0 + 0 =  0
     0 + 1 =  1
     1 + 0 =  1
     1 + 1 = 10
```
- The last line indicates that we have a carry output.
- That is, one-bit quantity cannot accommodate (1 + 1).
- Therefore, larger data type is required for (1 + 1) to succeed.
When multi-bit unsigned quantities are added, overflow occurrs if there is a carry out from the leftmost (most significant) bit.

Consider overflow detection when adding two one-bit signed quntities.
Although one bit is required to represent the data, another bit has to represent the sign.
Therefore, two-bit data type is required:

Recall that to represent 2's complement negative number, we must
1. Flip all bits
2. Add 1.

The full adder knows nothing about the difference between signed and unsigned numbers.
In 2's complement binary representation, the sign bit is simply the leftmost, or most significant, bit of the data type.
The full adder circuit will be adding the sign bit column just as any other bit.

Full adder truth table for the sign bit can be extended to include new output which indicates if overfow condition has occured.
Our task is to populate the OVERFLOW column with corresponding values.

Notice that when operands have opposite signs, their sum will never overflow:
```
    1 + -2 = -1
    1 + -1 = 0
```
Therefore, overflow can only occur when the operands have the same sign:
```
      1 + 1 = 2
    -2 + -2 = -4
    -2 + -1 = -3
```
None of the results { 2, -4, -3 } can fit into the two-bit signed data type.

There is no overflow, if:
- both operands are positive and the sum is positive.
- both operands are negative and the sum is negative.

When two signed 2's complement numbers are added, overflow is detected if:
1. both operands are positive and the sum is negative, or
2. both operands are negative and the sum is positive.

Specific overflow detection requires knowing the operation and the representation.
Overflow occurs when you do some operation to two valid representations...
- ...and the result can not be represented in the representation because the value is too large or too smal.
Overflow detection is detecting overflow for a specific representation...
- ...Too often people mistake overflow condition for unsigned overflow, when the carry out is 1.
Overflow detection for 2's complement addition is different:
- One way to detect it is to XOR the carry in and the carry out.