Professional Documents
Culture Documents
3, EEng K-Map
3, EEng K-Map
Y = BC
Looping Groups of Two (pairs) (Continued)
C C
AB 1 0
AB 0 0
AB 0 0
AB 1 0
(c)
Y = BC
AB 0 0 0 0
AB 0 0 0 0
1 0 0 1
BCD Redundant Looping
AB
AB D
Y = A BC + A BD
NOT Y = A BC + A BD + BC D
Looping Groups of Four (Quads):
C D C D C D CD C D C D C D CD
AB 0 0 0 1 0 0 0 0
AB
AB 0 0 0 1 0 0 0 0
AB
AB 0 0 0 1 1 1 1 1
AB
AB 0 0 0 1 0 0 0 0
AB
(a)
X = AB (b)
X = CD
Looping Groups of Four (Quads) (continued…)
C D C D C D CD C D C D C D CD
AB 0 0 0 0 0 0 0 0
AB
AB 0 1 1 0 0 0 0 0
AB
AB 0 1 1 0 AB 1 0 0 1
AB 0 0 0 0 AB 1 0 0 1
(c) (d)
X = BD X = AD
Looping Groups of Four (Quads) (continued…)
C D C D C D CD
AB 1 0 0 1
AB 0 0 0 0
AB 0 0 0 0
AB 1 0 0 1
(e)
X = BD
Looping a quad of 1s eliminates the two variables that appear in
both complemented and uncomplemented form.
Looping Groups of Eight (octets):
C D C D C D CD C D C D C D CD
0 0 0 0 AB 1 1 0 0
AB
1 1 1 1 AB 1 1 0 0
AB
AB 1 1 1 1 AB 1 1 0 0
AB 0 0 0 0 AB 1 1 0 0
(a) (b)
X=B X=C
Looping Groups of Eight (Octets) (continued…)
C D C D C D CD C D C D C D CD
AB
AB 1 1 1 1 1 0 0 1
AB
AB 0 0 0 0 1 0 0 1
AB
AB 0 0 0 0 1 0 0 1
AB
AB 1 1 1 1 1 0 0 1
(c) (d)
Y=B Y=D
Looping an octet of 1s eliminates the three variables that appear
in both complemented and uncomplemented form.
Rule for loops of any size
We can summarize the rule for loops of any size:
When a variable appears in both complemented and
uncomplemented form within a loop, that variable is eliminated
from the expression.
Variables that are the same for all squares of the loop must appear
in the final expression.
It should be clear that a larger loop of 1s eliminates more
variables. To be exact, a loop of two eliminates one variable, a loop
of four eliminates two, and a loop of eight eliminates three.
Complete Simplification Process
1. Construct the K map and place 1s in those squares corresponding to
the 1s in the truth table. Place 0s in the other squares.
2. Examine the map for adjacent 1s and loop those 1s, which are not
adjacent to any other 1s. These are called isolated 1s.
3. Next, look for those 1s, which are adjacent to only one other 1. Loop
any pair containing such a 1.
4. Loop any octet even it contains some 1s that have already been
looped.
5. Loop any quad that contains one or more 1s, which have not already
been looped, is making sure to use the minimum number of loops.
6. Loop any pairs necessary to include any 1s that have not yet been
looped, making sure to use the minimum number of loops.
7. Form the OR sum of all the terms generated by each loop.
Example#1
ABCD
C D C D C D CD
AB 0 0 0 1
AB 0 1 1 0
BD
AB 0 1 1 0
AB 0 0 1 0
(a)
ACD
X = ABCD + ACD + BD
Example#2
Option #1
ACD
C D C D C D CD
AB 0 1 0 0
AB 0 1 1 1 ABC
AB 0 0 0 1
1 1 0 1
AC D
AB
A BC
X = ACD + ABC + AC D + A BC
Example#
Option # 2
C D C D C D CD
ABD
AB 0 1 0 0
BCD AB 0 1 1 1
AB 0 0 0 1
BCD
AB 1 1 0 1
A BD
putting them side by side for reading the decimal A+B A+B+C A+B+C
For mapping a POS expression on to the K-map, 0s are (b) three-variable K-map
placed in the squares corresponding to the maxterms C+D C+D C+D C+D
which are present in the expression and 1 s are placed A+B A+B+C+D A+B+C+D A+B+C+D A+B+C+D
(or no entries are made) in the squares corresponding to A+B A+B+C+D A+B+C+D A+B+C+D A+B+C+D
the maxterms which are not present in the expression. A+B A+B+C+D A+B+C+D A+B+C+D A+B+C+D
A+B
B+C
A+B
A+B
Y = ( B + C) A A
A Five Variable Karnaugh Map
The Karnaugh map becomes three
INPUTS OUTPUT INPUTS OUTPUT
E D C B A Y E D C B A Y
dimensional when solving logic 0 0 0 0 0 0 1 0 0 0 0 0
Y = E ⋅D ⋅C ⋅B ⋅A + E ⋅D ⋅C ⋅B ⋅A + E ⋅D ⋅C ⋅B ⋅A + E ⋅D ⋅C ⋅B ⋅A + E ⋅D ⋅C ⋅B ⋅A +
E ⋅D ⋅C ⋅B ⋅A + E ⋅D ⋅C ⋅B ⋅A + E ⋅D ⋅C ⋅B ⋅A + E ⋅D ⋅C ⋅B ⋅A
INPUTS OUTPUT INPUTS OUTPUT
E D C B A Y E D C B A Y
0 0 0 0 0 0 1 0 0 0 0 0
0 0 0 0 1 1 1 0 0 0 1 1
0 0 0 1 0 0 1 0 0 1 0 0
0 0 0 1 1 0 1 0 0 1 1 0
0 0 1 0 0 0 1 0 1 0 0 1
0 0 1 0 1 1 1 0 1 0 1 0
0 0 1 1 0 0 1 0 1 1 0 0 D⋅A
0 0 1 1 1 0 1 0 1 1 1 0
0 1 0 0 0 1 1 1 0 0 0 0
0 1 0 0 1 0 1 1 0 0 1 0
0 1 0 1 0 0 1 1 0 1 0 0
0 1 0 1 1 0 1 1 0 1 1 0 E⋅D⋅C⋅B⋅A
0 1 1 0 0 1 1 1 1 0 0 1
0 1 1 0 1 0 1 1 1 0 1 1
0 1 1 1 0 0 1 1 1 1 0 0
0 1 1 1 1 0 1 1 1 1 1 0
Example
ECA
DCB
EDCA
(b)
“Don’t Care” Conditions
Some logic circuits can be A B C Z
designed so that there are certain
input conditions for which there 0 0 0 0
are no specified output levels, 0 0 1 0
usually because these input 0 1 0 0
conditions will never occur.
0 1 1 X
In other words, there will be
certain combinations of input 1 0 0 X
levels where we ‘’don’t care’’ 1 0 1 1
whether the output is HIGH or 1 1 0 1
LOW.
1 1 1 1
This is illustrated in the truth table
of figure (a).
C C C C
AB 0 0 AB 0 0
0 x AB 0 0
AB
1 1 AB 1 1
AB
AB 1 1
AB x 1
Z=A
(b) (c)
Whenever ‘’don’t care’’ conditions occur, we have to decide
which ones to change to 0 and which to 1 to produce the best K-
map looping (i.e., the simplest expression).
This decision is not always an easy one.
CD CD CD CD
AB
AB
AB
AB
Summary
The K-map process has several advantages over the algebraic method.
K mapping is a more orderly process with well-defined steps as compared with
the trial- and error process sometimes used in algebraic simplification.
K mapping usually requires fewer steps, especially for expressions containing
many terms, and it always produces a minimum expression.
Nevertheless, some instructors prefer the algebraic method because it requires
a thorough knowledge of Boolean algebra and is not simply a mechanical
procedure. Each method has its advantages, and though most logic designers
are adept at both, being proficient in one method is all that is necessary to
produce acceptable results.
There are other more complex techniques that designers use to minimize logic
circuits. These techniques are especially suited for circuits with large numbers
of inputs where algebraic and k-mapping methods are not feasible.
Most of these techniques can be translated into a computer program, which will
perform the minimization from input data that supply the truth table or
unsimplified expression.