Quine–McCluskey algorithm: Difference between revisions

Revision as of 07:55, 13 February 2025

Revision as of 08:00, 13 February 2025

Line 93:

|}

At this point, one can start combining minterms with other minterms in adjacent groups; (as in, we compare minterms in nth group with (n+1)th group). So for the m4 minterm in with only one Number of 1s, we compare it to m9, m10, and m12 which have two Number of 1s.

If two terms differ by only a single digit, that digit can beis replaced with a dash indicating that the digit doesn't matter. Terms that can't be combined any more are marked with an asterisk ({{color|red|*}}). For instance <code>1000</code> and <code>1001</code> can be combined to give <code>100-</code>, indicating that both minterms imply the first digit is <code>1</code> and the next two are <code>0</code>.

:{| class="wikitable"

Line 160 ⟶ 162:

|}

Note: In this example, none of the terms in the size 4 implicants table can be combined any further. In general, this process should beis continued in sizes that are powers of 2 (sizes 8, 16 etc.) until no more terms can be combined.

===Step 2: prime implicant chart===