
144 CHAPTER 4 / LOGIC FUNCTION REPRESENTATION AND MINIMIZATION
FIGURE 4.13
(a) K-map for the reduced SOP function in Eq. (4.19). (b) K-map showing minimum SOP cover for
the function F. (c) K-map showing minimum POS cover for the function F.
which is saying “all that is NOT (B
¯
C
¯
D +ABC +
¯
BCD)” as indicated in Fig. 4.13c. The gate
tally for Eq. (4.21) is four, including the final ANDing of s-terms, which is less than the
original function in Eq. (4.19). Canonical minterm and maxterm representations are easily
determined by reading the 1’s and 0’s in the K-maps of Fig. 4.13 to give
F =
m(0, 1, 2, 5, 6, 7, 8, 9, 10, 13)
=
M(3, 4, 11, 12, 14, 15). (4.22)