SOP and POS Expressions (ECE)

I.
OBJECTIVES
1. To identify SOP and POS expressions
2. To make an expression/function based on the logic circuits
3. To construct a truth table
4. To apply Boolean Algebra in simplifying functions
5. To define Karnaugh-Map
6. To apply Karnaugh-Mapping in simplifying functions
7. To design logic circuits based on the simplified functions
II. MATERIALS/DEVICES/SOFTWARE
- Tinkercad
- Proteus - ISIS
III. PROCEDURE
1. Open ISIS
2. Draw and simulate the logic circuit below using Proteus-ISIS.
3. Complete the truth table.

Input Output
X Y Z F
0 0 0 1
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 1
4. Based on the given logic circuit above, determine the output function of the logic circuit.
Show your solutions.
5. Draw and simulate the logic circuit below using Proteus-ISIS.

Input Output
A B C F
0 0 0 0
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 1
7. Based on the above logic circuit, what is the output function of the logic circuit? Show your
solutions.
8. Is the output a POS or SOP function?
The output above is the sum of product.
9. Given the Boolean function: F = xy’z + x’y’z + w’xy + wx’y + wxy. Simplify the function to
a minimum number of literals using Boolean Algebra or Karnaugh Mapping. Show your
solutions.
10. Design a logic circuit using basic gates only (NOT, AND & OR Gate).
11. Make a simulation based on the design logic circuit using “tinkercad”.
Input Output
w x y z F
0 0 0 0 0
0 0 0 1 1
0 0 1 0 0
0 0 1 1 0
0 1 0 0 0
0 1 0 1 1
0 1 1 0 1
0 1 1 1 1
1 0 0 0 0
1 0 0 1 1
1 0 1 0 1
1 0 1 1 1
1 1 0 0 0
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1
13. Based on the simplified function in procedure 9, design a logic circuit using NOR gates
only.
14. Make a simulation based on the design logic circuit (based in procedure 12) using
“tinkercad”.

Input Output
w x y z F
0 0 0 0 0
0 0 0 1 1
0 0 1 0 0
0 0 1 1 0
0 1 0 0 0
0 1 0 1 1
0 1 1 0 1
0 1 1 1 1
1 0 0 0 0
1 0 0 1 1
1 0 1 0 1
1 0 1 1 1
1 1 0 0 0
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1
IV. EVALUATION
1. Define SOP and POS.
Sum of product is SOP, and it is one kind of Boolean algebra expression in which the different
product inputs are being added together. This product is not arithmetical multiply but it is
Boolean logical AND and the Sum is Boolean logical OR.
POS also known as Product of Sum is a form in which products of different sum terms of inputs
are taken. POS expression comes from the fact that two or more sums (OR’s) are added
(AND’ed) together
2. Design a logic circuit using XOR gate only that can act as a NOT gate.
3. Simplify the following Boolean expressions to a minimum number of literals:

(i). ABC + A’B + ABC’
(ii). xy + x(wz + wz’)
4. Given the following Boolean functions:

(i).
b. Truth table.
Input Output
w x y z F
0 0 0 0 1
0 0 0 1 0
0 0 1 0 1
0 0 1 1 0
0 1 0 0 1
0 1 0 1 1
0 1 1 0 1
0 1 1 1 1
1 0 0 0 1
1 0 0 1 0
1 0 1 0 1
1 0 1 1 0
1 1 0 0 0
1 1 0 1 1
1 1 1 0 0
1 1 1 1 1
c.) Logic Circuit
a.) Determine the simplified function

b.) Construct a complete truth table
Input Output
A B C D F
0 0 0 0 T
0 0 0 1 F
0 0 1 0 T
0 0 1 1 F
0 1 0 0 T
0 1 0 1 F
0 1 1 0 T
0 1 1 1 F
1 0 0 0 T
1 0 0 1 T
1 0 1 0 T
1 0 1 1 T
1 1 0 0 T
1 1 0 1 F
1 1 1 0 T
1 1 1 1 F
c.) Design a logic circuit using basic gates and NAND gates only.
V. CONCLUSION
SOP (Sum of Product) and POS (Product of Sum) are the methods for deducing a particular
logic function. SOP and POS expressions are canonical expression which can be defined as
a Boolean expression which has either min term otherwise max term. In SOP, the different
product inputs are being added together hence it is Boolean logical AND and the Sum is Boolean
logical OR.While POS expression comes from the fact that two or more sums (OR’s) are added
(AND’ed) together. The table used to represent the boolean expression of a logic gate function is
called Truth Table. The truth table shows a logic circuit's output response to all of the input
combinations.
Boolena algebra is used to simplify Boolean expressions which represent combinational logic
circuits. It reduces the original expression to an equivalent expression that has fewer terms which
means that there are less logic gates are needed to implement the combinational logic circuit.
Karnaugh mapping is another way to simplify logic functions. We can minimize Boolean
expressions variables easily using K-map without using any Boolean algebra theorems. It is a
systematic method with a table like presentation to simplify logic expressions.
Therefore, I conclude that a Boolean expression can be simplified through using one of the
methods. This leads to more efficient cost and less power consumption as the gates are being
simplified.

SOP and POS Expressions (ECE)

Uploaded by

Copyright:

Available Formats

SOP and POS Expressions (ECE)

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

SOP and POS Expressions (ECE)

Uploaded by

Copyright:

Available Formats

I.

3. Complete the truth table.

5. Draw and simulate the logic circuit below using Proteus-ISIS.

8. Is the output a POS or SOP function?

The output above is the sum of product.

15. Complete the truth table.

3. Simplify the following Boolean expressions to a minimum number of literals:

4. Given the following Boolean functions:

a.) Determine the simplified function

You might also like