Revision as of 09:16, 19 April 2022 edit 2409:4072:6d87:b118:1d25:17ce:6baa:80db (talk) →Step 1: finding prime implicants ← Previous edit		Revision as of 09:59, 11 May 2022 edit undo Aster.asteraceae (talk \| contribs) 49 edits m →Input: Change 'd' by 'x' for don't care value Tags: Reverted Visual edit Next edit →
Line 21: :<math>f(A,B,C,D) =\sum m(4,8,10,11,12,15) + d(9,14). \,</math> This expression says that the output function f will be 1 for the minterms <math>4,8,10,11,12</math> and <math>15</math> (denoted by the 'm' term) and that we don't care about the output for <math>9</math> and <math>14</math> combinations (denoted by the 'dx' term). ===Step 1: finding prime implicants===

Quine–McCluskey algorithm: Difference between revisions