Forming Minimum Sum-of-Products from K-Map

Step 1:

Choose an element of ON-set not already covered by an implicant

Step 2:

Find "maximal" groupings of 1's and X's adjacent to that element.

Remember to consider top/bottom row, left/right column,

adjacencies. (always a power of 2 number of elements).

Repeat Steps 1 and 2 to find all prime implicants

Step 3:

Revist the 1's elements in the K-map. If covered by single prime

implicant, it is essential, and participates in final cover. The 1's it

covers do not need to be revisited

Step 4:

If there remain 1's not covered by essential prime implicants, then

select the smallest number of prime implicants that cover the

remaining 1's

Previous slide

Back to first slide

View graphic version