K Map Minimization

Chapter 5
Karnaugh Map and Minimization

Procedures
Lesson 2
Minimization of Boolean Expressions
Ch05L2--"Digital Principles and Design", Raj Kamal, Pearson Education, 2

2006
Outline
• Adjacency
• Wrapping adjacency
• Don't care condition
• Octets
• Quads
• Pairs
• Offset and diagonal adjacencies
2006
Property
Each cell has the adjacent cells such that
when moving from one cell to another left,
right up or down, only one variable
complements

2006
Only one variable complements
between two neighboring cells
C C C
AB 0 1
AB 00
AB 01
AB 11
AB 10
2006
Map for F = A.B.C + A.B.C +A.B.C +
A.B.C + A.B.C
C C C Σ m(0, 3,
AB 4, 5, 7 )
0 1
AB 00 1
Adjacent
AB 01 1 Cells—
1 variable A
AB 11
complement
AB 10 1 1 ing
2006
Only one variable complements
between two neighboring cells
C CD CD CD CD
AB 00 01 11 10
AB 00
AB 01
AB 11
AB 10
2006
Map for F = A.B.C.D + A.B.C.D
D complementing Σ m(4, 5)
C CD CD CD CD
AB 00 01 11 10
AB 00
AB 01 1 1
AB 11
AB 10
2006
Outline
• Adjacency
• Octets
• Quads
• Pairs
2006
Wrapping Adjacency Property
Each cell has the adjacent cells such that

only one variable complements when
moving from one cell to another when
• Considering the first row and last row also
as adjacent rows
• Consider the first column and last Column
also as adjacent columns

2006
Wrap the map in horizontal axis
cylindrical form
• Two cells, one each at the upper most row
and lower most row can also be considered
as adjacent if we wrap the map in horizontal
axis cylindrical form and there is only a
single-variable, which changes into its
complement when we consider two cells of
same column in upper most and lower most
rows.
2006
Wrap the map in vertical axis
cylindrical form
• Two cells, one each at the left most column
and right most column can also be
considered as adjacent if we wrap the map
in vertical axis cylindrical form and there is
only a single-variable, which changes into
its complement when we consider two cells
of same row in left most and rightmost
columns
2006
A.B.C + A.B.C
C C C Σ m(0, 3,
AB 4, 5, 7 )
0 1
AB 00 1 Adjacent
Cells—
AB 01 1 variable A
complementi
AB 11 1 ng
AB 10 1 1
2006
Map for F = A.B.C.D + A.B.C.D
C complementing Σ m(4, 6)
C CD CD CD CD
AB 00 01 11 10
AB 00
AB 01 1 1
AB 11
AB 10
2006
Outline
• Adjacency
• Octets
• Quads
• Pairs
2006
A.B.C + A.B.C
=Σ m(1, 3,
C C C 4, 5, 7 )
AB 0 1 =Σ m(3, 4,
5, 7 )
AB 00 X
Don’t care
AB 01 1 condition if F
1 same whether
AB 11
first term
AB 10 1 1 present or not
2006
Same for F = Σ m(4, 5, 12, 13) and
D and A complementing Σ m(4, 5, 12)
C CD CD CD CD
AB 00 01 11 10
AB 00
AB 01 1 1 Don’t care condition

AB 11 1 X
AB 10
2006
Don’t care condition
Do not care condition means that a

combination of input states do occur
and whether the outputs for those
states taken as 1s or 0s, it does not
matter.

2006
Don’t care condition in SOP form
Map
• Place 1s at the corresponding mini-

term places in SOP form of the
Karnaugh map. The 1s are placed
only at the cells where it leads to
make or improve adjacencies.

2006
Same for F = Σ m(4, 5, 12, 13) and
D and A complementing Σ m(4, 5, 12)
C CD CD CD CD
AB 00 01 11 10
AB 00
AB 01 1 1 Put 1 to make
AB 11 1 X it adjacent
AB 10
2006
Don’t care condition in POS form
Map
• Place 0s at the corresponding Max--
term places in POS form of the
Karnaugh map. The 0s are placed
only at the cells where it leads to
make or improve adjacencies.

