# Binary Adder Half and Full Adder

Binary adder is one of the basic combinational logic circuits. The outputs of a combinational logic circuit depend on the present input only. In other words, outputs of combinational logic circuit do not depend upon any previously applied inputs. It does not require any memory like component. Binary adder is one of the basic combinational logic circuits as present state of input variables.

Closely Related Articles
Binary 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 WorkingMore 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 SubtractorOR 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
Water MeterAir MeterDigital PotentiometersBasic Construction of Wind TurbineCharacteristics of Sensors## Designing Binary Adder

### Half Adder

Before designing a binary adder, let us know some basic rules of binary addition. The most basic binary addition is addition of two single bit binary numbers that is addition of two binary digits. The binary digits are 0 and 1. Hence, there must be four possible combinations of binary addition of two binary bits In the above list, first three binary operations result in one bit but fourth one result in two bits. In one bit binary addition, if augend and addend are 1, the sum will have two digits. The higher significant bit (HSB) or Left side bit is called carry and the list significant bit (LSB) or right side bit of the result is called sum bit. The logical circuit performs this one bit binary addition is called half adder.#### Design of Half Adder

For designing a half adder logic circuit, we first have to draw the truth table for two input variables i.e. the augend and addend bits, two outputs variables carry and sum bits. In first three binary additions, there is no carry hence the carry in these cases are considered as 0.#### Truth Table for Half Adder

#### K-map for Half Adder

Now from this truth table we can draw K-map for carries and sums separately. For above K-maps we get, Hence, the logical design of Half Adder would be Although from truth table it is clearly seen that carry (C) column signifies AND operation and sum (S) column signifies XOR operation between input variables but till we went through K-map as it is general practice to do so for more complex binary logic operations.### Full Addition

Before knowing about full adder, let us know what is full addition? For that let us consider the example There, are two four bits binary numbers 1101 and 0111 which we have to add. The process of binary addition is like follows,- We have to add first list significant bit (LSB) of both 4bits binary number first and this will result a two bits binary number. Here, LSB of 1101 and 0111 are 1, hence 1 + 1 = 10. The LSB of 10 is 0 and higher significant bit (HSB) is 1.
- The LSB of the result is sum and to be put at the list significant position of the final result of the sum, and HSB of the two bits results will be carry and to be added with next higher significant bit of two 4bits augend and addend are 0 and 1 and the carry of previous result i.e. 1 to be added with 0 and 1.
- After this addition, that is next higher than list significant bit of bits of both binary augend and addend and it is previous carry we get another two bits result. This also has carry and sum. Here also we will write sum at final result and add the carry to the next higher significant bits of augend and addend. This will continue up to most significant bit of augend and addend.

### Full Adder

Full adder is a conditional circuit which performs full binary addition that means it adds two bits and a carry and outputs a sum bit and a carry bit. Any bit of augend can either be 1 or 0 and we can represent with variable A, similarly any bit of addend we represent with variable B. The carry after addition of same significant bit of augend and addend can represent by C. Hence truth table for all combinations of A, B and C is as follows, From the above table, we can draw K-map for sum (s) and final carry (C_{out}). Hence, from K-maps,## Binary Parallel Adder

A full binary adder performs addition of any single bit of one binary number, same significant or same position bit of another binary numbers and carry comes from result of addition of previous right side bits of both binary numbers. But a single full adder cannot add more than one bits binary number instantly. This can be done only by connecting as many full adders as the number of bits of the binary numbers whose addition is to be performed. This parallel combination of full adders which performs addition of specific bits binary numbers is called binary parallel adder. For adding two 4 bit binary numbers we have to connect 4 full adders to make 4 bit parallel adder. The inter connection of 4 full adder in 4bit parallel adder is shown below, Let us examine the justification of the above circuit by taking an example of addition of two 4 bit binary numbers. Let us add 1011 with 1101. As there is no previous carry C_{0}=0. Therefore, final result of the addition would be There are 1 bit, 2 bits and 4 bits**parallel adders**ICs commercially available in market. For n bit parallel adder required number of such ICs are connected together. 4 bit parallel adder IC is 4008. In n bit parallel adder, output carry terminal of one IC would be connected with input carry terminal of next IC.