Middle Technical University Digital Electronic Lab.

Electrical Engineering Technical College First Stage

Electrical Power Technical Engineering Dept. Mohammed D. Altamemi

Experiment- 3
Boolean Algebra & de Morgan's law
3-1 Object:

To use the Boolean algebra in simplification of logical function, and use as

minimum as possible of logic gate.
3-2 Theory:

The digital circuits are based on only three fundamental logical operations.

1. Logical Sum: The first one is logic sum, its math expression in Boolean algebra is:
A+B
A and B are binary variables and can only take the value of 1 or 0. The gate that perform
this operation is the OR. It is important to remember that the logical sum and arithmetic
sum are not the same.
2. Logical Product: And the second one is logical product, its logical expression is:
A.B
The gate that perform this operation is AND.
3. Complementation: This operation is applied only to one variable. Complementation
is also often called inversion and negation. The gate that performs this operation is
NOT.

3-2-1 Boolean Algebra:

Boolean algebra is a set of two elements and two operations, the elements are the
two possible values that a digital variable can have [0, and 1]. And the operations are the
logical sum and the logical multiplication.
Middle Technical University Digital Electronic Lab.
Electrical Engineering Technical College First Stage
Electrical Power Technical Engineering Dept. Mohammed D. Altamemi
3-2-2 de Morgan's law:

Law No. 1

Law No. 2

3-2-3 Logical function simplification:

A logical function is often apparently complex but it can be simplified. In fact, one
of the reasons for making a simplification is to use the smallest possible number of gates
in an electronic design. The rules that are used are those that have been previously seen.
Consider the following Boolean function:

F2= xyz + xyz + xy

This function with logic gates is shown in Fig. 3-1(a)

Figure (2-1) logic circuit and truth table for F2

The function is equal to 1, when xyz = 001, 011, 100, and 101. Simplify the following
Boolean function:

F2 = xyz + xyz + xy

= xz (y + y) + xy

= xz + xy

In 3-2 (b), would be preferable because it requires less wires and components.
Middle Technical University Digital Electronic Lab.
Electrical Engineering Technical College First Stage
Electrical Power Technical Engineering Dept. Mohammed D. Altamemi

Figure (3-2) equation of F2 after simplification

3-3 Procedures:
1. For the logic expression below the draw of logic circuit and truth table are in
figure (3-3) and table (3-1) approximately:

F3 = XY+ X'Z + YZ

Table (3-1) F3 before simplification

X Y Z F3
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1
Figure (3-3) F3 before simplification

2. Simplified the logic equation F3 by Boolean algebra and draw its logic circuit
after simplification.
Middle Technical University Digital Electronic Lab.
Electrical Engineering Technical College First Stage
Electrical Power Technical Engineering Dept. Mohammed D. Altamemi
3. Connect the simplified logic circuit of F3 by using TTL logic gates and Multisim
simulation software.
4. Find the truth table of simplified logic circuit of F3, fill in table 3-2 below:
Table (3-2) F3 after simplification
X Y Z F3
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1

3-4 Discussion:
1. comment on your results

2. compare between table (3-1) and (3-2)

3. For following logic expression draw the logic circuit and find truth table. And By
using Boolean algebra and de Morgan theorem, simplified them and find its truth
table and logic circuit, and then compare them

a) F1 = XYZ + XYZ

b) F2 = (XY)' +(X'Y'Z')'+ (X'+Z)'