Digital Logic(U-I) @RKS
Karnaugh Map (K- Map)
Karnaugh introduced a method for simplification of Boolean functions in an easy way.
This method is known as Karnaugh map method or K-map method.
K-Map is used to simplify the Boolean expression in pictorial format without using Boolean
laws or theorems.
It is a graphical method, which consists of 2n cells for ‘n’ variables. The adjacent
cells are differed only in single bit position.
K-Map method is most suitable for minimizing Boolean functions of 2 variables to 5
variables.
2 Variable K-Map
The number of cells in 2 variable K-map is 4, since the number of variables is two. The
following figure shows 2 variable K-Map.
There is only one possibility of grouping 4 adjacent min terms.
The possible combinations of grouping 2 adjacent min terms are { (m0, m1), (m2,
m3), (m0, m2) and (m1, m3) }.
1|Page
Digital Logic(U-I) @RKS
3 Variable K-Map
The number of cells in 3 variable K-map is 8, since the number of variables is three. The
following figure shows 3 variable K-Map.
There is only one possibility of grouping 8 adjacent min terms.
The possible combinations of grouping 4 adjacent min terms are { (m0, m1, m3,
m2), (m4, m5, m7, m6), (m0, m1, m4, m5), (m1, m3, m5, m7), (m3, m2, m7, m6)
and (m2, m0, m6, m4) }.
The possible combinations of grouping 2 adjacent min terms are { (m0, m1), (m1,
m3), (m3, m2), (m2, m0), (m4, m5), (m5, m7), (m7, m6), (m6, m4), (m0, m4), (m1,
m5), (m3, m7) and (m2, m6) }.
If x=0, then 3 variable K-map becomes 2 variable K-map.
4 Variable K-Map
The number of cells in 4 variable K-map is 16, since the number of variables is four. The
following figure shows 4 variable K-Map.
2|Page
Digital Logic(U-I) @RKS
There is only one possibility of grouping 16 adjacent min terms.
Let R1, R2, R3 and R4 represents the min terms of first row, second row, third row
and fourth row respectively. Similarly, C1, C2, C3 and C4 represents the min terms
of first column, second column, third column and fourth column respectively. The
possible combinations of grouping 8 adjacent min terms are {(R1, R2), (R2, R3),
(R3, R4), (R4, R1), (C1, C2), (C2, C3), (C3, C4), (C4, C1)}.
If w=0, then 4 variable K-map becomes 3 variable K-map.
5 Variable K-Map
The number of cells in 5 variable K-map is thirty-two, since the number of variables is 5.
The following figure shows 5 variable K-Map.
There is only one possibility of grouping 32 adjacent min terms.
There are two possibilities of grouping 16 adjacent min terms. i.e., grouping of min
terms from m0 to m15 and m16 to m31.
If v=0, then 5 variable K-map becomes 4 variable K-map.
In the above all K-maps, we used exclusively the min terms notation. Similarly, you can
use exclusively the Max terms notation.
3|Page
Digital Logic(U-I) @RKS
Minimization of Boolean Functions using K-Maps
If we consider the combination of inputs for which the Boolean function is ‘1’, then we will
get the Boolean function, which is in standard sum of products form after simplifying the K-
map.
Similarly, if we consider the combination of inputs for which the Boolean function is ‘0’,
then we will get the Boolean function, which is in standard product of sums form after
simplifying the K-map.
Follow these rules for simplifying K-maps in order to get standard sum of products form.
Select the respective K-map based on the number of variables present in the Boolean
function.
If the Boolean function is given as sum of min terms form, then place the ones at
respective min term cells in the K-map. If the Boolean function is given as sum of
products form, then place the ones in all possible cells of K-map for which the given
product terms are valid.
Check for the possibilities of grouping maximum number of adjacent ones. It should be
powers of two. Start from highest power of two and upto least power of two. Highest
power is equal to the number of variables considered in K-map and least power is
zero.
Each grouping will give either a literal or one product term. It is known as prime
implicant. The prime implicant is said to be essential prime implicant, if atleast single ‘1’
is not covered with any other groupings but only that grouping covers.
Note down all the prime implicants and essential prime implicants. The simplified
Boolean function contains all essential prime implicants and only the required prime
implicants.
Note 1 − If outputs are not defined for some combination of inputs, then those output
values will be represented with don’t care symbol ‘x’. That means, we can consider them
as either ‘0’ or ‘1’.
4|Page
Digital Logic(U-I) @RKS
Note 2 − If don’t care terms also present, then place don’t cares ‘x’ in the respective cells
of K-map. Consider only the don’t cares ‘x’ that are helpful for grouping maximum number
of adjacent ones. In those cases, treat the don’t care value as ‘1’.
Example
Let us simplify the following Boolean function,
f(W,X,Y,Z) = WX’Y’ + WY + W’YZ’ using K-map.
The given Boolean function is in sum of products form. It is having 4 variables W, X, Y &
Z. So, we require 4 variable K-map. The 4 variable K-map with ones corresponding to the
given product terms is shown in the following figure.
Here, 1s are placed in the following cells of K-map.
The cells, which are common to the intersection of Row 4 and columns 1 & 2 are
corresponding to the product term, WX’Y’.
The cells, which are common to the intersection of Rows 3 & 4 and columns 3 & 4 are
corresponding to the product term, WY.
The cells, which are common to the intersection of Rows 1 & 2 and column 4 are
corresponding to the product term, W’YZ’.
There are no possibilities of grouping either 16 adjacent ones or 8 adjacent ones. There
are three possibilities of grouping 4 adjacent ones. After these three groupings, there is no
single one left as ungrouped. So, we no need to check for grouping of 2 adjacent ones.
The 4 variable K-map with these three groupings is shown in the following figure.
5|Page
Digital Logic(U-I) @RKS
Here, we got three prime implicants WX’, WY & YZ’. All these prime implicants
are essential because of following reasons.
Two ones (m8 & m9) of fourth row grouping are not covered by any other groupings.
Only fourth row grouping covers those two ones.
Single one (m15) of square shape grouping is not covered by any other groupings.
Only the square shape grouping covers that one.
Two ones (m2 & m6) of fourth column grouping are not covered by any other
groupings. Only fourth column grouping covers those two ones.
Therefore, the simplified Boolean function is
f = WX’ + WY + YZ’
Follow these rules for simplifying K-maps in order to get standard product of sums form.
Select the respective K-map based on the number of variables present in the Boolean
function.
If the Boolean function is given as product of Max terms form, then place the zeroes at
respective Max term cells in the K-map. If the Boolean function is given as product of
sums form, then place the zeroes in all possible cells of K-map for which the given sum
terms are valid.
Check for the possibilities of grouping maximum number of adjacent zeroes. It should
be powers of two. Start from highest power of two and upto least power of two. Highest
6|Page
Digital Logic(U-I) @RKS
power is equal to the number of variables considered in K-map and least power is
zero.
Each grouping will give either a literal or one sum term. It is known as prime implicant.
The prime implicant is said to be essential prime implicant, if atleast single ‘0’ is not
covered with any other groupings but only that grouping covers.
Note down all the prime implicants and essential prime implicants. The simplified
Boolean function contains all essential prime implicants and only the required prime
implicants.
Note − If don’t care terms also present, then place don’t cares ‘x’ in the respective cells of
K-map. Consider only the don’t cares ‘x’ that are helpful for grouping maximum number of
adjacent zeroes. In those cases, treat the don’t care value as ‘0’.
Example
Let us simplify the following Boolean function,
f(X,Y,Z)=M(0,1,2,4) using K-map.
The given Boolean function is in product of Max terms form. It is having 3 variables X, Y &
Z. So, we require 3 variable K-map. The given Max terms are M0, M1, M2 & M4. The
3 variable K-map with zeroes corresponding to the given Max terms is shown in the
following figure.
There are no possibilities of grouping either 8 adjacent zeroes or 4 adjacent zeroes. There
are three possibilities of grouping 2 adjacent zeroes. After these three groupings, there is
no single zero left as ungrouped. The 3 variable K-map with these three groupings is
shown in the following figure.
7|Page
Digital Logic(U-I) @RKS
Here, we got three prime implicants ( X + Y), (Y + Z) & (Z + X). All these prime implicants
are essential because one zero in each grouping is not covered by any other groupings
except with their individual groupings.
Therefore, the simplified Boolean function is
F = (X+Y) . (Y+Z) . (Z+X)
8|Page
