Binary Addition using 2’s Complement

When negative numbers are expressed in binary addition using 2’s complement the addition of binary numbers becomes easier. This operation is almost similar to that in 1’s complement system and is explained with examples given below:


A. Addition of a positive number and a negative number.

We consider the following cases.

Case I: When the positive number has a greater magnitude

In this case the carry which will be generated is discarded and the final result is the result of addition.


The following examples will illustrate this method in binary addition using 2’s complement:

In a 5-bit register find the sum of the following by using 2’s complement:

(i) -1011 and -0101

Solution:

                    + 1 0 1 1           ⇒          0 1 0 1 1

                    - 0 1 0 1           ⇒          1 1 0 1 1     (2’s complement)

               (Carry 1 discarded)               0 0 1 1 0

Hence the sum is + 0110.


(ii) + 0111 and – 0011.

Solution:

                    + 0 1 1 1           ⇒          0 0 1 1 1

                    - 0 0 1 1           ⇒          1 1 1 0 1     

               (Carry 1 discarded)               0 0 1 0 0

Hence the sum is + 0100.


Case II: When the negative number is greater.

When the negative numbers is greater no carry will be generated in the sign bit. The result of addition will be negative and the final result is obtained by taking 2’s complement of the magnitude bits of the result.

The following examples will illustrate this method in binary addition using 2’s complement:

In a 5-bit register find the sum of the following by using 2’s complement:

(i) + 0 0 1 1 and - 0 1 0 1

Solution:

                    + 0 0 1 1           ⇒          0 0 0 1 1

                    - 0 1 0 1           ⇒          1 1 0 1 1     (2’s complement)

                                                       1 1 1 1 0

2’s complement of 1110 is (0001 + 0001) or 0010.

Hence the required sum is - 0010.


(ii) + 0 1 0 0 and - 0 1 1 1

Solution:

                    + 0 1 0 0           ⇒          0 0 1 0 0

                    - 0 1 1 1           ⇒          1 1 0 0 1     (2’s complement)

                                                       1 1 1 0 1

2’s complement of 1101 is 0011.

Hence the required sum is – 0011.


B. When the numbers are negative.

When two negative numbers are added a carry will be generated from the sign bit which will be discarded. 2’s complement of the magnitude bits of the operation will be the final sum.


The following examples will illustrate this method in binary addition using 2’s complement:

In a 5-bit register find the sum of the following by using 2’s complement:

(i) – 0011 and – 0101

Solution:

                    - 0 0 1 1           ⇒          1 1 1 0 1          (2’s complement)

                    - 0 1 0 1           ⇒          1 1 0 1 1          (2’s complement)

               (Carry 1 discarded)               1 1 0 0 0

2’s complement of 1000 is (0111 + 0001) or 1000.

Hence the required sum is – 1000.


(ii) -0111 and – 0010.

Solution:

                    - 0 1 1 1           ⇒          1 1 0 0 1          (2’s complement)

                    - 0 0 1 0           ⇒          1 1 1 1 0          (2’s complement)

               (Carry 1 discarded)               1 0 1 1 1

2’s complement of 0111 is 1001.

Hence the required sum is – 1001.

Binary Numbers

  • Decimal Number System
  • Why Binary Numbers are Used
  • Binary to Decimal Conversion
  • Conversion of Numbers
  • Hexa-decimal Number System
  • Conversion of Binary Numbers to Octal or Hexa-decimal Numbers
  • Octal and Hexa-Decimal Numbers
  • Signed-magnitude Representation
  • Radix Complement
  • Diminished Radix Complement
  • Arithmetic Operations of Binary Numbers


From Binary Addition using 2’s Complement to HOME PAGE




Didn't find what you were looking for? Or want to know more information about Math Only Math. Use this Google Search to find what you need.



New! Comments

Have your say about what you just read! Leave me a comment in the box below. Ask a Question or Answer a Question.




Share this page: What’s this?

Recent Articles

  1. Properties of Division | Division of Property Overview|Math Properties

    Jan 22, 25 01:30 AM

    Properties of Division
    The properties of division are discussed here: 1. If we divide a number by 1 the quotient is the number itself. In other words, when any number is divided by 1, we always get the number itself as the…

    Read More

  2. Terms Used in Division | Dividend | Divisor | Quotient | Remainder

    Jan 22, 25 12:54 AM

    Divide 12 Candies
    The terms used in division are dividend, divisor, quotient and remainder. Division is repeated subtraction. For example: 24 ÷ 6 How many times would you subtract 6 from 24 to reach 0?

    Read More

  3. Divide on a Number Line | Various Division Problems | Solved Examples

    Jan 22, 25 12:41 AM

    How to divide on a number line? Learn to divide using number line to find the quotient. Solved examples to show divide on a number line: 1. Solve 14 ÷ 7 Solution: 7 is subtracted repeatedly

    Read More

  4. Divide by Repeated Subtraction | Division as Repeated Subtraction

    Jan 22, 25 12:18 AM

    Divide by Repeated Subtraction
    How to divide by repeated subtraction? We will learn how to find the quotient and remainder by the method of repeated subtraction a division problem may be solved.

    Read More

  5. Division Sharing and Grouping | Facts about Division | Basic Division

    Jan 21, 25 08:06 AM

    Sharing and Grouping
    We will learn division sharing and grouping. Share eight strawberries between four children. Let us distribute strawberries equally to all the four children one by one.

    Read More