Foundations — Don't-care conditions in K-maps

This page assumes you have seen nothing. We build every letter, symbol and picture the parent note leans on, one brick at a time, each brick resting on the one before it.

1. A bit, and the symbols $0$ and $1$

Everything downstream is built from bits. When we write $A$, $B$, $C$, $D$ later, each is just a switch that is either off ($0$) or on ($1$).

Why we need it: a logic circuit has wires, and every wire carries a bit. To talk about circuits at all, we must first agree that a signal is one of exactly two values.

2. Input variables $A,B,C,D$ and what "a combination" means

If you have $n$ variables, the number of different input combinations is $2^n$ (each variable independently on/off).

• $2$ variables ($A,B$) → $2^2=4$ combinations.
• $3$ variables ($A,B,C$) → $2^3=8$ combinations.
• $4$ variables ($A,B,C,D$) → $2^4=16$ combinations.

Why we need it: the parent note's 4-variable BCD example has exactly $16$ rows — that is $2^4$. Knowing this number tells you how many squares your K-map must have.

3. The overbar $\bar{A}$ — the NOT operation

Picture a switch and its shadow-switch wired to always be opposite: flip one, the other flips too.

Why we need it: a term like $A\bar{B}$ means "$A$ is on AND $B$ is off". Without the bar you could only talk about wires being on. The bar lets you also say "this wire must be off".

4. AND ($\cdot$) and OR ($+$): the two glue symbols

Why we need it: the final answer $F=A+BC+BD$ in the parent note is built entirely from AND (inside each term) and OR (joining the terms). You cannot read that line without these two symbols.

5. Product term, literal, and "SOP"

Why we need it: the parent note's goal — "minimise the number of literals/terms" — is meaningless until you know what a literal and a term are. This is the quantity a K-map minimises. See Sum of Products (SOP) and Product of Sums (POS).

6. The truth table and the function $F$

Why we need it: the K-map is nothing but a truth table folded into a grid. If you can't read a truth table, the grid is just squares.

7. Minterm and the $\sum m(\dots )$ notation

Example with $ABCD$: the combination $A=1,B=0,C=0,D=1$ reads as binary $1001=9$. So this row is "minterm $9$".

Why we need it: the parent note writes "Minterms where $F=1$: $5,6,7,8,9$" and "$F(A,B,C)=\sum m(1,3,7)$". Those numbers are minterms — you must be able to turn a number into its bit pattern and back.

8. The don't-care symbol $X$ and $\sum d(\dots )$

Why we need it: this is the entire subject of the parent note. Row $5$ above is not $0$ and not $1$ — it is $X$, a wildcard you paint to make bigger groups. See BCD - Binary Coded Decimal for where these come from naturally.

9. Gray-code ordering — why K-map columns go $00,01,11,10$

Compare ordinary counting $00,01,10,11$: going $01\to 10$ flips two bits at once. That is forbidden in a K-map.

Why we need it: the parent note's tables have headers "$00011110$". If you assume normal binary order you will draw wrong groups. See Karnaugh Maps (K-maps).

10. Grouping, "power-of-two", and dropping a variable

Why we need it: "make a bigger group → drop a variable → fewer literals" is the mechanism the whole topic exploits. Don't-cares help only because painting an $X$ as $1$ can let a group double in size.

See Boolean Simplification for the algebra behind cancelling, and Quine-McCluskey Method for the same idea done as a table instead of a picture.

Prerequisite map

Every arrow means "you need the left box before the right box makes sense." The topic sits at the bottom because it uses all of them at once. Return to the parent: Don't-care conditions in K-maps (index 3.1.12).

Equipment checklist

Read each question, answer in your head, then reveal.