Loading a Karnaugh Map

- Writing a 1 in the squares corresponding to a min-term and a 0 in the square corresponding to the max-term.

Y = f(a, b, c) = S(0, 1, 4, 5)

à Identify logical adjacencies (groups of min-terms where only one variable changes between min-terms or groups of min-terms.

Observations

- A group of two logically adjacent min-terms eliminates a variable from the expression.

- A group of four logically adjacent min-terms eliminates two variables.

- A group of 2^K logically adjacent min-terms eliminates K variables.

Definition

- A set of 2ⁿ Karnaugh map cells are combined to form a prime implicant, if n variables of the equation being simplified have 2ⁿ permutations within the set and the remaining m-n variables have the same value within the set.

- Any single min-term or permitted group of min-terms is called implicant.

- Prime implicant is a group min-terms that cannot be combined with other min-terms or groups.