Karnaugh Map

Simplification of the rules of logic equations with K-map;
a. For the logical expression of n variables required K-map with 2n box. The numbering sequence is based on the code gray box.

b. Enter data from the truth table into the K-map

c. Simplification is done by combining adjacent boxes with a membership of 2m boxes and boxes formations form a rectangle (0 ≤ m ≤ n).
d. Each group in the K-map will form one tribe in the equation simplification results, and the number of variables contained in a rate depending on the number of boxes / areas within a group
e. In the K-map of n variables, a group that has a rate of 2m boxes with (nm) variables.
f. The number of groups (group) in a K-map should be minimized.
g. Number of members (box) within a group should be made as comfortable as possible

h. The process of grouping is done until all the boxes are berlogik 1 belonging to the grouping.

Do not care is a combination of input that is never used, not used in the system.
Example:
Don “t care in the K-map 3 variables (8 input color combinations but only 5 colors used)

Don ‘t care may be made logic 1 or logic 0, depending on a favorable position. At M-map d above its more profitable if berlogik 1