Full Adder

Definition

A full adder is a combinational logic circuit that adds three input bits: two significant bits and one carry-in bit, and generates two outputs: a sum bit and a carry-out bit.

For inputs:

A

= first binary input

B

= second binary input

Cin

= carry input from the previous stage

The outputs are:

S

= sum

Cout

= carry output

It performs the binary addition:

A + B + Cin = Sum + Carry

Main Content

1. Full Adder Inputs and Outputs

A full adder has three inputs: A, B, and Cin.
It has two outputs: Sum (S) and Carry out (Cout).

The purpose of each signal is:

A and B

are the bits to be added.

Cin

is the carry received from the previous lower-order bit addition.

Sum

is the least significant bit of the result for that stage.

Cout

is the carry passed to the next higher-order bit.

This makes the full adder especially useful in cascade connections. For example, to add two 4-bit binary numbers, four full adders are connected in series so that each stage handles one bit position and passes carry forward.

Example: If A = 1, B = 1, and Cin = 1:

Total = 3 in decimal
Binary result = 11
So, Sum = 1 and Cout = 1

That means the current bit position stores 1, and the carry is sent to the next stage.

2. Full Adder Logic and Truth Table

The full adder follows a fixed binary addition rule for all possible input combinations.
Its operation can be fully represented using a truth table.

Truth Table of Full Adder

A	B	Cin	Sum	Cout
0	0	0	0	0
0	0	1	1	0
0	1	0	1	0
0	1	1	0	1
1	0	0	1	0
1	0	1	0	1
1	1	0	0	1
1	1	1	1	1

From the table:

The Sum is 1 when an odd number of inputs are 1.
The Carry is 1 when at least two inputs are 1.

Boolean Expressions

The outputs are given by:

Sum = A ⊕ B ⊕ Cin

Cout = AB + ACin + BCin

Where:

⊕ = XOR
+ = OR
· or adjacency = AND

These expressions are extremely important because they show how the full adder is implemented using logic gates.

3. Full Adder Realization Using Logic Gates

A full adder can be built using basic logic gates such as XOR, AND, and OR.
The standard implementation often uses two half adders and one OR gate.

Using Two Half Adders

A full adder can be constructed in two stages:

Stage 1:

Add A and B
Produce intermediate sum S1 and carry C1

Stage 2:

Add S1 and Cin
Produce final sum S and carry C2

Final carry:

Cout = C1 + C2

Diagram for full adder using two half adders

A -----> [Half Adder 1] ---- S1 -----> [Half Adder 2] ---- S
          |                               |
B -----> [Half Adder 1]                  Cin
          |
         C1

C1 ----\
        [OR] ---- Cout
C2 ----/

This design is very common because it is simple and clearly shows how a full adder can be derived from smaller blocks.

Gate-Level Expression

The circuit can also be directly implemented as:

X1 = A ⊕ B
S = X1 ⊕ Cin
Cout = (A · B) + (Cin · X1)

This form reduces the implementation complexity and is widely used in digital circuit design.

Working / Process

1. First, the two main input bits are combined.

The adder checks the binary values of A and B. This gives an intermediate result, which may include a carry if both bits are 1.

2. Next, the carry-in bit is added.

The intermediate sum is then combined with Cin, the carry from the previous stage. This gives the final sum for that bit position.

3. Finally, the carry-out is generated.

If the addition exceeds one binary digit, a carry is produced and passed to the next stage. This is how multiple full adders can be connected to add larger binary numbers.

Example of Working

Add:

A = 1
B = 1
Cin = 0

Calculation:

1 + 1 + 0 = 10

So:

Sum = 0
Cout = 1

Another example:

A = 1
B = 0
Cin = 1

Calculation:

1 + 0 + 1 = 10

So:

Sum = 0
Cout = 1

This demonstrates that the full adder always behaves exactly like binary addition.

Advantages / Applications

Essential for multi-bit binary addition

Full adders are used in cascaded form to add 2-bit, 4-bit, 8-bit, and larger binary numbers.

Core part of ALUs and processors

They are used in arithmetic logic units to perform addition and related arithmetic operations in CPUs and microprocessors.

Useful in digital systems and counters

Full adders are found in calculators, digital clocks, counters, address generation circuits, and many other combinational systems.

Summary

A full adder adds three 1-bit inputs and produces sum and carry.
It is built using logic gates and is a key combinational circuit.
The main outputs are given by Sum = A ⊕ B ⊕ Cin and Cout = AB + ACin + BCin.
Important terms to remember: full adder, sum, carry-in, carry-out, XOR, combinational logic