Click cells to toggle: 0 → 1 → X → 0
A Karnaugh Map (K-map) is a graphical tool used in digital logic design to simplify Boolean algebra expressions. It arranges truth table values in a Gray code grid, enabling variable elimination through grouping adjacent cells to produce minimal Sum-of-Products (SOP) or Product-of-Sums (POS) expressions.
1. Select the number of variables (2/3/4)
2. Click K-map cells to set values to 0, 1, or X
3. Click "Solve" to generate minimal expressions
Digital Circuit Design: Simplify combinational logic to reduce gate count. 4-variable K-maps handle most common combinational logic problems.
Computer Architecture: Learn Boolean algebra simplification and logic optimization principles.
EDA Verification: Manually verify EDA tool simplification results for correctness.
A graphical method for simplifying Boolean expressions by arranging truth table values in a Gray code grid and grouping adjacent cells to eliminate redundant variables.
Typically 2-6 variables. This tool supports 2-4. Beyond 6 variables, use the Quine-McCluskey algorithm.
SOP groups 1s (e.g., AB+AC). POS groups 0s (e.g., (A+B)(A+C)). Both are equivalent; SOP is more commonly used.
Don't cares (X) are outputs that can be 0 or 1. They can be flexibly used during simplification to achieve a simpler expression.
Gray code ensures adjacent cells differ by exactly one variable, enabling variable elimination through grouping.
Groups must contain 2^n adjacent 1s, be as large as possible, use as few groups as possible, and every 1 must be covered. Edge wrap-around counts as adjacent.