So far, we’ve explored how logical functions can be simplified and how the cost metric helps us evaluate and compare different implementations. We then introduced Gray codes—not as an isolated concept, but as a foundational tool that plays a critical role in our next simplification technique: Karnaugh maps. Their structured, single-bit transitions make them ideal for organizing K-map cells and ensuring adjacency, which is essential for effective minimization.
What are K-maps?
A Karnaugh map, or K-map, is a visual tool for representing a Boolean function using its minterms arranged in a tabular format. Each cell in the map corresponds to a unique minterm, and the total number of cells equals the number of possible input combinations, which is \(\mathsf{2^n}\) for an \(\mathsf{n}\)-variable function. For example, a 2-variable K-map contains 4 cells; 3-, 4-, and 5-variable functions require 8, 16, and 32 cells respectively. This structure allows adjacent cells to differ by only one bit—thanks to Gray code ordering—making it easier to identify and group terms for simplification.
Minterms Ordering within a K-map
K-map Labeling Uses Gray Code Ordering, Not Gray Values!
In Karnaugh maps, the cell labels reflect the binary values of input combinations—not their Gray code equivalents. Although the sequence \(\mathsf{00,01,11,10}\) follows Gray code ordering to ensure only one-bit changes between adjacent cells, these labels still represent standard binary inputs. As a result, they correspond to minterms \(\mathsf{m_0,m_1,m_3}\), and \(\mathsf{m_2}\) respectively, based on their actual binary values—not their positions in the Gray code sequence.
In the sections that follow, we’ll explore how to construct and solve K-maps for 2, 3, 4, and 5 variables—followed by illustrative examples for each.
Each page covers the layout of that specific type of K‑map, including labeling methods, placement of minterms within cells, cell adjacencies, and step‑by‑step procedures for solving functions using K‑maps and minterms, with worked examples for constructing and applying them to various problems. The Frequently Asked Questions section also explains how to find the complement of a function using K‑maps and minterms, as well as an alternative simplification method with maxterms, and how to derive a function’s complement from a maxterm‑based K‑map. Where relevant, non‑standard layouts are presented to highlight potential challenges and help users become familiar with their quirks.