Gate-Level

Minimization
Chapter-3
Karnaugh
map or
K-map.
Karnaugh map or K-map.
▪ K-map i.e. Karnaugh map is simply a graphical
method for representing a Boolean fraction.
▪ The Karnaugh map is a systematic method for
simplify and manipulating Boolean expression. It
is used to simplify a logic expression or to convert
a truth table to its corresponding logic circuit.
▪ It is used for the minimization of switching
functions but upto ‘six’ variables. For more than
‘six’ variable it becomes complex.
Two-Variable K-
Map
Two-Variable K-
Map • Suppose a 2-variable Boolean
Function is given as:
 Three-Variable K-Map

Any two adjacent squares in the map differ by only one variable
Example 3-1
Example 3-2
Example 3-3
Example 3-4
21/9/2022
• 56
• 62
• 67