Lecture6 Karnaugh Map Pos Minimization
Lecture6 Karnaugh Map Pos Minimization
Zaki
sinaiuniversity.net
Lecture 5
Boolean Analysis of
Logic Circuits
In the last lecture, we studied the minimization of an SOP expression using a Karnaugh
map. In this lecture, we focus on POS expressions. The approaches are much the same
except that with POS expressions, 0s representing the standard sum terms are placed on
the Karnaugh map instead of 1s.
For a POS expression in standard form, a 0 is placed on the Karnaugh map for each
sum term in the expression. Each 0 is placed in a cell corresponding to the value of a
sum term. For example, for the sum term A + B + C, a 0 goes in the 010 cell on a 3-
variable map.
(A + B + C + D)(A + B + C + D)
1111 0011
The process for minimizing a POS expression is basically the same as for an SOP
expression except that you group 0s to produce minimum sum terms instead of grouping 1s
to produce minimum product terms. The rules for grouping the 0s are the same as those for
grouping the 1s that you learned in previous lecture.
Example
When all the 1s representing the standard product terms in an expression are properly
mapped and grouped, the process of determining the resulting minimum SOP expression
begins. The following rules are applied to find the minimum product terms and the
minimum SOP expression: