# Binary Addition

We have discussed about the topic binary arithmetic as a whole, now we will concentrate on the topic
Here 1 + 1 = 0 and the carry is written on the top of the next significant bit which will be used in the next step.
As we know 0 + 0 = 0 and 1 + 0 = 1 (1 comes from the carry) and the result 1 is written.
Again 1 + 0 = 1 and that is exactly what is written.
The next two bits which are to beaded are 0 and 0 and 0 + 0 = 0.
Again the same operation 0 + 0 = 0 is done and written.
The last two bits include 1 + 1 = 0 and carry 1 which is written directly in the result.

Closely Related Articles
Digital ElectronicsBoolean Algebra Theorems and Laws of Boolean AlgebraDe Morgan Theorem and Demorgans LawsTruth Tables for Digital LogicBinary Arithmetic Binary SubtractionSimplifying Boolean Expression using K MapBinary DivisionExcess 3 Code Addition and SubtractionK Map or Karnaugh MapSwitching Algebra or Boolean AlgebraBinary MultiplicationParallel SubtractorMore Related Articles
Binary 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 FamiliesBinary 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 Code2s Complement ArithmeticError Detection and Correction Codes9s complement and 10s complement | SubtractionSome Common Applications of Logic GatesKeyboard EncoderAlphanumeric codes | ASCII code | EBCDIC code | UNICODELatches 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 FlopsNew Articles
Resistance Variation with TemperatureLook Ahead Carry AdderGround Clearance of Different Transmission LinesWater Meter**binary addition**separately. Addition, subtraction, multiplication and division are the four types of operation on which all the arithmetic operation depends of decimal number system, similarly these are the pillars of binary arithmetic also. The first and perhaps the most important of them all is**binary addition**and it is the easiest of them all also. Now coming to the method of addition, there are four points or steps to remember before proceeding through the operation. These are As there no numbers other than 0 and 1 in the binary number system these four steps include all the possible operations of addition. Now let us explain the operation through an example Suppose A = 10010101 and B = 10000110Now we want to find out A + B i.e. we have to perform binary addition, we will look through the process with thorough explanation. This is the addition of the first two least significant digits which are 0 and 1 and 1 + 0 = 1 which is written. Here again the similar step is done i.e. 0 + 1 = 1.

The use of binary addition in the digital electronics field can be seen clearly, we have discussed about the logic gates which are perhaps the most important part of digital electronics are nothing but the binary arithmetic operations, the XOR gate is the pure **binary addition**.