- 1’s Complement Definition: 1’s complement is defined as a method of representing negative numbers in binary by inverting all bits of a positive number.
- Binary Representation: In 1’s complement, convert each 1 to 0 and each 0 to 1 to represent negative numbers.
- Subtraction Simplified: Binary subtraction is made easier using 1’s complement.
- Example Calculation: To subtract using 1’s complement, invert the subtrahend’s bits and add to the minuend.
- Overflow Handling: If there is an overflow bit, add it to the remaining result for the final answer.
We know the basics of number systems in digital electronics. Now, let’s focus on the binary number system, where 0 and 1 represent all numbers. Before diving into 1’s complement, we need to understand a few concepts.
Let us look through the numbers from 0 to 7
Now we have given this as an example to illustrate the representation of binary numbers. This is done to represent the positive numbers. But what if we want to represent the negative numbers in binary number system.
The binary number system doesn’t have a negative sign. Various methods have been developed to represent negative numbers. The most popular are 1’s complement and 2’s complement. Though 2’s complement is more common, 1’s complement is still used because it’s simpler to implement. Let’s explore 1’s complement.
Number Representation
1’s complement is an easy method to represent negative numbers in binary. First, take the binary value of the positive number, then switch all 1s to 0s and all 0s to 1s. This new value is the negative number in 1’s complement form. Let’s see some examples to understand better.
Example
First let us consider the positive numbers from 0 -7
Now the 1’s complement of these numbers will be like as follows
Subtraction using 1’s complement
The method of binary subtraction becomes very easy with the help of 1’s complement. Now let us look at an example to understand subtraction using 1’s complement.
Suppose A = (5)10 = (0 1 0 1)2
And B = (3)10 = (0 0 1 1)2
And we want to find out A – B
For this first we have to calculate 1’s complement of B
1’s complement of B = 1 1 0 0
Now we have to add the result with A
Now in the result we can see that there is an overflowing bit which we have to add with the remaining result
This is the desired result.
And when there will not be any overflowing digit the result obtained in the previous stage will be the answer.
