Experiment 7

To understand and use the Karnaugh maps in designing Logic circuits using Truth
tables.

BACKGROUND THEORY:

The Karnaugh map, also known as the K-map, is a method to simplify Boolean algebra
expressions. Maurice Karnaugh introduced it in 1953 as a refinement of Edward Veitch's 1952
Veitch diagram. The Karnaugh map reduces the need for extensive calculations by taking
advantage of humans' pattern-recognition capability. It also permits the rapid identification and
elimination of potential race conditions. The required Boolean results are transferred from a
truth table onto a two-dimensional grid where the cells are ordered in Gray code, and each cell
position represents one combination of input conditions, while each cell value represents the
corresponding output value. Optimal groups of 1s or 0s are identified, which represent the terms
of a canonical form of the logic in the original truth table. These terms can be used to write a
minimal Boolean expression representing the required logic. Some important terms related to
K-maps are as follows:

Sum of Products (SOP): A Sum of Products (SOP) expression contains: – Only AND
(Product) operations at the “outermost” level – Each term must be a sum of literals.

Example SOP expression: Y = A.B + B.C + A.C

Product of Sum (POS): A Product of Sums (POS) expression contains: – Only OR (sum)
Operations at the “outermost” level – Each term that is summed must be a product of literals.

Example POS expression: Y = (A+B+C) . (A+B) .(A+C)

Min term: A min term is a special product of literals, in which each input variable appears
exactly once. A function with ‘n’ variables has 2 n min terms (since each variable can appear
complemented or not). If you have a truth table for a function, you can write a sum of min
terms expression just by picking out the rows of the table where the function output is ‘1’.

Max term: A max term is a sum of literals, in which each input variable appears exactly once.
A function with ‘n’ variables has 2 n max terms. If you have a truth table for a function, you
can write a product of max terms expression by picking out the rows of the table where the
function output is ‘0’.

2- Input K-Map
In the truth table of a 2-Input Logic system:
3- Input K-Map
In the truth table of a 3-Input Logic system:

4- Input K-Map
In the truth table of a 4-Input Logic system:
 AN EXAMPLE SYSTEM SIMPLIFICATION USING K-MAP

The easiest way to simplify an expression with a Karnaugh map is to follow these steps:
a) Build the expression's truth table.
b) Starting with a blank Karnaugh map, take each row of the truth table where the output is 1
and mark the corresponding minterm in the map with a 1.
c) Form rectangular blocks of neighboring cells where each cell contains a 1. The size of these
blocks must be a power of two, e.g. one, two, four, eight, etc. Large blocks will give simpler
final equations, so try to make the blocks as large as possible.
d) Find the equation for each block. Each block will have variables which remain constant and
the block's equation is the ANDing of these variables. Now build an OR function with the block
equations as arguments. You have created the sum or products simplified expression.

Example:

The given Boolean algebraic expression is

First build the truth table as below:

To use a Karnaugh map we draw the following map which has a position (square)
corresponding to each of the 8 possible combinations of the 3 Boolean variables. The upper
left position corresponds to the 000 row of the truth table, the lower right position corresponds
to 101.
The 1s are in the same places as they were in the original truth table. The 1 in the first row is
at position 110 (a = 1, b = 1, c = 0).

The minimization is done by drawing circles around sets of adjacent 1s. Adjacency is
horizontal, vertical, or both. The circles must always contain 2n 1s where n is an integer.

We have circled two 1s. The fact that the circle spans the two possible values of a
(0 and 1) means that the a term is eliminated from the Boolean expression corresponding to
this circle.

Now we have drawn circles around all the 1s. Thus the expression reduces to

m = bc + ac + ab

HARDWARE REQUIRED:

• Power supply with cables

• Breadboard
• Logic gate ICs: 1) 7408 AND 2) 7404 NOT 3) 7432 OR
• LEDs
• Logic Probe (optional)

PROCEDURE:

1. Solve the initial equation of the system by K-Map.

2. Simplify the equation as much as possible using De Morgan’s Theorem and/or
Boolean identities. (attach working on separate sheet)
3. Now build the logic circuits for the simplified Boolean expression and complete the
table.
LAB TASK
From the given truth table of a Logic Circuit, determine the simplified Boolean expression of
the system in SOP (Sum of Products) form (attach working on a separate sheet):

A B C D Y
0 0 0 0 0
0 0 0 1 0
0 0 1 0 1
0 0 1 1 1
0 1 0 0 1
0 1 0 1 1
0 1 1 0 1
0 1 1 1 1
1 0 0 0 0
1 0 0 1 1
1 0 1 0 0
1 0 1 1 0
1 1 0 0 1
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1

Space for Simplification

Simplified Expression
 Simplified logic circuit and determine its truth table
A B C D Y
0 0 0 0
0 0 0 1
0 0 1 0
0 0 1 1
0 1 0 0
0 1 0 1
0 1 1 0
0 1 1 1
1 0 0 0
1 0 0 1
1 0 1 0
1 0 1 1
1 1 0 0
1 1 0 1
1 1 1 0
1 1 1 1

Home Activity:
Design a lighting control system of a room which consists of three switches. To turn
the light on, it is necessary that 2 out of 3 switches must be turned on. Otherwise the light
must stay off.
Determine the simplified Boolean expression of the system in SOP (Sum of Products)
form. Construct simplified logic gate circuits of the given system on tool and also verify it
by means of truth table:
Put your name and roll number on circuit design suite and attach the screen shot of your
designed circuit at the end of experiment#6 (also attach necessary working on a separate sheet)
REVIEW QUESTIONS:

Q.1) What have you learnt from this experiment?

LEARNING OUTCOMES:

Upon successful completion of the lab, students will be able to:

LO1: Understand and use K-Maps.

LO2: Design and/or synthesis and logic circuits using K-Maps.

 Lab’s Evaluation Sheet

Students Registration No
Date Performed:
Group No:
Date of Submission

Marks /Grade
Sr. No. Categories Total Marks/Grade
Obtained
1 Student’s Behavior 2.5

2 Lab Performance 2.5

3 On Time Submission 5
4 Home Activity 10

Net Result 20

Examined By: Syeda Zehra Zaidi Date