Karnaugh maps are visual tools used to simplify Boolean expressions in digital logic design. This cheat sheet helps students organize truth table values, find efficient groups, and write simpler logic equations. It is useful for designing circuits with fewer gates, fewer inputs, and less wiring.
Students in engineering and electronics use these skills to move from logic requirements to practical circuit forms.
The most important ideas are Gray code ordering, adjacency, powers-of-two grouping, and conversion between grouped cells and simplified terms. Groups may wrap around the edges of the map because opposite edges are adjacent in a K-map. Sum of products groups 1s to make AND terms joined by OR, while product of sums groups 0s to make OR terms joined by AND.
Don't-care conditions can be used as either 0 or 1 when they help make larger groups.
Key Facts
- K-map row and column labels must use Gray code order, such as 00, 01, 11, 10, so adjacent cells differ by exactly one variable.
- A valid K-map group must contain 1, 2, 4, 8, or 16 cells, so every group size is a power of 2.
- For SOP simplification, group 1s and write one product term for each group using only variables that stay constant in the group.
- For POS simplification, group 0s and write one sum term for each group using only variables that stay constant in the group.
- A variable that changes value within a group is eliminated from the simplified term.
- K-map edges wrap around, so the left edge is adjacent to the right edge and the top edge is adjacent to the bottom edge.
- Larger groups produce simpler expressions because they eliminate more variables.
- Don't-care cells marked X may be included in a group if they help create a larger group, but they do not have to be used.
Vocabulary
- Karnaugh Map
- A grid used to simplify Boolean expressions by placing truth table outputs into Gray code order and grouping adjacent values.
- Gray Code
- A binary ordering in which each neighboring label differs by only one bit.
- Implicant
- A group of adjacent K-map cells that represents one product term or sum term in a simplified Boolean expression.
- Prime Implicant
- The largest possible implicant that cannot be combined into a bigger valid group.
- Essential Prime Implicant
- A prime implicant that covers at least one required 1 or 0 cell not covered by any other prime implicant.
- Don't-Care Condition
- An input combination whose output may be treated as 0 or 1 to help simplify a Boolean expression.
Common Mistakes to Avoid
- Using normal binary order instead of Gray code order is wrong because adjacent K-map cells must differ by only one variable.
- Making groups with 3, 5, or 6 cells is wrong because valid K-map groups must have sizes that are powers of 2.
- Forgetting wraparound adjacency is wrong because edge cells can often form larger groups across opposite sides of the map.
- Including a changing variable in a simplified term is wrong because variables that change across a group must be eliminated.
- Using every don't-care cell automatically is wrong because don't-cares should only be included when they make the final expression simpler.
Practice Questions
- 1 A 2-variable function has 1s at minterms m0 and m1. Using variables A and B, write the simplified SOP expression.
- 2 A 3-variable function has 1s at minterms m0, m2, m4, and m6. Using variables A, B, and C, write the simplified SOP expression.
- 3 A 4-variable K-map has a group of 8 cells where A stays 1 and B, C, and D all change. What simplified product term does the group represent?
- 4 Explain why Gray code ordering is required in a Karnaugh map and how using normal binary order can lead to an incorrect simplification.