Middle Technical University Digital Electronic Lab.

Electrical Engineering Technical College First Stage

Electrical Power Technical Engineering Dept. Mohammed D. Altamemi

Experiment-4
Standard form of Logic Function
Sum of Product (SOP) and Product of Sum (POS)

4-1 Object:
Implementation of the given Boolean function using logic gates in both SOP
and POS forms.

4-2 Theory:
Canonical Forms (Normal Forms): Any Boolean function can be written in
disjunctive normal form (sum of min-terms) or conjunctive normal form (product of
max-terms). A Boolean function can be represented from a truth table in which each
state "1" corresponds to a minterm for SOP. While each state "0" in truth table can
represented a maxterm for POS

4-3 Procedures:
1. For the table (4-1) below, the SOP and POS standard form are written in
equation (1) and equation (2) respectively.
Table (4-1) Truth Table
A B C D Y
0 0 0 0 0
0 0 0 1 0
0 0 1 0 1
0 0 1 1 0
0 1 0 0 0
0 1 0 1 0
0 1 1 0 1
0 1 1 1 0
1 0 0 0 1
1 0 0 1 1
1 0 1 0 1
1 0 1 1 1
1 1 0 0 0
1 1 0 1 0
1 1 1 0 1
1 1 1 1 0

MD
Middle Technical University Digital Electronic Lab.
Electrical Engineering Technical College First Stage
Electrical Power Technical Engineering Dept. Mohammed D. Altamemi

2. Connect the logical circuit for equation (1) as shown in figure (4-1)

Figure (4-1) AND / OR Logic Circuit for equation (1)

3. Find the truth table of the logic circuit in figure (4-1).

4-4 Discussions:
1. Compare between truth table in step 3 of procedure and table (4-1), comment
on results.
2. Find the POS of logic function below

3. Find the SOP and POS of logic function below

4. Find the truth table of logic function in step 3 of discussion.

MD