Quine–McCluskey algorithm: Difference between revisions

Revision as of 16:04, 16 July 2022

Revision as of 23:35, 19 July 2022

Line 166:

None of the terms can be combined any further than this, so at this point we construct an essential prime implicant table. Along the side goes the prime implicants that have just been generated (these are the ones that have been marked with a "{{color|red|*}}" in the previous step), and along the top go the minterms specified earlier. The don't care terms are not placed on top—they are omitted from this section because they are not necessary inputs.

:{| class="wikitable" {{ts|ac}}style="text-align:center;"

|-

! || 4 || 8 || 10 || 11 || 12 || 15 || ⇒ || A || B || C || D

|-

| {{ts|al}}style="text-align:left;" | m(4,12) || {{Ya|✓}} || || || || {{Ya|✓}} || || ⇒ || {{sdash}} || 1 || 0 || 0

|-

| {{ts|al}}style="text-align:left;" | m(8,9,10,11) || || {{Ya|✓}} || {{Ya|✓}} || {{Ya|✓}} || || || ⇒ || 1 || 0 || {{sdash}} || {{sdash}}

|-

| {{ts|al}}style="text-align:left;" | m(8,10,12,14) || || {{Ya|✓}} || {{Ya|✓}} || || {{Ya|✓}} || || ⇒ || 1 || {{sdash}} || {{sdash}} || 0

|-

| {{ts|al}}style="text-align:left;" | m(10,11,14,15) || || || {{Ya|✓}} || {{Ya|✓}} || || {{Ya|✓}} || ⇒ || 1 || {{sdash}} || 1 || {{sdash}}

|}