Scribd
Upload
84 views

DLD Lab02

The document is a lab report for a digital logic design course. It describes an experiment to design circuits for Boolean functions expressed in canonical forms, specifically sum of minterms and product of maxterms. It defines these canonical forms and how to derive them from truth tables. The lab report discusses implementing circuits for sample minterm and maxterm functions on a breadboard and verifying their truth tables match the theoretical expressions. De Morgan's laws are also explained and how they can be used to convert between the canonical forms.

Uploaded by

linehelp195
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
84 views

DLD Lab02

The document is a lab report for a digital logic design course. It describes an experiment to design circuits for Boolean functions expressed in canonical forms, specifically sum of minterms and product of maxterms. It defines these canonical forms and how to derive them from truth tables. The lab report discusses implementing circuits for sample minterm and maxterm functions on a breadboard and verifying their truth tables match the theoretical expressions. De Morgan's laws are also explained and how they can be used to convert between the canonical forms.

Uploaded by

linehelp195
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

Green University of Bangladesh

Department of Computer Science and Engineering (CSE)


Faculty of Sciences and Engineering
Semester: (Spring, Year:2021), B.Sc. in CSE (Day)

LAB REPORT NO: 02

Course Title: Digital Logic Design Lab


Course Code: CSE 204
Section: DC

Lab Experiment Name: Design a Circuit for the Given Canonical Form, Draw the
Circuit Diagram and Verify the De-Morgan’s Laws

Student Details

Name ID
1. Ismail Hossain 203002013

Lab Date : 25th October, 2021


Submission Date : 2nd November, 2021
Course Teacher’s Name : Mr. Mozdaher Abdul Quader
1. OBJECTIVES
• To attain knowledge on Boolean expression.
• To implement Boolean expression using integrated circuits (IC’s) and verify the truth table.
•To implement De-Morgan’s Law and verify the truth table

2. PROCEDURE/ANALYSYS/DESIGN:
1. Construct the circuit on breadboard for each Gate as shown in figures 1 and 2 by inserting
the appropriate IC.
2. Check the combinations of various inputs as shown in truth tables for each Gate.
3. If the input is low connect input to Ground, which indicates logic 0.
4. If input is high or logic 1 then connect the input to the power supply.
5. When output is high the LED will glow which indicates output as high, if the LED is not
glowing then the output is low.

3. Problem Analysis:

Boolean functions are commonly expressed using the following forms:

1. Canonical forms:
• Sum of minterms
• Product of maxterms

2. Standard forms:
• Sum of products (SOP)
• Product of sums (POS)

In this experiment, we will learn how to express a boolean function using the canonical form e.g.
sum of minterm or product of maxterm. Before we understand what sum of minterm or product
of maxterm is, we must understand a few terminology.
Sum of Minterm
To obtain the Sum of Minterm, we need to find those literals in the Truth Table that gives a 1 as
output process. Suppose we have 2 variables x and y, then all possible combination of literals are
xy xy, xy, and xy. If we have 3 variables then all combination of literals are as follows.
Basically, if there are n variables, then there is 2n literals. For 3 variable, there are 23 = 8.
A minterm is the term from table 1 that gives 1 output. Let us sum all these terms,
F= x y z + x y z + x y z + x y z + x y z
= m1 + m4 + m5 + m6 + m7
F (x, y, z) =∑ m (1, 4, 5, 6, 7) is known as sum of minterms canonical form.
x y z F MINTERM
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 1

TABLE 01: MINTERM TRUTH TABLE


PRODUCT OF MAXTERM

The Product of Maxterm is complement of the Sum of Minterm of a function. To


obtain the Product of Maxterm, we need two step process.
1. Find those minterms in the Truth Table that gives a 0 as output.
2. Complement those minterms using DeMorgan’s law.

Let us now apply the above to obtain the Product of Maxterm form. rom the
previous truth table given x y z x y z and x y z gives output as 0.

’ (x y z x yz x y z) by De-Morgan’s Law

(x y z).(x y’ z).(x y’ z’) Product of Maxterms form


4. IMPLEMENTATION:

Input/ output MINTERM:

Fig: Circuit diagram of Minterm

Input/ output MAXTERM:

Fig: Circuit diagram of Maxterm


5. DISCUSSION:

These two laws are of utmost importance in various branches of


mathematics and engineering. We have seen how they can be applied in
mathematics. Similarly, they are applied both in computer and electrical
engineering.These laws can also be applied in text searching by using AND,
OR and NOT, collectively known as Boolean Operators.Think of a set
containing the words cats and dogs. According to De Morgan’s Laws:

NOT (cats OR dogs)


(NOT cats) AND (NOT dog)

You might also like