Every prime implicant is either essential or non-essential. A non-essential one covers only 1s that some other prime implicant also covers.
After you choose the essential prime implicants, each non-essential one falls into one of two groups:
- Redundant: all its 1s are already covered by the essentials. Leave it out. See redundant group.
- Selective: it covers some 1 that the essentials missed, but so does at least one other prime implicant. You must pick from among these, choosing the cheapest combination that covers everything.
When there is a choice, compare total cost: fewer terms first, then fewer literals. If two options tie, both are minimal, and the function has more than one correct answer.
A map where every prime implicant is non-essential is a cyclic k map.
| A\BC | 00 | 01 | 11 | 10 |
|---|---|---|---|---|
| 0 | 1m0 | 1m1 | 1m3 | 0m2 |
| 1 | 0m4 | 0m5 | 1m7 | 1m6 |