The XOR function’s Boolean expression is simplified via De Morgan’s theorem. The truth table below shows the expected output logic.
| A | B | F (Output) |
|---|---|---|
| 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)
The PDN consists of A·B̅ in series with A̅·B in parallel. The PUN uses series/parallel reversed logic with PMOS transistors. Inversions of A and B require two additional MOSFETs each. Total component count: 12 MOSFETs.