Digital Logic · topic
Karnaugh maps for 2 to 5 variables in Gray order, grouping rules, prime and essential prime implicants, don't-cares, minimal SOP and POS, and the Quine-McCluskey tabular method with the prime-implicant chart, row and column reduction and Petrick's method for cyclic charts.
Algebraic minimization rewrites a Boolean expression using identities until literal count, term count, or gate count drops, without changing the truth table. It is the syllabus's first minimization technique: no map drawing, no tabular covering.
A Karnaugh map (K-map) is a truth-table layout in which adjacent cells differ by one variable, so that combining minterms becomes circling power-of-two blocks of 1s. It is the standard hand method for minimizing Boolean functions of up to four variables (sometimes five or six with care).
The Quine-McCluskey (QM) method finds all prime implicants of a Boolean function by systematically combining minterms, then selects a minimum cover with a prime-implicant chart.
One-page visual sheets for this topic, in the sheet library on the store. Previews are free; the full sheets come with the subject pack.
