Scribd
Upload
23 views12 pages

Lab 4

The lab report discusses the representation of Boolean functions in Canonical Disjunctive Normal Form (SOP) and Canonical Conjunctive Normal Form (POS). It includes tasks that involve deriving Boolean expressions, constructing truth tables, and designing logic circuits for specific functions. The report concludes with an analysis of the implemented designs, confirming their correctness and efficiency through algebraic simplifications.

Uploaded by

Jawad Ahmed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
23 views12 pages

Lab 4

The lab report discusses the representation of Boolean functions in Canonical Disjunctive Normal Form (SOP) and Canonical Conjunctive Normal Form (POS). It includes tasks that involve deriving Boolean expressions, constructing truth tables, and designing logic circuits for specific functions. The report concludes with an analysis of the implemented designs, confirming their correctness and efficiency through algebraic simplifications.

Uploaded by

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

Lab Report 4

Jawad Ahmed

Sir Usama Shaukat


—
Logic & Sequential
Circuit Design
—
23th February, 2025
—

Syndicate A

—
533047
CANONICAL SOP/POS FORM AND LOGIC DESIGNING

Canonical Forms in Boolean Algebra

In Boolean algebra, a Boolean function can be represented in two canonical forms: the Canonical Disjunctive
Normal Form (Minterm) and the Canonical Conjunctive Normal Form (Maxterm). A minterm is a term
that includes all Boolean variables in either their true or complemented form and produces an output of 1 for a
specific combination of input values. Conversely, a maxterm is a term that results in an output of 0 for a
particular input combination.

Boolean functions can be expressed using the Sum of Minterms (SOP), also known as the Sum of Products,
or the Product of Maxterms (POS), also referred to as the Product of Sums. When a Boolean function is
represented as a sum of minterms or a product of maxterms, it is considered to be in its canonical form. These
standard representations are essential for simplifying and analyzing digital logic circuits.

Sum of Products (SOP)

One method of expressing a Boolean function is through the Sum of Products (SOP) form. As the name
implies, this form is obtained by performing an OR operation on multiple product terms. These product terms,
known as minterms, are represented using the notation 'm'. Each minterm is formed by applying an AND
operation to Boolean variables, where each variable appears in either its normal or complemented form. This
representation is widely used in digital logic design to simplify and analyze Boolean functions.

Product of Sum (POS):


As the name implies, the Product of Sums (POS) form is created by applying an AND
operation to multiple sum terms. These sum terms, known as maxterms, are
represented using the notation 'M'. Each maxterm is formed by performing an OR
operation on Boolean variables, where each variable appears in either its normal or
complemented form. This representation is essential in digital logic design for expressing
and simplifying Boolean functions.

JAWAD AHMED
Task No 1:
Write the Boolean expression of the following functions. Simplify the
expression using algebraic manipulation and draw the logic diagram. Derive the
expressions in BOTH Sum-of-Product (SOP) and Product-of-Sum (POS) forms. Show
proper wiring in prototyping your circuit. Mention the number of literals and gates
needed for implementing the functions in hardware.

F(A,B,C) = ∑𝒎(𝟎,𝟐,𝟑,𝟔,𝟕)

SOLUTION:

The SOP form is obtained by writing minterms where F(A,B,C)=1F(A,B,C) = 1F(A,B,C)=1:

F(A,B,C)=m0+m2+m3+m6+m7

Expanding minterms:

(A,B,C)=(A’⋅B’⋅C’)+(A’⋅B⋅C’)+(A’⋅B⋅C)+(A⋅B⋅C’)+(A⋅B⋅C)

Simplified SOP Expression:

F(A,B,C)=A’⋅C’+A’⋅B+A⋅B

Truth Table

A | B | C | F(A,B,C)
----------------------
0|0|0|1
0|0|1|0
0|1|0|1
0|1|1|1
1|0|0|0
1|0|1|0
1|1|0|1
1|1|1|1

JAWAD AHMED
SOP 000

SOP 010

JAWAD AHMED
SOP 100

SOP 111

JAWAD AHMED
POS 000

POS 001

JAWAD AHMED
POS 101

JAWAD AHMED
POS 111

TASK No 2:

A laboratory used for preparation of thin films of electronic materials, emits UV


radiation, which can cause severe skin burns, to protect incoming people from these
radiations; 3 switch system needs to be implemented with a switch S1 on the door of the
Lab, a switch S2 on the plastic cover protecting laser beam path, and an over-ride S3
switch for all these interlocks which a maintenance technician might make use of. To fire
the beam in normal use, we want door and plastic cover to be closed and over-ride
switch to be ON. This is an Active-LOW system. Make Logic Circuit for this situation and
implement that on hardware.

SOP Implementation:

JAWAD AHMED
Expression:

Y = (S1’⋅S2’)S3

POS Implementation:
Expression:

Y=(S1+S2+S3’)

Truth Table
S1 S2 S3 F
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 1

001

JAWAD AHMED
011

101

JAWAD AHMED
111

JAWAD AHMED
Conclusion
In this lab, we analyzed and implemented a Boolean function using both
Sum of Products (SOP) and Product of Sums (POS) forms. We derived
the Boolean expressions, constructed the corresponding truth table, and
designed the logic circuit diagrams. Through algebraic simplifications, we
reduced the number of gates required for hardware implementation,
optimizing the circuit's efficiency. The results were verified using the truth
table, confirming the correctness of our design. This experiment provided
practical insight into Boolean algebra, logic gate minimization, and digital
circuit prototyping.

JAWAD AHMED

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy