Karnaugh Map
A grid method for simplifying Boolean expressions by grouping adjacent terms visually.
Definition
A Karnaugh map (K-map) arranges a truth table's outputs into a grid ordered so that adjacent cells differ in exactly one input variable. Grouping adjacent 1s into rectangular blocks yields a minimal sum-of-products expression.
Don't-care conditions, input combinations that cannot occur, can be grouped either way to enlarge simplifications, often yielding markedly simpler logic. Exploiting them is a small but telling example of how domain knowledge about impossible inputs improves an implementation.
K-maps become unwieldy beyond a handful of variables, where systematic algorithms take over: the Quine-McCluskey method minimizes exactly, and heuristic tools scale to real designs. The map's lasting value is conceptual, it makes visible why adjacent terms combine, building the intuition that automated synthesis then applies at scale. Exploiting don't-care conditions during minimization is one of the clearest cases where knowing what cannot happen simplifies what must be built.
Procedure
- Place outputs in a Gray-code-ordered grid.
- Group 1s into the largest power-of-two rectangles.
- Each group becomes one simplified product term.
- Combine the terms into the minimal expression.
Why it matters
K-maps make manual minimization of small logic functions fast and reliable, reducing gate count and delay. For larger functions, algorithmic methods such as Quine-McCluskey or automated synthesis take over, but the K-map builds the intuition behind them.
Fusion connection
Minimizing control and interlock logic reduces the component count in a fusion plant's protection circuits, improving both reliability and ease of verification.