Karnaugh Map
Minimize a Boolean function from its minterms and don't-cares: a Gray-coded Karnaugh map plus the simplest sum-of-products expression via the Quine-McCluskey method with a minimal prime-implicant cover. Pure math, offline in your browser session.
Minimized (sum of products)
F = B'C + BC'
Karnaugh map
| A\BC | 00 | 01 | 11 | 10 |
|---|---|---|---|---|
| 0 | 0 | 1 | 0 | 1 |
| 1 | 0 | 1 | 0 | 1 |
Prime implicants
- B'C
- BC'