Quine–McCluskey algorithm: Difference between revisions

Content deleted Content added
Step 1: finding prime implicants: suggest to use red color to separate "prime implicant" marker from input sequence
Line 93:
|}
 
At this point, one can start combining minterms with other minterms. If two terms differ by only a single digit, that digit can be 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 100:
|-
| rowspan="4" | 1
| m4 || {{mono|0100}} || m(4,12) || {{mono|-100 {{color|red|*}}}}
|-
| m8 || {{mono|1000}} || m(8,9) || {{mono|100-}}
Line 133:
|-
| rowspan="4" | 1
| m4 || {{mono|0100}} || m(4,12) || {{mono|-100 {{color|red|*}}}} ||colspan = "2" {{sdash}}
|-
| m8 || {{mono|1000}} || m(8,9) || {{mono|100-}} || m(8,9,10,11) || {{mono|10-- {{color|red|*}}}}
|-
| {{sdash}} || {{sdash}} || m(8,10) || {{mono|10-0}} || m(8,10,12,14) || {{mono|1--0 {{color|red|*}}}}
|-
| {{sdash}} || {{sdash}} || m(8,12) || {{mono|1-00}} ||colspan = "2" {{sdash}}
Line 144:
| m9 || {{mono|1001}} || m(9,11) || {{mono|10-1}} ||colspan = "2" {{sdash}}
|-
| m10 || {{mono|1010}} || m(10,11) || {{mono|101-}} || m(10,11,14,15) || {{mono|1-1- {{color|red|*}}}}
|-
| {{sdash}} || {{sdash}} || m(10,14) || {{mono|1-10}} ||colspan = "2" {{sdash}}