Design Half Adders, Full Adders, Ripple Carry Adders:
An adder is the fundamental building block of many digital systems. An adder is a digital circuit that performs the addition of two numbers. It is easy to design and made up of simple logic gates. A binary adder is a circuit that performs addition on binary numbers only. A parallel adder means all the inputs are available simultaneously, and processing each bit position is in parallel. This is in contrast to a serial adder, which adds binary numbers one bit at a time, processing each bit sequentially.- Design a one-bit full adder
- Input and output
- Block diagram
- Truth Table
- Karnaugh Map to get simplified SOP expression for full adder logic
- Circuit diagram from the simplified logic expression
Design a half-adder circuit:
A half adder is a circuit that accepts two binary inputs (let's suppose A and B) of one bit. It produces two outputs (sum and carry) of one bit. For two inputs there are 22 possible input combinations.
Here,
The input variables are designated as augend (A) and addend (B) bits. The output variables are sum (S) and output carry (CO).
The following truth table and illustration depict the same.
![]() |
Figure: How to perform addition on two binary numbers |
From the truth table, there are many possible ways to implement a half-adder. In this tutorial, the half-adder circuit is implemented in many different ways and drives their expressions as well.
Half adder circuit using XOR gate
Half adder circuit using NAND gates
Half adder circuit using NOR gates only
Half-adder circuit using basic logic gates
Half adder circuit using XOR gate:
![]() |
Figure: Half adder block diagram |
![]() |
Figure: Half adder circuit using a xor gate and an and gate. |
Half adder circuit using basic logic gates:
![]() |
Figure: Half adder circuit using basic logic gates (AND OR, NOT gates only) |
Design a half-adder circuit using NAND gates only and drive its expression:
Half adder circuit using NOR gate and drive its expression:
Five NOR gates are required to implement a half-adder circuit.
![]() |
Figure: Half adder circuit design using NOR gates only |
Design a one-bit full adder with two half adders and an OR gate:
There are various steps involved in designing a full adder.
- Input and output
- Block diagram
- Truth Table
- Karnaugh Map to get simplified SOP expression for full adder logic
- Circuit diagram from the simplified logic expression
Input And Output:
Block Diagram:
The block diagram is given below. The block diagram given below shows the full adder takes two binary numbers (A and B) as input. Both inputs are 1-bit numbers. There is a carry input as well. It is also 1-bit long. So, there are a total of three inputs, each input is only 1-bit long. There are two outputs S and COUT (sum and carry respectively). Both outputs are 1-bit long. There is an "add" circuit that performs addition on two binary numbers. The block diagram helps to visualize the internal workings of the full adder and its relationship to the inputs and outputs.
This adder is a building block of higher-bit adders. This is known as a one-bit full adder.
![]() |
Figure: Full adder block diagram |
Truth Table:
Karnaugh Map For Full Adder Circuit:
![]() |
Figure: Karnaugh Map for 1-bit full adder. It is obtained from the truth table. |
The implementation of a one-bit full adder circuit is given below:
![]() |
Figure: Full adder made up of two half adders and an OR gate. |
![]() |
Figure: Gate level implementation of a full adder circuit. |
What are 1-bit full adders? How many full adder blocks are required?
It is an adder that can add two 1-bit numbers. There is an additional input, that is carry input. This is the carry generated from the previous adder. There are two outputs, sum and carry. It comprises two half-adders. And an OR gate. To add two 1-bit binary numbers there is only one full adder required. Keep in mind that the bit width of each input is 1 bit. The figure is given below.
What are 2-bit full adders?
There is a carry input as well. It is 1 bit long. So, there are a total of three inputs, input A and B are 2-bit long. There are two outputs S and CO (sum and carry). The sum (S) is 2-bit long and COUT is 1-bit long. The truth table for a 2-bit full adder would have 32 entries, one for each possible combination of inputs.
![]() |
Figure: 2 bit parallel full adder |
What are 3-bit adders?
There is a carry input as well. It is 1 bit long. So, there are a total of three inputs, input A and B are 3-bit long. There are two outputs S and CO (sum and carry). The sum (S) is 3-bit long and COUT is 1-bit long. The truth table for a 3-bit full adder would have 128 entries, one for each possible combination of inputs.
![]() |
Figure: 3 bit parallel full adder |
What are 4-bit adders?
There is a carry input as well. It is 1 bit long. So, there are a total of three inputs, input A and B are 2-bit long. There are two outputs S and CO (sum and carry). The sum is 4-bit long and COUT is 1-bit long. The truth table for a 2-bit full adder would have 256 (2n, where n = number of input bits) entries, one for each possible combination of inputs. Here are 9 inputs applied to four full adders.
What are n-bits adders?
What are parallel binary adders?
Delay Associated With Ripple Carry Adder:
A is the augend, bit width: 4
B is the augend, bit width: 4
Ci is an input carry
COUT = output carry are the output
C1, C2, and C3 are the intermediate carry signals generated from the intermediate stages.
Looking at the dock diagram, at the initial State, this circuit has 9 inputs
Each full adder has to wait for the carry signal.
For an 'n' bit full adder, there are 2n gate levels for the carry to propagate from input to output.