Karnaugh Maps (K maps)
qFeel a little difficult using Boolean algebra laws, rules, and theorems to simplify logic?
qA
K-map provides a systematic method for simplifying Boolean expressions and, if
properly used, will produce the simplest SOP or POS expression possible, known
as the minimum expression.
What are Karnaugh1
maps?
•Karnaugh maps
provide an alternative way of simplifying logic circuits.
•Instead of using
Boolean algebra simplification techniques, you can
transfer logic values from a
Boolean statement or a truth table into a Karnaugh map.
•The arrangement of
0's and 1's within the map helps you to visualise the logic
relationships between the variables and leads
directly to a simplified Boolean statement.
qIt’s similar to truth
table; instead of being organized (i/p
and o/p) into
columns and rows, the K-map is an array of cells in which each
cell represents a binary value of the input variables.
qThe cells are
arranged in a way so thatsimplification of a given expression issimply a matter of properly grouping thecells.
qK-maps can be used
for expressionswith 2, 3, 4, and 5 variables.3 and 4variables
will be
discussed to illustrate the principles.•Karnaugh maps, or K-maps, are often used
to
simplify logic problems with 2, 3 or 4 variables.
Cell = 2n ,where n is a number of variables
For the case of 2 variables, we form a
map consisting of 22=4 cells
as shown in Figure
 |
| 2 variable |
