FULL ADDER

In a previous lesson, we saw how a half adder can be used to determine the sum and
carry of two input bits. What if we have three input bitsX, Y, and CI, where CI is a carry-
in that represents the carry-out from the previous less significant bit addition? In this
situation, we have what is known as a FULL ADDERa circuit that adds three one-bit
values. These values are the addends X an Y, and carry-in CI.
When three single-bit values are added, the two carry bits are ONexplaining the use of the
highest possible result would be 1 + 1 + 1 = 11, OR gate on the far upper right of the circuit
which is the binary representation of the diagram.
decimal number 3. The entire truth table for
the FULL ADDER would look like this: The FULL ADDER (FA for short) circuit can be
represented in a way that hides its inner-
CARRY CARRY workings:
SUM
X Y IN OUT
S
CI Co
0 0 0 0 0
0 0 1 0 1
0 1 0 0 1
0 1 1 1 0
1 0 0 0 1 The FULL ADDER can then be assembled into a
1 0 1 1 0 cascade of full adders to add two binary
1 1 0 1 0 numbers. For example the diagram below
1 1 1 1 1 shows how one could add two 4-bit binary
numbers X3X2X1X0 and Y3Y2Y1Y0 to obtain the
sum S3S2S1S0 with a final carry-out C4.
CoS taken together, represents the binary sum
X+Y+CI. For example, when CoS is 11
(corresponding to decimal 3), then X+Y+CI =
1+1+1.

One way to build a FULL ADDER is to use two

half adders as shown in this circuit diagram:

This circuit is commonly called a ripple-carry

The half adder on the left computes the sum
and carry for the addends X and Y. This sum and
the carry-in are then added by the half-adder on
the right, producing a final sum and a carry bit.
There is a CO carry out if either or both of the
adder since the carry bit ripples from one FA to
the next FA on its left. This rippling causes this
adder design to be somewhat slow when
compared to other more complex designs.
The initial carry-in can be hard-wired to zero,
making it unnecessary for a half adder on the far
right.
ACTIVITY 1: Construct a FULL ADDER
The above picture shows one way to construct a
FULL ADDER from two half adders. The half
adder on the left is essentially the half adder
from the lesson on half adders. So if you still
have that constructed, you can begin from that
point. Inputs and outputs have been labeled in
the picture to correspond to the FULL ADDER as
discussed on the previous page.
Once you have completed the construction of
the FULL ADDER, you should test it out to make
sure that it agrees with the truth table. With X,
Y, and CI all OFF, both outputs should be OFF. If
any single input X, Y, or CI is ON, then S should
be ON and CO should be off. If any pair of the
three inputs is ON, then the output CO only
should be ON. If all three inputs are ON, then
both outputs should be ON.
ACTIVITY 2: Construct a Ripple-Carry Adder
If you are in a classroom setting, and each lab
group of students has constructed a FULL
ADDER, you might find it interesting and fun to
connect your FULL ADDER creations into a single
n-bit ripple-carry adder and then test it out by
adding two n-bit binary numbers. (n is the
number of FULL ADDERS that your class has
connected together.)
YOU NEED:
1 power
1 fork
3 buttons
3 LEDs (to display input values)
4 split
2 AND
2 XOR
2 RGB LEDs (to display output values)
1 OR
3 wires (more wires may be needed if your class
constructs a ripple-carry adder)