Information AboutQuine-mccluskey Algorithm |
|
The method involves two steps: #Finding all Prime Implicants of the function. #Using those prime implicants, in a ''prime implicant chart'' to find the Essential Prime Implicants of the function, as well as using other prime implicants that are necessary to cover the function. COMPLEXITY
EXAMPLE Step 1: finding prime implicants Minimizing an arbitrary function: f A B C D f m0 0 0 0 0 0 m1 0 0 0 1 0 m2 0 0 1 0 0 m3 0 0 1 1 0 m4 0 1 0 0 1 m5 0 1 0 1 0 m6 0 1 1 0 0 m7 0 1 1 1 0 m8 1 0 0 0 1 m9 1 0 0 1 1 m10 1 0 1 0 1 m11 1 0 1 1 1 m12 1 1 0 0 1 m13 1 1 0 1 0 m14 1 1 1 0 1 m15 1 1 1 1 1 One can easily form the canonical Sum Of Products expression from this table, simply by summing the Minterm s where the function evaluates to one: Of course, that's certainly not minimal. So to optimize, all minterms that evaluate to one are first placed in a minterm table: Number of 1s Minterm Binary Representation 1 m4 0100 m8 1000 2 m9 1001 m10 1010 m12 1100 3 m11 1011 m14 1110 4 m15 1111
| ||
| { Border | "1" cellpadding="3" |
|
|