Laboratory Hand Book
Experiment No. 5
CONVERSION VERIFICATION / IMPLEMENTATION OF
STANDARD FORMS OF BOOLEAN EXPRESSIONS (SOP to
POS & POS to SOP).
OBJECTIVE
Construction of the circuit according to the expression / equation by using Logic Gates.
Verifying their results of both circuits.
EQUIPMENT
ePAL Trainer Board
Connecting wires
COMPONENTs
IC Type 7408 Quadruple 2-input AND gates
IC Type 7432 Quadruple 2-input OR gates
IC Type 7404 Inverters gates
THEORY
STANDARD FORM OF BOOLEAN EXPRESSIONS;
All Boolean expressions, regardless of their form, can be converted into either of two standard
forms: the Sum-Of-Products (SOP) form or the Product-Of Sums (POS) form. Standardization
makes the evaluation, simplification, and implementation of Boolean expressions much more
systematic and easier.
Converting Standard SOP to Standard POS;
Step 1:
Evaluate each product term in the SOP expression. That is, determine the binary
numbers that represent the product terms.
Step 2:
Determine all of the binary numbers not included in the evaluation in Step 1.
Step 3:
Write the equivalent sum term for each binary number from Step 2 and express
in POS form.
Digital Logic Design 1
Laboratory Hand Book
EXAMPLE:
Convert the SOP expression to an equivalent POS expression:
(𝑨 𝑩 𝑪 + 𝑨𝑩𝑪 + 𝑨𝑩𝑪 + 𝑨𝑩𝑪 + 𝑨𝑩𝑪)
The Evaluate is as follows:
000+ 010+011+101+111
Three variables in domain, so there are 8 possible combinations.
SOP expression contains five of these combinations, So the POS
expression must contain the other three which are 001,100,and 110
So write the POD of missing combination.
(𝑨 + 𝑩 + 𝑪)(𝑨 + 𝐵 + 𝐶)(𝑨 + 𝑩 + 𝐶)
Construct the circuit for both SOP and Equivalent POS and verify result
Converting Standard POS to Standard SOP;
Step 1: Evaluate each ORing/SUM term in the POS expression. That is,
determine the binary numbers that represent the ORing/SUM terms.
Step 2: Determine all of the binary numbers not included in the evaluation
in Step 1.
Step 3: Write the equivalent product term for each binary number from
Step 2 and express in SOP form.
Convert the POS Expression to an equivalent SOP expression.
(𝑨 + 𝑩)(𝑨 + 𝑩)
Evaluation as follows
01, 00
Two variables in domain, so there are 4 possible combinations.
POS expression contains two of them, So the SOP expression must
contain the other two which are 10,11
So write the SOP of missing combination.
(𝑨𝑩)+(𝑨𝑩)
Construct the circuit for both POS and Equivalent SOP and verify result
Converting SOP Expressions to Truth Table Format
All standard Boolean expression can be easily converted into truth table format using
binary values for each term in the expression.
An SOP expression is equal to 1 only if at least one of the product term is
equal to 1.
Digital Logic Design 2
Laboratory Hand Book
Constructing a truth table:
Step 1: List all possible combinations of binary values of the variables
in the expression.
Step 2: Convert the SOP expression to standard form if it is not already.
Step 3: Place a 1 in the output column (X) for each binary value that
makes the standard SOP expression a 1 and place 0 for all the
remaining binary values.
EXAMPLE;
Converting POS Expressions to Truth Table Format
A POS expression is equal to 0 only if at least one of the product term is
equal to 0.
Constructing a truth table:
Step 1: List all possible combinations of binary values of the `
variables in the expression.
Step 2: Convert the POS expression to standard form if it is not
already.
Digital Logic Design 3
Laboratory Hand Book
Step 3: Place a 0 in the output column (X) for each binary value that
makes the standard POS expression a 0 and place 1 for all the
remaining binary values.
EXAMPLE:
Digital Logic Design 4
Laboratory Hand Book
PROCEDURE
1. Make the connections as per the Boolean expression.
2. Switch on Vcc and apply various combinations of input according to the combination
for each circuit.
3. Verify the output of the complete circuit..
RESULTS & CALCULATIONS
-------------------------------------------------------------------------------------------
-------------------------------------------------------------------------------------------
--------------------------------------------------------------------------------------------
-------------------------------------------------------------------------------------------
-------------------------------------------------------------------------------------------
-------------------------------------------------------------------------------------------
--------------------------------------------------------------------------------------------
-------------------------------------------------------------------------------------------
-------------------------------------------------------------------------------------------
--------------------------------------------------------------------------------------------
Digital Logic Design 5
