K-map Examples
Example: Obtain the Boolean function using K-map:
- F(A, B, C, D) = ∑m (1,2,3,4,8,9,12,15)
- F(A, B, C, D) = πM (0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15)
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.