Petrick’s Algorithm for Selecting a Minimal Cover (Algorithm 3.6)
1. Find all prime implicants of the function to be minimized.
2. Construct a prime implicant table and identify and remove
all essential prime implicants and their corresponding rows
3. Write a POS function that contains a product term for each
minterm left in the reduced prime implicant chart that includes
a variable for each prime implicant that covers the minterm.
4. Convert the function to SOP form.
5. Select a minimal cover by finding a product term representing the
fewest prime implicants and literals.