Digital Laboratory

Department of Electrical Engineering

Faculty of Engineering, University of Indonesia
Depok, 16424 - (021) 7270078 ext.131sss

Fundamental of Digital System

Module 3: Karnaugh Map

I. READING MATERIALS
Mano, M. Morris and Charles R. Kime; Logic and Computer Design
Fundamentals; Chapter 1, New Jersey; Prentice-Hall Inc., 2008.
Mano, M. Morris and Charles R. Kime; Logic and Computer Design
Fundamentals; Chapter 2, New Jersey; Prentice-Hall Inc., 2008.

II. OBJECTIVES
1. Understand how to use Karnaugh Map to simplify Boolean function.
2. Understand how to use integrated circuits.

III. BASIC THEORY

Karnaugh map (K-map) can be used to get the simplest form of a Boolean function that
states the relationship between output variables and input variables. The result of using K-map
to simplify Boolean function can be in the form of SOP (Sum of Products) or POS (Product of
Sums), depends on the simplification method. If we use logic 1, then the result will be in the
form of SOP, and if we use logic 0, then the result will be in the form of POS.

K-map can be used to simplify functions which have up to 8 variables, but usually for
functions which have 5 or more variables, another method is usually used such as tabulation
method or by using a computer program.

1. Make a table where the number of cells is determined by the number of inputs, for
n input variables there will be 2n cells in the table. For example, lets say we have
a function with two variables, A and B, the number of cells will be 22 = 4 cells.
2. After that, we map all input variables combinations in every cell. Here are the
examples for 2, 3, and 4 input variables.

1
 Digital Laboratory
Department of Electrical Engineering
Faculty of Engineering, University of Indonesia
Depok, 16424 - (021) 7270078 ext.131sss

a) Two Variables
B
0 1
0 00 01
A
1 10 11

b) Three Variables
BC
00 01 11 10
0 000 001 011 010
A
1 100 101 111 110

c) Four Variables
CD
00 01 11 10
00 0000 0001 0011 0010
01 0100 0101 0111 0110
AB
11 1100 1101 1111 1110
10 1000 1001 1011 1010

3. Fill the K-map cells with 1 for each minterm, 0 for each maxterm, and X for dont
care terms. The procedure is to be repeated for every single output variable. For
example:
F(A, B, C, D) = m(4, 5, 7, 8, 10, 11, 13, 14), d (0, 1, 2)
CD
00 01 11 10
00 x x 0 x
01 1 1 1 0
AB
11 0 1 0 1
10 1 0 1 1

3
 Digital Laboratory
Department of Electrical Engineering
Faculty of Engineering, University of Indonesia
Depok, 16424 - (021) 7270078 ext.131sss

4. K-map simplification can also be referred to as the "simplification by grouping"

technique as it solely relies on the formation of clusters. That is, the main aim of
the entire process is to gather together as many ones (for SOP solution) or zeros
(for POS solution) under one roof for each of the output variables in the problem
stated. However, while doing so we have to strictly abide by certain rules and
regulations:
a) The process has to be initiated by grouping the bits which lie in adjacent cells
such that the group formed contains the maximum number of selected bits.
This means that for an n-variable K-map with 2n cells, try to group for 2n cells
first, then for 2n-1 cells, next for 2n-2 cells, and so on until the group contains
only 20 cells, i.e., isolated bits (if any). Note that the number of cells in the
group must be equal to an integer power to 2, i.e., 1, 2, 4, 8. . . .
b) The procedure must be applied for all adjacent cells of the K-map, even when
they appear to be not adjacentthe top row is considered to be adjacent to the
bottom row and the rightmost column is considered to be adjacent to the
leftmost column, as if the K-map wraps around from top to bottom and right to
left.
c) A bit appearing in one group can be repeated in another group provided that
this leads to the increase in the resulting group-size.
d) Dont Care conditions are to be considered for the grouping activity if and only
if they help in obtaining a larger group. Otherwise, they are to be neglected.
Hence for F(A, B, C, D) = m(4, 5, 7, 8, 10, 11, 13, 14), d (0, 1, 2), the K-map
showing the groups can be obtained as below:
a) SOP Solution
CD
00 01 11 10
00 x x 0 x
01 1 1 1 0
AB
11 0 1 0 1
10 1 0 1 1

4
 Digital Laboratory
Department of Electrical Engineering
Faculty of Engineering, University of Indonesia
Depok, 16424 - (021) 7270078 ext.131sss

b) POS Solution
CD
00 01 11 10
00 x x 0 x
01 1 1 1 0
AB
11 0 1 0 1
10 1 0 1 1

5. For each of the resulting groups, we have to obtain the corresponding logical
expression in terms of the input-variables. This can be done by expressing the bits
which are common amongst the Gray code-words which represent the cells
contained within the considered group. Another way to describe the process of
obtaining the simplified logical expression for a group is to eliminate the
variable(s) for which the corresponding bits appear within the group as 0 and 1.
Finally, all these group-wise logical expressions need to be combined
appropriately to form the simplified Boolean equation for the output variable. The
same procedure must be repeated for every output variable of the given problem.
a) SOP Solution
AC

CD
00 01 11 10
00 x x 0 x
01 1 1 1 0 ABD
AB
11 0 1 0 1 ABC
10 1 0 1 1

BD
BCD ABC

F = BD + AC + ABD + BCD + ABC + ACD

5
 Digital Laboratory
Department of Electrical Engineering
Faculty of Engineering, University of Indonesia
Depok, 16424 - (021) 7270078 ext.131sss

b) POS Solution
CD
00 01 11 10
00 x x 0 x A+B
01 1 1 1 0 A+C+D
AB
11 0 1 0 1 A+B+C+D
10 1 0 1 1

A+B+C+D B+C+D

F = (A+B) (B+C+D) (A+C+D) (A+B+C+D) (A+B+C+D)

IV. TOOLS
Vulcan Digital Logic Trainer Board
IC 74LS08 - AND
IC 74LS32 - OR
IC 74LS04 - NOT (inverter)

V. PROCEDURE
1. Make sure that Vulcan Digital Logic Trainer Board is connected to a power source,
then turn it on by switching the power switch.
2. Make a circuit of a given function by using the necessary ICs, use the IC datasheet
to find out which pin that you need to connect. Do the wiring according to the
datasheet.
3. Connect the output on logic indicator L10 - L3 part on Vulcan Digital Logic Trainer
Board.
4. Connect the input on input switch S8 - S1 part on Vulcan Digital Logic Trainer
Board.
5. Write down the result on the truth table.
6. Simplify the given function using Karnaugh map.
7. Repeat step 2 - 5 for the simplified function.