Lec-8
Lec-8
A three-variable K-map:
yz=00 yz=01 yz=11 yz=10
x=0 m0 m1 m3 m2
x=1 m4 m5 m7 m6
Where each minterm corresponds to the product
terms:
yz=00 yz=01 yz=11 yz=10
x=0 x y z xyz xyz xyz
x=1 x y z xyz xyz xyz
Note that if the binary value for an index differs in one
bit position, the minterms are adjacent on the K-Map
Chapter 2 - Part 2 1
Example Functions
By convention, we represent the minterms of F by a "1"
in the map
Example: y
0 3 2
1
1 1
F(x, y, z) m(2,3,4,5)
x 41 5
1 7 6
Example: z
y
G(a, b, c) m(3,4,6,7)
0 1 3 2
1
x 41 5 7
1 6
1
z
Chapter 2 - Part 2 2
Combining Squares
By combining squares, we reduce number of
literals in a product term, reducing the literal cost,
thereby reducing the other two cost criteria
On a 3-variable K-Map:
• One square represents a minterm with three
variables
• Two adjacent squares represent a product term with
two variables
• Four “adjacent” terms represent a product term
with one variable
• Eight “adjacent” terms is the function of all ones (no
variables) = 1.
Chapter 2 - Part 2 3
Example: Combining Squares
Example: Let y
0 1 3 2
F m(2,3,6,7) 1 1
x 4 5 7
1 6
1
z
Applying the Minimization Theorem three times:
F( x , y , z ) = x y z + x y z + x y z + x y z
= yz + y z = y
Thus the four terms that form a 2 × 2 square correspond to the
term "y".
Chapter 2 - Part 2 4