Digital Logic
Karnaugh Map (K-Map)
A graphical method for simplifying Boolean expressions by grouping adjacent terms in a grid.
Detailed Explanation
K-maps arrange truth table outputs in a grid where adjacent cells differ by one variable (gray code ordering). Groups of 1s (for sum-of-products) or 0s (for product-of-sums) form simplified terms. Larger groups yield simpler expressions.
K-maps work well for up to 4-6 variables. Beyond that, Quine-McCluskey algorithm or synthesis tools handle optimization. K-maps also visualize don't care conditions and identify hazards.