Tim Penyusun Modul

Michael Harditya
Yehezkiel Jonatan
Fulky Hariz Z.

Program Studi S1 Teknik Komputer

Theory
In digital arithmetics, basic operations like addition, subtraction, multiplication,
and division are based on binary. In digital circuits, these basic arithmetic operations are
accomplished by using a digital circuit called adder and subtractor.
1. Half Adder and Full Adder
In digital arithmetics, adder is used to perform addition between 2 bits binary
number, if we see the figure below, the half adder is used to perform addition
between bit A and bit B, the result of this operation is S (sum) and C (carry).

Figure 1-1 Half-Adder

The truth table for half adder:

Inputs Outputs

A B S C

0 0 0 0
 0 1 1 0

1 0 1 0

1 1 0 1

Using the truth table we can design the half adder using the Karnaugh map that
we already learned back in module 3, if we take a look into the output S its output
follows the same logic as the XOR gate and the output S follow the same logic as
the AND gate. In half adder we only consider 2 inputs A and B, we don’t consider
any additional input.

Figure 1-2 Full Adder

Inputs Outputs

A B Cin S 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

Full adder is another form of an adder that considers another input besides A and
B, that is Cin. Cin is used as an input that comes from Cout of another full adder. By
using a full adder we can create a Ripple Carry Adder that consists of n full
adder, the n value depending on how many bits the Ripple Carry Adder can
handle. Ripple Carry Adder is created by connecting Cout from the less significant
bit to Cin from the more significant bit.

Figure 1-3 Ripple Carry Adder

2. Half Subtractor
Subtractor is used to perform binary subtraction between 2 bits in a digital
arithmetic circuit. According to Figure 2-1, a half subtractor is used to perform a
subtraction between bit A and bit B, the result of this operation is D (difference)
and B (borrow).
 Figure 2-1 half subtractor

The truth table for half subtractor:

Inputs Outputs

A B D Bo

0 0 0 0

0 1 1 1

1 0 1 0

1 1 0 0

If we look at the truth table we can see the output D follows the same logic as the
AND gate and Borrow follows the logic A’ . B. Same as half adder in half
subtractor we don’t consider another input besides A and B.
 Figure 2-2 Full Subtractor

The truth table for full adder:

Inputs Outputs

A B Bin S Bout

0 0 0 0 0

0 0 1 1 1

0 1 0 1 1

0 1 1 0 1

1 0 0 1 0

1 0 1 0 0

1 1 0 0 0

1 1 1 1 1

Same as a full adder, a full subtractor is another form of subtractor that has
additional input, that is Bout (Borrow In) that comes from Bout of another full
subtractor. By using a full subtractor we can create a Ripple Borrow Subtractor
that consists of n full subtractor, the n value depending on how many bits the
Ripple Borrow Subtractor can handle. Ripple Borrow Subtractor is created by
connecting Bout from the less significant bit to Bin from the more significant bit.

Figure 2-3 Ripple Borrow Subtractor

B. Tools
Tools Amount
IC 7402 (NOT Gate) 2 (6)
IC 7408 (AND Gate) 3 (12)
IC 7432 (OR Gate) 2 (6)
IC 7486 (XOR Gate) 3 (12)
VCC and GND depends
Cable/Jumper depends
LED 6

C. Steps
1) Create 3 Bit Full Adder using logic gates.
2) Connect Cout from less significant bit to Cin from more significant bit to
create a ripple carry adder.
3) Perform addition using the ripple carry adder and record the output.
4) Repeat steps 1 to 3 using a Full subtractor to create a ripple borrow
subtractor.