K-Map or Karnaugh Map is a graphical method of simplifying Boolean expression. A K-Map composed of an arrangement of adjacent squares or cells, where each cell represent a particular combination of variables in sum or product form.

In the K-map method, there is a useful condition namely, Dont Care Condition, which helps in simplifying a Boolean function. The dont care condition makes the grouping of variables in K-map easy. In this tutorial, we will understand the "dont care" concept in K-map reduction with the help of solved examples.

Sometimes, in a Boolean expression for certain input combinations, the value of the output is not specified either due to invalid input combinations or due to the precise value of output is of no importance. These input combinations for which the values of the Boolean function are not specified are called dont care combinations. Dont care combinations are also referred to as optional combinations. In K-map, dont care combinations are represented by "X" or "d" or "".

For example, in 8421 binary code, the binary combination 1010, 1011, 1100, 1101, 1110, and 1111 are the invalid terms and their corresponding outputs are dont care combinations. Similarly, in Excess-3 code, the combinations 0000, 0001, 0010, 1101, 1110, and 1111 do not occur, hence these are called dont care combinations.

When we deal with SOP (Sum of Products) K-map, each dont care term is treated as a 1, if it helps in reduction of the expression, otherwise it is considered as a 0 and left alone.

On the other hand, when we are using POS (Product of Sums) K-map, each dont care term is considered as a 0, if it is helpful in reduction of the expression, otherwise it is treated as a 1 and left alone.

Also, we can convert a Standard Sum of Products (SSOP) expression with dont care terms into a Standard Product of Sums (SPOS) expression by keeping the dont care terms as they are, and writing the missing minterms of the SSOP form as the maxterms of the SPOS form.

Similarly, we can convert a standard product of sums (SPOS) expression with dont care terms into a standard sum of products (SSOP) expression by keeping the dont care terms of the SPOS expression as they are, and writing the missing maxterms of the SPOS expression as the minterms of the SSOP expression.

Now, let us discuss some solved examples to understand the dont care condition in K-map.

Example 1

Minimize the following 4-variable Boolean expression in SOP form using K-map.

$$\mathrm{\mathit{f}\lgroup A,B,C,D\rgroup=\sum m \lgroup 0,1,4,5,6,10,13\rgroup +d \lgroup 2,3 \rgroup}$$

Solution

The SOP K-map representation of the given Boolean function is shown in Figure 1.

As we can see in the given expression, there are two dont care terms which are denoted by X on the K-map.

Explanation

The reduction of the expression is done as per the following steps −

The minterms m₀, m₁, m₄ and m₅ form a 4-square. Make it and read it as $\mathrm{\lgroup \bar{A} \: \bar{C}\rgroup}$.
The minterms m₁₀ and m₁₁ form a 4-sqaure with two dont care terms m₂ and m₃. Make it and read it as $\mathrm{\bar{B}C}$.
The minterms m₀, m₄, m₆ and the dont care term m₂ together form a 4-square. Make it and read it as $\mathrm{\bar{A} \: \bar{D}}$.
The minterms m₅ and m₁₃ form a 2-square. Make it and read it as $\mathrm{B\bar{C}D}$.
Finally, write all the product terms in SOP form.

Therefore, the minimal Boolean expression is,

$$\mathrm{\mathit{f} \lgroup A,B,C,D \rgroup \: = \: \bar{A} \: \bar{C} \: + \: \bar{B}C \: + \: \bar{A} \: \bar{D} \: + \: B \bar{C}D}$$

Example 2

Minimize the following 4-variable Boolean expression in POS form using K map.

$$\mathrm{\mathit{f} \lgroup A,B,C,D \rgroup \: = \: \prod M \lgroup 1,5,6,12,13,14 \rgroup \: + \: d \lgroup 2,4 \rgroup}$$

Solution

The POS K-map representation of the given Boolean function is shown in Figure-2.

There are two dont care terms in the expression which are represented by X on the K-map.

Explanation

The reduction of the given function is done as per the following steps −

The maxterms M₅, M₁₂ and M₁₃ and dont care term M₄ form a 4-square. Make it and read it as $\mathrm{\bar{B} \: + \: C}$.
The maxterms M₆, M₁₂, and M₁₄ and dont care term M₄ form a 4-square. Make it and read it as $\mathrm{\bar{B} \: + \: D}$.
The maxterms M₁ and M₅ form a 2-square. Make it and read it as $\mathrm{A \: + \: C \: + \: \bar{D}}$
Write all the sum terms in POS form.

Therefore, the minimal Boolean expression is,

$$\mathrm{\mathit{f} \lgroup A,B,C,D \rgroup \: = \: \lgroup \bar{B} \: + \: C \rgroup \: + \: \lgroup \bar{B} \: + \: D \rgroup \: + \: \lgroup A \: + \: C \: + \: \bar{D} \rgroup}$$

Conclusion

This is all about dont care conditions in K-maps. As we discussed in the above sections of this tutorial, that the dont care condition is a significant and powerful concept that helps in minimization of Boolean function using K-map.

Save or share this article