Quine–McCluskey algorithm: Difference between revisions

Content deleted Content added
m Example: formatting
Line 23:
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 'd' term). The summation symbol <math>\sum</math> denotes the logical sum (logical OR, or disjunction) of all the terms being summed over.
 
===Step 1: Finding the prime implicants===
First, we write the function as a table (where 'x' stands for don't care):
:{| class="wikitable"