# 2s Complement Arithmetic

### How to represent decimal number in 2’s complement?

Let us take a number. The negative signed that number is such number sum of which with this number is zero. Take examples of our most familiar number system that is decimal system.Where, In binary system there are only two digits 0 and 1. In binary system each and every number and its sign are represented by using only these two digits 0 and 1. As the negative and positive signs can not be written directly in binary system, we have to find some alternative method of representing them.

For that we take advantage of definition of negative numer. If we have to represent a negative binary number, we have to find a binary number sum of which with the original unsigned or positive binary number is zero. As the sum of these two numbers is zero, the second number is taken as negative equivalent of the first number.

Suppose we have to write - 5 in binary which is negative of 5 or + 5. Now 5 or + 5 can be represented in binary byte or 8 bits system as 0000 0101 and zero is represented in binary byte or 8 bits system as 0000 0000.
Hence this result is representation of ( - 5)_{10}.
Now let us examine 2's complement of 0000 0101 and this is
Hence, it is proved zero minus any binary number is nothing but 2's complement of this number, hence 2's complement of any binary number can be represented as negative equivalent of that number.

In 2's complement first we convert a decimal number into binary number system. Suppose we want to represent (5)_{10} into binary 2’s complement. Binary representation of (5)_{10} is (0000 0101)_{2}. Now the interesting fact is that the unsigned form (5)_{10} into 2’s complement is direct representation of binary form of (5)_{10} i.e. (0000 0101)_{2}. Unsigned number is treated as positive number. Signed decimal number can be a positive number or negative. Now to calculate 2’s complement for a signed decimal number i.e. (-5)_{10}, we have to find out the 1’s complement and then convert each digit into its opposite digit (i.e. 1 into 0 or 0 into 1 ) and add 1 at last. This result after addition is the 2’s complete representation of signed (negative) decimal number.
Now look at the chart below.
(+5)_{10} is same as (5)_{10}. But for (-1)_{10} it is treated as unsigned (255)_{10}. (-5)_{10} ⇔ (251)_{10}
Always keep it in the mind that negative 2’s complement numbers are always represented as the binary number in such a way that when added to a positive number of the same magnitude must be zero.

The important thing is to be kept in the mind that the left most bit or significant bit indicates the sign of the integer. It is called the signed bit also.

- If the left most bit is zero then the number is positive.
- If the left most bit is one then the number is negative.

## Arithmetic in 2’s Complement Method

### 2’s Complement Addition

Addition in the 2’s complement, it always follows the same rule as it is used in the normally binary addition. Suppose we want to add (8)_{10}and (-3)

_{10}.

First we have to convert them into 2’s complement and simply add them. As carry is 1 then number is positive. Here carry is 1 and it is out of 8 bits hence is not considered in byte and hence the answer is one byte long positive number. So it is clear that for signed and unsigned numbers addition can be performed easily in 2’s complement.

### 2’s Complement Subtraction

Subtraction in 2’s complement follows the same rule as it is in the normally binary addition. Only thing is that here subtrahend is first converted to its negative form and then it is added with minuend. Suppose we want to subtract (8)_{10}from (9)

_{10}. First convert (8)

_{10}from (-9)

_{10}into 2’s complement and simply add. As carry is 0 then number is negative. So it is clear that subtraction can be performed easily in 2’s complement easily.

### 2's Complement Multiplication

For 2’s complement multiplication, it always follows the same rules as binary multiplication. Suppose we want to multiply ( - 4)_{10}with (4)

_{10}that gives (-16)

_{10}. Now , (- 4)

_{10}= 1111 1100 in 2’s complement and (4)

_{10}= 0000 0100 in 2’s complement

### 2’s Complement Division

For the 2’s complement division, the method is 2’s complement subtraction repeatedly. First calculate the 2’s complement of the divisor and then this converted divisor is to be added to the dividend. Now come to the next subtraction cycle. Here quotient replaces the dividend. Repeats it again and again up to the quotient is getting too small or zero. If it is not zero then it is treated as remainder. Suppose we want to calculate (7)_{10}÷ (3)

_{10}, answer gives (2)

_{10}as quotient and (1)

_{10}as remainder. Now let’s start to calculate it in 2’s complement. As the repetition is in two rounds, then the quotient is (2)

_{10}.

**Comments/Feedbacks**

Closely Related Articles Binary Number System | Binary to Decimal and Decimal to Binary ConversionBinary to Decimal and Decimal to Binary ConversionBCD or Binary Coded Decimal | BCD Conversion Addition SubtractionBinary to Octal and Octal to Binary ConversionOctal to Decimal and Decimal to Octal ConversionBinary to Hexadecimal and Hex to Binary ConversionHexadecimal to Decimal and Decimal to Hexadecimal ConversionGray Code | Binary to Gray Code and that to Binary ConversionOctal Number SystemDigital Logic Gates2′s Complement1′s ComplementASCII CodeHamming CodeError Detection and Correction Codes9s complement and 10s complement | SubtractionSome Common Applications of Logic GatesKeyboard EncoderAlphanumeric codes | ASCII code | EBCDIC code | UNICODEMore Related Articles Digital ElectronicsBoolean Algebra Theorems and Laws of Boolean AlgebraDe Morgan Theorem and Demorgans LawsTruth Tables for Digital LogicBinary Arithmetic Binary AdditionBinary SubtractionSimplifying Boolean Expression using K MapBinary DivisionExcess 3 Code Addition and SubtractionK Map or Karnaugh MapSwitching Algebra or Boolean AlgebraBinary MultiplicationParallel SubtractorBinary Adder Half and Full AdderBinary SubstractorSeven Segment DisplayBinary to Gray Code Converter and Grey to Binary Code ConverterBinary to BCD Code ConverterAnalog to Digital ConverterDigital Encoder or Binary EncoderBinary DecoderBasic Digital CounterDigital ComparatorBCD to Seven Segment DecoderParallel AdderParallel Adder or SubtractorMultiplexerDemultiplexer555 Timer and 555 Timer WorkingLook Ahead Carry AdderOR Operation | Logical OR OperationAND Operation | Logical AND OperationLogical OR GateLogical AND GateNOT GateUniversal Gate | NAND and NOR Gate as Universal GateNAND GateDiode and Transistor NAND Gate or DTL NAND Gate and NAND Gate ICsX OR Gate and X NOR GateTransistor Transistor Logic or TTLNOR GateFan out of Logic GatesINHIBIT GateNMOS Logic and PMOS LogicSchmitt GatesLogic Families Significance and Types of Logic FamiliesLatches and Flip FlopsS R Flip Flop S R LatchActive Low S R Latch and Flip FlopGated S R Latches or Clocked S R Flip FlopsD Flip Flop or D LatchJ K Flip FlopMaster Slave Flip FlopRead Only Memory | ROMProgrammable Logic DevicesProgrammable Array LogicApplication of Flip FlopsShift RegistersBuffer Register and Controlled Buffer RegisterData Transfer in Shift RegistersSerial In Serial Out (SISO) Shift RegisterSerial in Parallel Out (SIPO) Shift RegisterParallel in Serial Out (PISO) Shift RegisterParallel in Parallel Out (PIPO) Shift RegisterUniversal Shift RegistersBidirectional Shift RegisterDynamic Shift RegisterApplications of Shift RegistersUninterruptible Power Supply | UPSConversion of Flip FlopsJohnson CounterSequence GeneratorRing CounterNew Articles Principle of Water Content Test of Insulating OilCollecting Oil Sample from Oil Immersed Electrical EquipmentCauses of Insulating Oil DeteriorationAcidity Test of Transformer Insulating OilMagnetic Flux