K-MAP

PRESENTATION
PRESENTED BY
Shreya Das Banhisikha Poddar
. Roll No. : 6163
Reg No. :
Roll No. : 6145
Reg No. :
107232014000091 107232011000078

BHAIRAB GANGULY
COLLEGE DEPARTMENT OF
COMPUTER SCIENCE
KARNAUGH
MAPPING
A SYSTEMATIC APPROACH TO BOOLEAN LOGIC REDUCTION UNLOCKING THE SECRETS OF
DIGITAL LOGIC SIMPLIFICATION
A o Introduction of K-map

G
o Purpose of K-map
o Basics of K-map
o Structure of K-map

E o Filling the K-map

o Grouping in K-maps
o Variable K-maps

N o Don’t Care Conditions

o Simplifying Boolean Expression
o Advantages of K-maps

D o Limitation of K-maps
o Applications of K-maps

A
o Summary of Key Points
o Conclusion
 INTRODUCE THE K-MAP
K-map, or Karnaugh map, is a tool used for simplifying Boolean
expressions.
It provides a visual method to minimize the number of terms in logical
expressions.
K-maps are particularly useful for handling up to four or five variables
KARNAUGH MAPPING

effectively.

PURPOSE OF K-MAP
The primary purpose of K-maps is to simplify complex logic circuits.
They help in reducing the number of gates required in a circuit design.
By minimizing expressions, K-maps enhance circuit efficiency and
performance.

4
 BASICS OF K-MAP
K-maps are structured as a grid with cells representing
minterms.
Each cell corresponds to a specific combination of variables.
The arrangement follows Gray code to ensure that only one
variable changes between adjacent cells.
KARNAUGH MAPPING

STRUCTURE OF
K-MAP K-maps can vary in size depending on the number of
input variables, typically ranging from 2 to 6 variables.
A 2-variable K-map has 4 cells, while a 3-variable K-map
has 8 cells.
Larger K-maps, such as those for 4 or 5 variables, can
be more complex but follow the same principles.

5
 FILLING UP K-MAP
To fill a K-map, it involves systematically placing the values of
a given truth table into the K-map grid. Here's the step-by-step
process :
▪ Step 1 : Determine the Number of Variables The number of
variables determines the size of the K-map :-
2 variables → 2×2 K-map
3 variables → 2×4 K-map
KARNAUGH MAPPING

4 variables → 4×4 K-map

▪ Step 2 : Label the K-map :-
The rows and columns are labeled with Gray code (not
binary counting) to ensure only one bit changes between
adjacent cells.
▪ Step 3 : Transfer Values from the Truth Table :-
Locate the correct cell using the variable states from the
truth table. Fill in 1 for minterms where the function is true (1).
Fill in 0 for maxterms where the function is false (0) (optional
in some cases).
▪ Step 4 : Group the 1s :-
After filling the map, group adjacent 1s into power-of-two
clusters (1, 2, 4, 8, etc.). These groups should be as large as
possible simplify the Boolean expression 6
 GROUPING IN K-MAP
The next step in K-map simplification is to group adjacent cells that
contain 1s.
Groups can be formed in sizes of 1, 2, 4, 8, etc., and must be
rectangular in shape.
Overlapping groups is permissible and can lead to further simplification
KARNAUGH MAPPING

of the expression.

RULES FOR GROUPING

Groups must contain 1s only and should be as large as possible for
maximum simplification.
Each group should contain a number of cells that is a power of two.
Groups can wrap around the edges of the K-map, allowing for more
flexible combinations.

7
 2 VARIABLE K-MAP
A two-variable K-map consists of four cells arranged in a 2x2 grid for the
variables A and B.
Each cell represents one of the four possible combinations of the
variables.
Filling it with a function like F(A, B) = AB + A'B gives specific cell values.
KARNAUGH MAPPING

Grouping the cells visually leads to a simple expression like A + B.

This K-map allows for straightforward grouping and simplification.

3 VARIABLE K-MAP
A 3-variable K-map has 8 cells for variables A, B, and C arranged in a 2x4
grid.
Each cell corresponds to a unique combination of three variables. For F(A,
B, C) = ABC + AB'C + A'BC, the cells are filled accordingly.
The resulting groups can lead to a simplified expression like AB + AC.
Grouping in this map can yield simplified expressions with ease.

8
 4 VARIABLE K-MAP
A 4-variable K-map contains 16 cells for variables A, B, C, and D,
represented by a 4x4 grid.
Each cell represents a combination of four input variables. An example
function F(A, B, C, D) can lead to a complex arrangement in the K-map.
Proper grouping can significantly reduce the complexity of the resulting
expression.
KARNAUGH MAPPING

This K-map allows for multiple groupings for simplification.

DON’T CARE CONDITION

Don’t care conditions are represented by 'X' in K-maps.
They can be treated as either '1' or '0' during simplification.
Avoid creating groups that are not powers of two; this can lead to incorrect
results.
Do not leave single 1s ungrouped unless absolutely necessary. And be
cautious not to include empty cells in the groupings.

9
 SIMPLIFYING BOOLEAN EXPRESSION
After forming groups, the next step is to derive the simplified Boolean expression.
Each group corresponds to a product term in the final expression based on the variables that remain constant.
The final expression is a sum of these product terms, representing the minimized function.
KARNAUGH MAPPING

10
 ADVANTAGES OF K-MAP
K-maps provide a visual representation that simplifies the process of
Boolean minimization.
They allow for quick identification of potential simplifications that might
be missed in algebraic methods.
K-maps are intuitive and can significantly aid in teaching digital logic
design.
KARNAUGH MAPPING

LIMITATION OF K-MAP
K-maps become impractical for functions with more than six variables
due to their complexity.
The manual grouping process can lead to human error if not done
carefully.
K-maps do not easily extend to functions with don't care conditions
without careful consideration.

11
 APPLICATION OF K-MAP
K-maps are widely used in digital circuit design and optimization.
They assist in designing efficient logic gates and circuits.
Engineers use K-maps for academic purposes and industrial
applications alike.
KARNAUGH MAPPING

SUMMARY OF KEY
POINTS
K-maps are a powerful visual tool for simplifying Boolean
expressions.
The grouping process is crucial for obtaining minimized circuit
designs.
Despite limitations, K-maps remain a fundamental method in digital
electronics.

12
C
O
N
C
o K-maps are an essential tool in the field
of digital circuits for simplifying Boolean
expressions.

L o Their graphical nature makes them

accessible for learners and professionals

U alike.
o Understanding K-maps enhances the

S
design process of efficient digital systems
and circuits.

I
O
N
THANK
YOU