Karnaugh-Map (K-Map)


Abstract the common parts.

Place minterms in a special arrangement so that simplifications can be easily performed.


  1. For each ‘1’ in the K-Map, draw the largest possible group (2, 4, 8)

  2. Using (1), take all groups that cover unique ’1’s

  3. For any remaining ’1’s (not covered by groups in (2)):

Choose the smallest collection of groups to cover all of them.

N-var kmaps

2-Variable K-Map

3-variable K-Map

4-variable K-Map

5-variable k-map

6-variable k-map

Finding POS

Find SOP for F’

Negate (1) to get POS.