Algorithm 3.2 -- Generating and SelectingPrime Implicants (Revisited)

1. Circle all prime implicants on the K-map.

2. Identify and select all essential prime implicants for the cover.

3. Select a minimum subset of the remaining prime implicants to complete the cover, that is, to cover those minterms not covered by the essential prime implicants.

Previous slide

Next slide

Back to first slide

View graphic version