DE Notes
Complete guide to SOP and POS forms in Boolean algebra with conversion methods, implementation using logic gates, and step-by-step examples for digital circuit design.
SOP (Sum of Products) and POS (Product of Sums) are the two standard forms for representing Boolean expressions. Every Boolean function can be expressed in either form, and each maps directly to a specific circuit architecture.
Sum of Products (SOP)
An SOP expression is an OR of AND terms (product terms).
Structure
Each product term is an AND of literals. The terms are ORed together.
Circuit Implementation: AND-OR Network
Two-level implementation: First level AND gates, second level OR gate.
How to Get SOP from Truth Table
Write a product term for each row where output = 1:
- Variable = 1 → include uncomplemented
- Variable = 0 → include complemented
Example:
| A | B | C | F | |
|---|---|---|---|---|
| 0 | 0 | 0 | 0 | |
| 0 | 0 | 1 | 1 | → A\'B\'C |
| 0 | 1 | 0 | 1 | → A\'BC\' |
| 0 | 1 | 1 | 0 | |
| 1 | 0 | 0 | 1 | → AB\'C\' |
| 1 | 0 | 1 | 0 | |
| 1 | 1 | 0 | 0 | |
| 1 | 1 | 1 | 1 | → ABC |
SOP: F = A\'B\'C + A\'BC\' + AB\'C\' + ABC
SOP vs POS Comparison
| Feature | SOP | POS |
|---|---|---|
| Basic operation | OR of AND terms | AND of OR terms |
| Derived from | Output = 1 rows | Output = 0 rows |
| Gate structure | AND-OR (or NAND-NAND) | OR-AND (or NOR-NOR) |
| Variable in term | 0→complemented, 1→true | 1→complemented, 0→true |
| When preferred | Fewer 1s in output | Fewer 0s in output |
Converting Between SOP and POS
Method 1: Via Truth Table
- Write the truth table
- Read SOP from rows with F=1
- Read POS from rows with F=0
Method 2: Using Minterm/Maxterm Indices
If F(SOP) = Σm(1, 2, 4, 7), then F(POS) = ΠM(0, 3, 5, 6)
Simply use the indices NOT in the SOP list for POS.
Method 3: Algebraic Conversion
Convert SOP to POS:
Better approach:
Standard SOP vs Canonical SOP
| Standard SOP | Canonical SOP |
|---|---|
| Terms may have fewer variables | Every term has ALL variables |
| AB + C | A\'B\'C\' + A\'BC\' + AB\'C\' + ABC\' + ABC |
| Simpler, fewer gates | Unique representation |
| Result of simplification | Starting point for simplification |
NAND-NAND Implementation of SOP
Any SOP can be converted to all-NAND implementation:
| Step 1 | Double complement |
| Step 2 | Apply De Morgan's to inner |
| Step 3 | This is NAND of NANDs |
Circuit:
NOR-NOR Implementation of POS
Any POS can be converted to all-NOR implementation:
| Step 1 | Double complement |
| Step 2 | Apply De Morgan's to inner |
| Step 3 | This is NOR of NORs |
Worked Example: Complete Conversion
Given: F(A,B,C) = Σm(0, 2, 5, 7)
Step 1: Truth Table
| A | B | C | F | Minterm | Maxterm |
|---|---|---|---|---|---|
| 0 | 0 | 0 | 1 | m₀ | |
| 0 | 0 | 1 | 0 | M₁ | |
| 0 | 1 | 0 | 1 | m₂ | |
| 0 | 1 | 1 | 0 | M₃ | |
| 1 | 0 | 0 | 0 | M₄ | |
| 1 | 0 | 1 | 1 | m₅ | |
| 1 | 1 | 0 | 0 | M₆ | |
| 1 | 1 | 1 | 1 | m₇ |
Step 2: Canonical SOP F = A\'B\'C\' + A\'BC\' + AB\'C + ABC = Σm(0,2,5,7)
Step 3: Canonical POS F = (A+B+C\')(A+B\'+C\')(A\'+B+C)(A\'+B\'+C) = ΠM(1,3,4,6)
Step 4: Simplified SOP (using K-map) F = B\'C\' + AC (after K-map simplification — see K-map chapter)
When to Use SOP vs POS
| Scenario | Best Form | Reason |
|---|---|---|
| More 1s than 0s in output | POS | Fewer maxterms to write |
| More 0s than 1s in output | SOP | Fewer minterms to write |
| NAND gate implementation | SOP | Direct NAND-NAND mapping |
| NOR gate implementation | POS | Direct NOR-NOR mapping |
| Active-high output needed | SOP | Natural for "when output is HIGH" |
| Active-low output needed | POS | Natural for "when output is LOW" |
Interview Questions
Q1: What is the difference between SOP and POS forms?
SOP is an OR of AND terms — derived from truth table rows where output=1. POS is an AND of OR terms — derived from rows where output=0. SOP maps to AND-OR (NAND-NAND) circuits; POS maps to OR-AND (NOR-NOR) circuits.
Q2: Why can any SOP be implemented using only NAND gates?
By applying double complement and De Morgan\'s theorem: F = AB+CD = ((AB)\'·(CD)\')\' = NAND(NAND(A,B), NAND(C,D)). The first level NANDs generate complemented products, the second level NAND acts as an OR with inversion that cancels the first level\'s inversions.
Q3: When would you prefer POS over SOP?
When the function has fewer 0s than 1s in its truth table (fewer maxterms needed), when NOR gates are preferred (POS → NOR-NOR directly), or when the design requires active-low logic.
Q4: Convert F = Σm(1,3,5,7) to POS form for 3 variables.
Total minterms for 3 variables = 8 (indices 0-7). Missing indices: 0,2,4,6. So F = ΠM(0,2,4,6) = (A+B+C)(A+B\'+C)(A\'+B+C)(A\'+B\'+C). Note: This function is actually just F = C.
Q5: Is the minimized SOP always better than the minimized POS?
Not necessarily. Depending on the function, minimized POS might use fewer gates/literals than minimized SOP. You should compare both and choose the one with lower cost. For some functions, one form is significantly simpler.
Exam Focus
Revise definitions, diagrams, examples, and short-answer points for SOP and POS Forms – Sum of Products and Product of Sums.
Interview Use
Prepare one clear explanation, one practical example, and one common mistake for this Digital Electronics topic.
Search Terms
digital-electronics, digital electronics, digital, electronics, boolean, algebra, sop, and
Related Digital Electronics Topics