Professional Documents
Culture Documents
The procedure of simplifying Boolean expressions (in 2-4) is difficult since it lacks specific rules to predict the successive steps in the simplification process. Alternative: Karnaugh Map (K-map) Method. K-map method can be seen as a pictorial form of the truth table. y0 y 1
m0 m1 m2 m3
Two-variable K-MAP
x 0 x ' y ' x' y x 1 xy' xy y 1 y 1
1 1
y0
y 1
x 0 x 1
y0
x 0
y0
x 1 1
F1 = xy
F2 = m1 + m2 + m3 = = x' y + xy'+ xy
Two-variable K-MAP
y 1 y 1
1 1
x 0
y0
x 1 1
F2 = x + y
The three squares can be determined from the intersection of variable x in the second row and variable y in the second column.
Three-Variable K-Map
How is this map useful? Any two adjacent squares differ by only one variable. From the postulates of Boolean algebra, the sum of two minterms in adjacent squares can be simplified to a simple AND term.
Three-Variable K-Map
Example 1
F = ( m2 , m3 , m4 , m5 ) = x ' yz '+ x ' yz + xy ' z '+ xy ' z = x ' y ( z + z ') + xy '( z + z ') = x ' y + xy '
Three-Variable K-Map
Example 2 Simplify: F ( x , y , z ) = (3, 4,6,7 ) m0 m4 m1 m5 m3 m7 m2 m6
yz
xz'
xz'
Three-Variable K-Map
Example 3 Simplify: F ( x , y, z ) = ( 0, 2,4 ,5, 6) m0 m4 m1 m5 m3 m7 m2 m6
Three-Variable K-Map
Example 4 Given: F ( A, B, C ) = A' C + A' B + AB ' C + BC (a) Express F in sum of minterms. (b) Find the minimal sum of products using K-Map
A' C ( B + B ' ) = A' BC + A' B ' C A' B (C + C ' ) = A' BC + A ' BC ' AB ' C BC ( A + A' ) = ABC + A' BC
(a) F ( A, B , C ) = A ' B ' C + A ' BC '+ A' BC + AB ' C + ABC
= (1, 2,3,5,7 )
Three-Variable K-Map
Example 4 (continued) m0 m4
F ( A, B, C ) = (1, 2,3,5,7)
m1 m5 m3 m7 m2 m6
Four-Variable K-Map
Four-Variable K-Map
Example 5 Simplify F(w,x,y,z) = (0,1,2,4,5,6,8,9,12,13,14)
Four-Variable K-Map
Example 6 Simplify F(A,B,C,D) = A' B ' C '+ B ' CD '+ A' BCD '+ AB ' C '
F (A ,B ,C , D) = (0,1,2,5,8,9,10)
Combining the ones: (a) F = B ' D '+ B ' C '+ A ' C ' D Combining the zeros:
F ' = AB + CD + BD '
(b) ( F ')' = F =
= ( A '+ B ')( C ' + D ')( B '+ D)