For SOP minimization, group one-cells and derive AND terms. For POS minimization, group zero-cells and derive OR terms that vanish on those groups. The selected terms must cover all required cells of the relevant value without covering forbidden cells.
Worked example
For F(A,B,C) = Σm(1,3,5,7), all ones have C = 1, so SOP gives F = C. The zero rows 0,2,4,6 all have C = 0. Their zero-group gives the POS term C as well. A one-literal function can belong to both forms.
What to watch for
When forming a POS term from a zero-group, a variable fixed at zero appears uncomplemented; a variable fixed at one appears complemented.
Try it yourself
What POS expression describes a function that is zero only when A = 0 and B = 0?
Answer: A + B. This OR term is zero at 00 and one at the other three input combinations.
How to study this topic
Keep the original truth table beside your simplified result. Check required ones and zeros separately, and document any don't-care assumptions. A smaller expression is useful only when it still matches the specification.
Explore related programmes
These recorded programmes are upcoming. This article is general educational content, not a syllabus or course sample.
Digital Electronics