Binary Arithmetic with 2's Complement

The Power of 2's Complement Arithmetic

The primary reason digital systems use 2's complement is that it unifies addition and subtraction. A single hardware circuit, a binary adder, can handle both operations. The rule is elegantly simple:

To compute the subtraction A - B, you simply compute the addition A + (-B), where -B is represented in its 2's complement form.

Let's look at a simple example: (+7) - (+3). This is equivalent to (+7) + (-3).
In 8-bit 2's complement:

• +7 is 0000 0111
• +3 is 0000 0011. Its 2's complement, -3, is 1111 1101.

Now, we just perform addition:

  0000 0111   (+7)
+ 1111 1101   (-3)
-----------
1 0000 0100   (+4)

Notice that the addition produced a 9th bit (a carry-out). In 2's complement arithmetic, any carry-out from the most significant bit (MSB) position is discarded. The remaining 8-bit result is 0000 0100, which is the correct answer, +4.

This "add and discard carry" method works for all combinations of numbers.

A Systematic Guide to 2's Complement Operations

To see how this works in every scenario, we'll use a detailed video walkthrough. The video covers addition of two positive numbers, a positive and a negative, and two negative numbers, and it will introduce the concept of overflow.

From the video, you should now be familiar with the general procedure for all cases. The key is to represent all numbers (positive or negative) in their proper n-bit 2's complement form and then simply add them.

Dealing with Limits: Overflow

In a fixed-width n-bit system, there's a limited range of numbers you can represent. For an n-bit 2's complement system, the range is from $-2^{n-1}$ to $+(2^{n-1}-1)$. For the 5-bit system in the video, this range is -16 to +15.

What happens if an operation produces a result outside this range? This condition is called overflow, and it yields an invalid result.

The rule for detecting overflow in 2's complement addition/subtraction is simple and crucial:

Overflow occurs if, and only if, the addition of two numbers with the same sign results in a number with the opposite sign.

• Positive + Positive = Negative (Overflow)
• Negative + Negative = Positive (Overflow)
• Positive + Negative = (Never causes overflow)

Let's reinforce this by revisiting the video and also looking at a textual explanation.

The concept of overflow can be visualized using the 2's complement circle. When you add two large positive numbers, you might "wrap around" the circle past the largest positive value (+7 in the 4-bit case) and end up in the negative number territory.

For a more formal, text-based explanation and further examples, the following article is very useful. It demonstrates overflow and also provides more subtraction examples.

Practice Problems

As you requested, let's work through some problems to solidify these skills. Assume an 8-bit system for all questions unless stated otherwise.

1. Calculate 45 - 19.
2. Calculate 20 - 58.
3. Calculate (-33) + (-40).
4. Using a 5-bit system, calculate 12 + 9. Did an overflow occur? How do you know?
5. Using a 5-bit system, calculate (-12) - 9. Did an overflow occur? How do you know?

Take your time to work through these step-by-step:

• Convert all numbers to their binary 2's complement form.
• For subtraction A - B, find the 2's complement of B and add it to A.
• Perform the binary addition.
• Discard any final carry-out bit.
• Check for overflow using the sign rule.
• Convert the binary result back to decimal to verify your answer.

Self-Correction and Reflection:

• For problem 4 & 5: Remember the 5-bit range is -16 to +15. The overflow rule is your primary tool. Don't just trust the decimal calculation; the binary representation is what reveals the overflow.

Conclusion

In this lesson, you've mastered the mechanics of 2's complement arithmetic, the cornerstone of how computers perform calculations. This process allows complex subtraction operations to be handled by the same simple adder circuits used for addition, a principle of hardware efficiency you'll see again and again.

Here are the key takeaways:

• Subtraction is Addition: A - B is executed as A + (2's complement of B).
• Discard the Carry: In 2's complement arithmetic, any carry-out from the MSB is simply ignored.
• Interpret the Sign: The MSB of the result indicates its sign (0 for positive, 1 for negative).
• Watch for Overflow: An overflow yields an incorrect result and only happens when adding numbers of the same sign. It is detected when the sign of the result is different from the sign of the operands.

So far, we've focused on binary number systems used for arithmetic. In the next lesson, we will broaden our scope to explore other important binary codes, such as BCD, Gray code, and Excess-3. These codes are not typically used for computation but are essential for other tasks, like interfacing with numeric displays or preventing errors in electro-mechanical systems.