Minimization via K-Maps
Row A B C F(A,B,C) 0 0 0 0 0 1 0 0 1 0 2 0 1 0 1 3 0 1 1 0 4 1 0 0 0 5 1 0 1 0 6 1 1 0 1 7 1 1 1 0
A
1
0
0
0
0
00
BC
0
0
0
1
1
01
11
10
F(A,B,C) = ? m(2,6) = A’BC’ + ABC’ = BC’(A’+A) = BC’
Boolean adjacency can be used to minimize functions!
Next slide
Back to first slide
View graphic version