KARNAUGH MAP

PRESENTED BY,
STARLET BEN ALEX
DEPT. OF ECE
Sum-of-products (SOP)
■ Also called disjunctive normal form (DNF)
or minterm expansion minterm

001 011 101 110 111

A B C F F'
F = A'B'C + A'BC + AB'C + ABC' + ABC
0 0 0 0 1
0 0 1 1 0
0 1 0 0 1
2
0 1 1 1 0
1 0 0 0 1
1 0 1 1 0
1 1 0 1 0
1 1 1 1 0
Product-of-sums (POS)
■ Also called conjunctive normal form (CNF)
or maxterm expansion
000 010 100
A B C F F' F = (A + B + C) (A + B' + C) (A' + B + C)
0 0 0 0 1
0 0 1 1 0
0 1 0 0 1
0 1 1 1 0 maxterm 3
1 0 0 0 1
1 0 1 1 0 F' = (A+B+C')(A+B'+C')(A'+B+C')(A'+B'+C)(A'+B'+C')
1 1 0 1 0
1 1 1 1 0
Example: F = AB+C

4
POLL 1
● Go to :
https://quizizz.com/admin/quiz/5f7ea56434a264001bb24c3f

Or

● Go to joinmyquiz.com
● Type the code: 96 79 85
 Simplification of Boolean Functions:
▪ An implementation of a Boolean Function requires the use
of logic gates.
▪ A smaller number of gates, with each gate (other then
Inverter) having less number of inputs, may reduce the
cost of the implementation.
▪ There are 2 methods for simplification of Boolean
functions.
6
 Simplification of Boolean Functions: Two Methods
1. The algebraic method by using Identities
2. The graphical method by using Karnaugh Map method
▪ The K-map method is easy and straightforward.
▪ A K-map for a function of n variables
▪ consists of 2n cells, and,
▪ in every row and column, two adjacent cells should differ
in the value of only one of the logic variables.
7
 2-Variable K-map
– Place 1s and 0s from the truth table in the K-map.
– Each square of 1s = minterms.
– Minterms in adjacent squares can be combined since
they differ in only one variable. Use XY’ + XY = X.
 Three-Variable Map

-Note: variable ordering is (x,y,z); yz specifies

column, x specifies row.
-Each cell is adjacent to three other cells (left or
right or top or bottom or edge wrap)
QUICK RECAP
 Three-Variable Map (cont.)
minterm
The types of structures that
are either minterms or are
generated by repeated
application of the
minimization theorem on a
three variable map are shown
at right.
group of 2 terms
Groups of 1, 2, 4, 8 are
possible. group of 4 terms
POLL 2
● Go to : https://quizizz.com/join?gc=450970

Or

● Go to joinmyquiz.com
● Type the code: 450970
 More Examples
yz
X 00 01 11 10

• f1(x, y, z) = ∑ m(2,3,5,7) 0 1 1
1 1 1
■ f (x, y, z) = x’y + xz
1

• f2(x, y, z) = ∑ m (0,1,2,3,6) 1 1 1 1
1
■f2(x, y, z) = x’+yz’
1. Reading the Karnaugh map, the logic expression is
a. A C + A B
b. A B + A C
c. A B + B C
d. A B + A C

© 2009 Pearson Education

QUICK RECAP
POLL 3
● Go to : https://quizizz.com/join?gc=081113

Or

● Go to joinmyquiz.com
● Type the code: 081113
Don't Care Conditions
● There may be a combination of input values which
■ will never occur
■ if they do occur, the output is of no concern.
● The function value for such combinations is called a don't care.
● They are denoted with x or –. Each x may be arbitrarily
assigned the value 0 or 1 in an implementation.
● Don’t cares can be used to further simplify a function
Minimization using Don’t Cares
•Treat don't cares as if they are 1s to generate PIs.
•Delete PI's that cover only don't care minterms.
•Treat the covering of remaining don't care
minterms as optional in the selection process (i.e.
they may be, but need not be, covered).
Simplification with Don’t Care
Get a Minimum POS Using K Map
• Cover 0’s to get simplified POS.
– We want 0 in each term.
SUMMARY
 ACTIVITY
Minimize the following exressions using K-map:
1. Y(A,B,C,D) = π M(0,2,8,9,12,13,15)
2. Y(A,B,C,D) = Ʃ m (1,3,7,11,15) + d (0,2,5)
3. Y(A,B,C,D) = π M (4,5,6,7,8,12) . d (1,2,3,9,11,14)