CSCI 255, ENGR 274, ECE 212 -- 12 September, 2000
Announcements
Quine-McCluskey Minimization
- Find the prime implicants
- List the on-set and don-t care set in column 1
- Generate column i+1 from column i
- Combine pairs of column i that agree on all don't care's and
disagree on only one 0/1 pair
- Replace the 0/1 pair with a don't care and add this new element into
column i+1
- Check off every paired element of column i
- Unchecked elements are the prime implicants
- Find the essential prime implicants
- Use a matrix indexed by on-set elements and prime implicants
- If any implicants remain, the hard work starts
Quine-McCluskey Example
- F(A,B,C,D) = Σ(0,1,8,10,13,14) + d(3,9,11,12)