What is K-Map (Karnaugh’s Map)?
- K-Map is the method used to minimize and simplify the Boolean functions.
- It avoids redundant terms in the Boolean function.
- In K-Map minterms are represented by ∑m and maxterms are represented by πM.
- In K-Map the consecutive cells must have only 1-bit changes.
Why K-Map Has States in Sequence of 00, 01, 11, 10 Instead of 00, 01, 10, 11?
Boolean function minimization is an essential part of digital logic. K-Map is one of the important methods for Boolean function minimization. In this article, we will learn about why the K-Map uses sequence 00, 01, 11, 10 instead of 00, 01, 10,11. K-Map is the basic method for the Boolean function minimization which eliminates the redundant terms in the function. Let’s start our learning on K-maps and the sequence used in the K-map.