Scribd
Upload
5 views

Experiment No 7

Uploaded by

alishabutt23355
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
5 views

Experiment No 7

Uploaded by

alishabutt23355
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/ 8

Gift University Gujranwala Computer Science

GIFT UNIVERSITY GUJRANWALA

LAB MANUAL
DIGITAL LOGIC DESIGN
DEPARTMENT OF COMPUTER SCIENCE

Digital Logic Design Page 1


Gift University Gujranwala Computer Science

BOOLEAN EXPRESSION SIMPLIFICATION


USING KARNAUGH MAPS

EXPERIMENT NO. 07

Name Roll No
1.
2.
3.
4.

Report Marks (05) Lab Performance (10)

Digital Logic Design Page 2


Gift University Gujranwala Computer Science

EXPERIMENT NO. 07
Boolean Expression Simplification Using Karnaugh Maps
Objective:
 Understanding K-maps
 Simplifying functions given as tasks and implementing the simplified circuit on logisim.

Background:
K-Maps is a clever way to represent a truth-table. It represents the truth-table in such a visual manner to
help identifying manipulations of the following nature:

 An intuitive visual way to simplify logical expressions involving 2, 3, 4, 5, and 6 variables


 The minimization process gives insight to the working of CAD tools.
 We will begin by introducing K-maps of 2 variables, and continue with K-maps of higher
complexity.

THUMB RULES for


SOLVING K- MAPS

Steps to solve expression using K-map-


1. Select K-map according to the number of variables.
2. Identify minterms or maxterms as given in problem.
3. For SOP put 1’s in blocks of K-map respective to the minterms (0’s elsewhere).
4. For POS put 0’s in blocks of K-map respective to the maxterms(1’s elsewhere).
5. Make rectangular groups containing total terms in power of two like 2,4,8 ..(except 1) and try to
cover as many elements as you can in one group.

Digital Logic Design Page 3


Gift University Gujranwala Computer Science

6. From the groups made in step 5 find the product terms and sum them up for SOP form.

Digital Logic Design Page 4


Gift University Gujranwala Computer Science

Lab Tasks:

Find the minimum-cost implementation for the function

F=x1’x2’x3’x4’ + x1x2x3x4 + x1’x2’x3x4 + x1x2x3’x4

Draw the truth table for above function (3 mark)

Show K-map simplification below and draw the simplified expression circuit on logisim.

(2 Marks)

Digital Logic Design Page 5


Gift University Gujranwala Computer Science

Task 2:

Given is a function below. Reduce it with K-map and show your calculations below. (3 Marks)

F (A,B,C) = ∑ ( m0, m1, m2, m4, m5, m6 )

Construct the circuit on hardware and attached the result below. (2 Marks)

Digital Logic Design Page 6


Gift University Gujranwala Computer Science

Observations: (2 Marks)

___________________________________________________________________________________
___________________________________________________________________________________
___________________________________________________________________________________
___________________________________________________________________________________

Review Questions
1. Solve the function below using K-maps and draw the simplified circuit diagram on logisim.
(1.5 Marks)

F (A,B,C,D) = ∑( m0, m1, m2, m4, m5, m6, m8, m9, m12, m13, m14 )

2. Solve the figure below using K-maps


and draw the simplified circuit
diagram on logisim and display
your calculations for reducing the

Digital Logic Design Page 7


Gift University Gujranwala Computer Science

output using K-maps. (1.5 Marks)

Digital Logic Design Page 8

You might also like