Karnaugh Maps (K-maps) were
invented by Maurice Karnaugh in
1953.
Maurice
Karnaugh
He introduced them as a graphical
method for simplifying Boolean
algebra expressions in digital logic
design. Before that, Boolean
simplification was mostly done using
algebraic methods, which were
harder for larger functions.
is a graphical method to
simplify Boolean
expressions.
It can be created for any
number of variables (2, 3,
4, 5, or more).
The size of the map changes depending on
the number of variables:
•2 variables → 2×2 grid (4 cells)
•3 variables → 2×4 grid (8 cells)
•4 variables → 4×4 grid (16 cells)
What is a K-Map?
This is the simplest type of
K-map.
It has only 4 cells because
2 variables → 2×2 grid (4
cells)
Used to simplify functions of two variables
only (e.g., F(A,B)).
What is a 2-Variable
K-Map?
Variables:
A (column)
and B (rows)
Cells (minterms): m0=A'B',
m1=A'B, m2=AB', m3=AB
Structure of a
2-Variable
K-Map
K-Map 2 variables
Given:
F (A, B) = Σ(0, 2, 3)
K-Map 2 variables
•You put 1 on each minterm(cell) suggested on the given.
•The 0, 2, 3
K-Map 2 variables
•Now, Minimize them or group them
•Group no.1 and Group no.2
K-Map 2 variables
•Right down the equational group no.1 and 2