The XOR function’s Boolean expression is simplified via De Morgan’s theorem. Truth table:
| A | B | F |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 0 |
F = A ⊕ B = A̅B + A B̅ ⇒ (A̅B)̅ · (A B̅)̅ ⇒ (A + B̅) · (A̅ + B)
PDN: A·B̅ in series with A̅·B in parallel. PUN: series/parallel reversed using PMOS transistors. Inversions of A and B require two MOSFETs each. Total: 12 MOSFETs.