How does an adder perform unsigned integer subtraction?
问题 Suppose that A and B are signed positive integers, then for A-B , it's calculated using A+2 's complement of B . For example, in a 4-bit binary system, for signed integers, we have 7-3=0111-0011=0111+1101=(1)0100 , the 1 in the bracket is the carry bit. According to the overflow rule for signed integer, we know there is no overflow and the result is therefore correct. However, for unsigned integers, what will happen if we calculate 7-3 ? If we use the same way we mentioned above: 7-3=0111