Lab Report

Writing and Verification of SOP & POS expressions from Trurh Table

Hammad Aslam Hammad Hassan BSME 2011-15; G-1 Submitted to: Sir Javaid Khurshid

Pakistan Institute of Engineering and Applied Sciences, Nilore Islamabad

Abstarct
In this lab experiment, it is required to find the Sum of Product (SOP) and Product to Sum (POS) form of the given truth table. After finding the expressions they are verified by designing them on working kit.

Introduction
Boolean algebra is the algebra that deals with binary variables and logic operations. The particular expression used to represent the function will dictate the interconnection of gates in logic circuit diagram. Logic gates are electronic circuits that operate on one or more input signals to produce an output signal.. Voltage operated logic circuits such as ICs respond to two separate voltage levels that represent a binary variable equal to binary logic 1 and 0. A Boolean function can also be expressed as a sum of minterms. The minterms whose sum defines the Boolean function are those which give the 1s of the function in a truth table. The sum of products is a Boolean expression containing AND terms called products terms. Boolean functions expressed as a sum of minterms or product of maxterms are said to be in canonical form.

Procedure
The apparatus is again the same as that of last two or three experiments, the training kit along with a set of different ICs of different codes or standards, multi-meter to measure high and low voltages and connecting wires to connect the circuit. The DC 5V is to be given at the input. We are required to design circuits that can prove certain given statements.

1|Page

Observations
Truth Table
x 0 0 1 1 y 0 1 0 1 F 1 1 0 0

The minterms of the truth table are x*y and x*y. The SOP form will be as such; F = x * y + x * y For designing this function on the training kit, we must have to go for that ICs that are incorporated with and, not and or gates that are 7408, 7404 and 7432. The circuit diagram will be as such;

The expression given above is SOP form of the given function.

2|Page

Now by converting above function into POS form just by taking complements. The final shape of relation is as such; F = (x + y) * (x + y) The circuit diagram for this form is as such;

This is logic circuit for POS form of that expression.

3|Page