Scribd
Upload
41 views

DLD Lab Report 5

This document discusses implementing and comparing sum of product (SOP) and product of sum (POS) logic. It defines SOP and POS, describes how to write their expressions from truth tables using minterms and maxterms. It provides example truth tables and asks to derive the SOP and POS expressions, simplify using K-maps, and implement the circuits in hardware and simulation.

Uploaded by

UMAIR Khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
41 views

DLD Lab Report 5

This document discusses implementing and comparing sum of product (SOP) and product of sum (POS) logic. It defines SOP and POS, describes how to write their expressions from truth tables using minterms and maxterms. It provides example truth tables and asks to derive the SOP and POS expressions, simplify using K-maps, and implement the circuits in hardware and simulation.

Uploaded by

UMAIR Khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Name : MUNEEZA RAUF

Roll ID: 221727


Class: BEMTS 3-A
Lab No. 5
Implementation of Sum of Product and Product of Sum
Objectives:
1. Implementing and comparing the results of POS and SOP.
2. Understanding the use of K-map for simplification of Boolean expressions.

Equipment:
1. Digital logic Trainer.
2. Connecting wires.
3. Power Supply.
4. 14 Pin ICs (AND, OR, NOT).

Introduction:
The different forms of canonical expression which includes the sum of products (SOP) and products of
the sum (POS), The canonical expression can be defined as a Boolean expression which has either min
term otherwise max term. For example, if we have two variables namely X & Y then the canonical
expression comprising of min terms will be XY+X’Y’, whereas the canonical expression comprising
of max terms will be (X+Y) (X’+Y’).
Sum of Products and Product of Sums
The concept of the sum of products (SOP) mainly includes minterm, types of SOP, K-map, and
schematic design of SOP. Similarly, the product of sums (POS) mainly includes the max term, types of
product of sums, k-map and schematic design of POS.
What is a Sum of Product (SOP)?
The short form of the sum of the product is SOP, and it is one kind of Boolean algebra expression. In
this, the different product inputs are being added together. The product of inputs is Boolean logical AND
whereas the sum or addition is Boolean logical OR. Before going to understand the concept of the sum
of products, we have to know the concept of minterm.
The min term can be defined as, when the minimum combinations of inputs are high then the output
will be high. The best example of this is AND gate, so we can say that min terms are combinations of
AND gate inputs. The truth table of the min term is shown below. F = A’B’C’ + A’B’C

What is a Product of Sum (POS)?


The short form of the product of the sum is POS, and it is one kind of Boolean algebra expression. In
this, it is a form in which products of the dissimilar sum of inputs are taken, which are not arithmetic
result & sum although they are logical Boolean AND & OR correspondingly. Before going to understand
the concept of the product of the sum, we have to know the concept of the max term.
The maxterm can be defined as a term that is true for the highest number of input combinations otherwise
that is false for single input combinations. Because OR gate also provides false for just one input
combination. Thus, Max term is OR of any complemented otherwise non-complemented inputs. F =
(X+Y+Z) (X+Y’+Z)
Activitie1:
X Y Z F

0 0 0 0

0 0 1 1

0 1 0 1

0 1 1 1

1 0 0 0

1 0 1 1

1 1 0 0

1 1 1 0

1. Write the minterm (SOP) expression of the above truth table also express its canonical,
noncanonical and minimal expression forms using k-map method.
2. Implement all three types on hardware and simulate them on Porteous.

Activitie2:

X Y Z F
0 0 0 0

0 0 1 1

0 1 0 1

0 1 1 1

1 0 0 0

1 0 1 1

1 1 0 0

1 1 1 0

1. Write the maxterm (POS) expression of the above truth table also express its canonical,
noncanonical and minimal expression forms using k-map method.
2. Implement all three types on hardware and simulate them on Porteous.

HARDWARE
PROTEUS
CONCLUSION

In this lab we learned we learned to find the equation using truth table. Optimized the equation and
implemented on trainer. We checked the output using truth table. Also implemented the circuit on proteus for
further verifications

You might also like