2006
F = (A+ B + C) . (A+ B+ C)
Put C C C X=0
X= AB 0 1 F= Π M(2,
0
6) and
A+B 00 also F =
A+B 01 X M(6).
M(2) is
A+B 11 0 don’t care
A+B 10 condition
2006
Outline
• Adjacency
• Octets
• Quads
• Pairs
2006
F= Σ m(0, 1, 4, 5, 12, 13, 8, 9)
Octet C, D and A complementing
C CD CD CD CD
AB 00 01 11 10
AB 00 1 1
AB 01 1 1
AB 11 1 1
AB 10 1 1
2006
Octet Property
Eight cells show adjacency or
wrapping adjacency
Minimises the Boolean expression
Eight terms become one term
Remaining term has three variables
removed
Only one variable common in four
variable map
2006
F = Σ m(0, 1, 4, 5, 12, 13, 8, 9) = C
Octet— B, D and A complementing
C CD CD CD CD
AB 00 01 11 10
AB 00 1 1
AB 01 1 1
AB 11 1 1
AB 10 1 1
2006
F = Σ m(0, 2, 4, 6, 12, 14, 8, 10) = D
Octet C, B and A complementing
C CD CD CD CD
AB 00 01 11 10
AB 00 1 1
AB 01 1 1
AB 11 1 1
AB 10 1 1
2006
Outline
• Adjacency
• Octets
• Quads
• Pairs
2006
F= Σ m(0, 1, 8, 9)= B.C
Quad D and A complementing
C CD CD CD CD
AB 00 01 11 10
AB 00 1 1
AB 01
AB 11
AB 10 1 1
2006
Quad Property
Four cells show adjacency or
wrapping adjacency
Four terms become one term
Remaining term has two variables
removed
Two variables common in four or
three variable map
2006
F = Σ m(1, 3, 5, 7) = A.D
Quad— B and C complementing
C CD CD CD CD
AB 00 01 11 10
AB 00 1 1
AB 01 1 1
AB 11
AB 10
2006
F = Σ m(0, 2, 4, 6) =A. D
Quad C, and B complementing
C CD CD CD CD
AB 00 01 11 10
AB 00 1 1
AB 01 1 1
AB 11
AB 10 1
2006
A.B.C = B
C C C
AB
Σ m(4, 5,
0 1
12, 13)
AB 00
AB 01 1 1 4 Adjacent
Cells—
1 1
AB 11 variable B
AB 10 common
2006
Outline
• Adjacency
• Octets
• Quads
• Pairs
2006
F= Σ m(0, 8)= B.C.D
Pair A complementing (wrapping adjacency)
C CD CD CD CD
AB 00 01 11 10
AB 00 1
AB 01
AB 11
AB 10 1
2006
Pair Property
Two cells show adjacency or
wrapping adjacency
Two terms become one term
Remaining term has one variables
removed
One variable common in map

2006
F= Σ m(1, 3, 4, 6) = A.B.D + A.B.D
Pairs (one adjacency and one wrapping adjacency
C CD CD CD CD
AB 00 01 11 10
AB 00 1 1
AB 01 1 1
AB 11
AB 10
2006
F = Σ m(1, 8, 2, 6) =A.B.C. D+A.B.C.D + A.C.D
Pair B complementing
C CD CD CD CD
AB 00 01 11 10
AB 00 1 1
AB 01 1
AB 11
AB 10 1
2006
Map for F = A.B.C + A.B.C = B.C
C C C
AB 0 1 Σ m(4, 12)
AB 00
2 Adjacent
AB 01 1 Cells—
1 variables B
AB 11
and C
AB 10 common
2006
Outline
• Adjacency
• Octets
• Quads
• Pairs
2006
Offset adjacency
C CD CD CD CD
AB 00 01 11 10
AB 00 1 1
1
AB 01 1
AB 11
AB 10
2006
Diagonal adjacency
C CD CD CD CD
AB 00 01 11 10
AB 00 1
AB 01
AB 11 1
AB 10 1
2006
XOR and XNOR gates are used
offset and diagonal adjacencies

2006
Summary

2006
We learnt
• Octets, Quads and pairs reduces a set
of 8, 4 and 2, respectively miniterms
or maxterms into 1.
• Adjacency of wrapping the map is also
taken into account

2006
End of Lesson 2
Minimization of Boolean Expressions

2006
THANK YOU

2006

K Map Minimization

Transféré par

Informations du document

Description originale:

Titre original

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

K Map Minimization

Transféré par

Droits d'auteur :

Formats disponibles

Chapter 5

Karnaugh Map and Minimization

Minimization of Boolean Expressions

Ch05L2--"Digital Principles and Design", Raj Kamal, Pearson Education, 2

Ch05L2--"Digital Principles and Design", Raj Kamal, Pearson Education, 4

Each cell has the adjacent cells such that

Ch05L2--"Digital Principles and Design", Raj Kamal, Pearson Education, 10

AB 01 1 1 Don’t care condition

Do not care condition means that a

Ch05L2--"Digital Principles and Design", Raj Kamal, Pearson Education, 18

• Place 1s at the corresponding mini-

Ch05L2--"Digital Principles and Design", Raj Kamal, Pearson Education, 19

Ch05L2--"Digital Principles and Design", Raj Kamal, Pearson Education, 21

Ch05L2--"Digital Principles and Design", Raj Kamal, Pearson Education, 36

Ch05L2--"Digital Principles and Design", Raj Kamal, Pearson Education, 43

Ch05L2--"Digital Principles and Design", Raj Kamal, Pearson Education, 44

Ch05L2--"Digital Principles and Design", Raj Kamal, Pearson Education, 45

Minimization of Boolean Expressions

Ch05L2--"Digital Principles and Design", Raj Kamal, Pearson Education, 46

Ch05L2--"Digital Principles and Design", Raj Kamal, Pearson Education, 47

Vous aimerez peut-être aussi