K-Maps or karnaugh Maps
Minimization Of BooleanExpressions-
There are following two methods of minimizing or reducing the boolean expressions-
KarnaughMap-
The Karnaugh Map also called as K Map is a graphical representation that provides a systematic method for
simplifying the boolean expressions.
1/25
For a Boolean expression consisting of n-variables, number of cells required in K Map=2ncells.
Two VariableKMap-
Two variable K Map is drawn for a boolean expression consisting of two variables. The
number of cells present in two variable K Map = 22= 4 cells.
So,for a Boolean function consisting of two variables,we draw a 2x2 K Map.
Two variable KMap may be represented as-
2/25
Here ,A and B are the two variables of the given Boolean function.
Three Variable KMap-
Three variable KMap is drawn for a Boolean expression consisting oft three variables.
The number of cells present in three variable K Map = 23= 8 cells.
So,for a Boolean function consisting of three variables,we draw a 2x4 KMap.
3/25
Here,A,B and C are the three variables of the given Boolean function.
Four Variable KMap-
Four variable K Map is drawn for a boolean expression consisting of four variables.
The number of cells present in four variable K Map = 24= 16 cells.
So,for a Boolean function consisting off our variables,we draw a 4x4KMap.
FourvariableKMapmayberepresentedas-
4/25
Here,A,B,CandDarethefourvariablesofthegivenbooleanfunction.
5/25
Karnaugh Map Simplification Rules-
To minimize the given Boolean function,
We draw a K Map according to the number of variables it contains.
We fill the K Map with 0’s and 1’s according to its function.
Then ,we minimize the function in accordance with the followingrules.
Rule-01:
We can either group 0’s with 0’s or 1’s with 1’s but we can not group 0’s and 1’s together.X
representing don’t care can be grouped with 0’s as well as 1
NOTE
There is no need of separately grouping X’s i.e. they can be ignored if all 0’s and 1’s are already
grouped.
Advertisements
6/25
Rule-02:
Groups may overlap each other .
Rule-03:
We can only create a group whose number of cells can be represented in the power of
[Link] other words, a group can only contain 2ni.e. 1, 2, 4, 8, 16 and so on number of cells.
Example
7/25
Rule-04:
Groupsn can be only either horizontal or vertical.
We cannot create groups of diagonal or any other shape.
8/25
Rule-05:
Each group should be as large as possible.
Example-
Rule-06
Opposite grouping and corner grouping are allowed.
9/25
The example of opposite grouping is shown illustrated in Rule-05. The
example of corner grouping is shown below.
Example-
Rule-07:
There should be as few groups as possible.
PROBLEMS BASED ON KARNAUGHMAP-
Problem-01:
Minimizethefollowingbooleanfunction-
F(A,B,C,D)=Σm(0,1,2,5,7,8,9,10,13,15)
10/25
Solution-
Sincethegivenbooleanexpressionhas4variables,sowedrawa4x4KMap. We fill the
cells of K Map in accordance with the given boolean function.
Then,weformthegroupsinaccordancewiththeaboverules.
Then,wehave-
11/25
Now,
F(A,B,C,D)
=(A’B+AB)(C’D+CD)+(A’B’+A’B+AB+AB’)C’D+(A’B’+AB’)(C’D’+CD’)
=BD+C’D+B’D’
12/25
Thus,minimizedbooleanexpressionis-
F(A,B,C,D)=BD+C’D+B’D’
Problem-02:
Minimizethefollowingbooleanfunction-
F(A,B,C,D)=Σm(0,1,3,5,7,8,9,11,13,15)
Solution-
Sincethegivenbooleanexpressionhas4variables,sowedrawa4x4KMap. We fill the
cells of K Map in accordance with the given boolean function.
Then,weformthegroupsinaccordancewiththeaboverules.
Then,wehave-
13/25
Now,
F(A,B,C,D)
=(A’B’+A’B+AB+AB’)(C’D+CD)+(A’B’+AB’)(C’D’+C’D)
=D+B’C’
Thus,minimizedbooleanexpressionis-
F(A,B,C,D)=B’C’+D
Problem-03:
Minimizethefollowingbooleanfunction-
F(A,B,C,D)=Σm(1,3,4,6,8,9,11,13,15)+Σd(0,2,14)
14/25
Solution-
Sincethegivenbooleanexpressionhas4variables,sowedrawa4x4KMap. We fill the
cells of K Map in accordance with the given boolean function.
Then,weformthegroupsinaccordancewiththeaboverules.
Then,wehave-
15/25
Now,
F(A,B,C,D)
=(AB+AB’)(C’D+CD)+(A’B’+AB’)(C’D+CD)+(A’B’+AB’)(C’D’+C’D)+(A’B’+A’B)(C’D’+CD’)
=AD+B’D+B’C’+A’D’
Thus,minimizedbooleanexpressionis-
F(A,B,C,D)=AD+B’D+B’C’+A’D’
16/25
Problem-04:
Minimizethefollowingbooleanfunction-
F(A,B,C)=Σm(0,1,6,7)+Σd(3,5)
Solution-
Sincethegivenbooleanexpressionhas3variables,sowedrawa2x4KMap. We fill the
cells of K Map in accordance with the given boolean function.
Then,weformthegroupsinaccordancewiththeaboverules.
Then,wehave-
Now,
F(A,B,C)
=A'(B’C’ +B’C)+A(BC+BC’)
=A’B’+AB
Thus,minimizedbooleanexpressionis-
17/25
F(A,B,C)=AB+A’B’
NOTE-
Itmaybenotedthatthereisnoneedofconsideringthequadgroup.
This is because even if we consider that group, we will have to consider the other two duets.
So, there is no use of considering that quad group.
Problem-05:
Minimizethefollowingbooleanfunction-
F(A,B,C)=Σm(1,2,5,7)+Σd(0,4,6)
Solution-
Since the given boolean expression has 3 variables, so we draw a 2 x 4 K Map.
We fill the cells of K Map in accordance with the given boolean function.
Then,weformthegroupsinaccordancewiththeaboverules.
18/25
Then,wehave-
19/25
Now,
F(A,B,C)
=(A+A’)(B’C’+B’C)+A(B’C’+B’C+BC+BC’)+(A+A’)(B’C’+BC’)
=B’+A+C’
Thus,minimizedbooleanexpressionis-
F(A,B,C)=A+B’+C’
Problem-06:
Minimizethefollowingbooleanfunction-
F(A,B,C)=Σm(0,1,6,7)+Σd(3,4,5)
Solution-
Sincethegivenbooleanexpressionhas3variables,sowedrawa2x4KMap.
WefillthecellsofKMapinaccordancewiththegivenbooleanfunction.
20/25
Then,weformthegroupsinaccordancewiththeaboverules.
Then,wehave-
Now,
F(A,B,C)
=(A+A’)(B’C’+B’C)+A(B’C’+B’C+BC+BC’)
=B’+A
Thus,minimizedbooleanexpressionis-
F(A,B,C)=A+B’
Problem-07:
Minimizethefollowingbooleanfunction-
F(A,B,C,D)=Σm(0,2,8,10,14)+Σd(5,15)
Solution-
Sincethegivenbooleanexpressionhas4variables,sowedrawa4x4KMap.
21/25
We fill the cells of K Map in accordance with the given boolean function.
Then, we form the groups in accordance with the above rules.
Then,wehave-
Now,
F(A,B,C,D)
=(AB+AB’)CD’+(A’B’+AB’)(C’D’+CD’)
=ACD’ +B’D’
Thus,minimizedbooleanexpressionis-
F(A,B,C,D)=ACD’+B’D’
Problem-08:
Minimizethefollowingbooleanfunction-
F(A,B,C,D)=Σm(3,4,5,7,9,13,14,15)
22/25
Solution-
Sincethegivenbooleanexpressionhas4variables,sowedrawa4x4KMap. We fill the
cells of K Map in accordance with the given boolean function.
Then,weformthegroupsinaccordancewiththeaboverules.
Then,wehave-
Now,
F(A,B,C,D)
=A’B(C’D’+C’D)+(A’B’+A’B)(CD)+(AB+AB’)(C’D)+AB(CD+CD’)
=A’BC’+A’CD+AC’D+ABC
Thus,minimizedbooleanexpressionis-
F(A,B,C,D)=A’BC’+A’CD+AC’D+ABC
23/25
It is important to note that we are not considering the quad group because we have to consider the
duetsanyhow.
Problem-09:
Considerthefollowingbooleanfunction-
F(W,X,Y,Z)=Σm(1,3,4,6,9,11,12,14)
Thisfunctionisindependent [Link].
Solution-
Sincethegivenbooleanexpressionhas4variables,sowedrawa4x4KMap. We fill the
cells of K Map in accordance with the given boolean function.
Then,weformthegroupsinaccordancewiththeaboverules.
Then,wehave-
24/25
Now,
F(W,X,Y,Z)
=(W’X+WX)(Y’Z’+YZ’)+(W’X’+WX’)(Y’Z+YZ)
=XZ’+X’Z
=X⊕Z
Thus,minimizedbooleanexpressionis-
F(W, X,Y, Z) =X ⊕Z
Clearly, the given boolean function depends on only two variables X and Z.
Hence, it is independent of other two variables W and Y.
25/25
