Four-variable K-Map
- Sixteen cells
- Sixteen minterms(maxterm)
Simplification of Logical Functions Using K-Map
Simplification of logical functions with K-map is based on the principle of combining terms in adjacent cells. The expression for output ‘Y’ can be simplified by properly combining those cells in the K-map, which contains 1’s for SOP term or 0’s for POS form. The process for combining these 1’s and 0’s is called grouping. Groups are made up of 2, 8, 16 and so on. By folding K-map over its edges, the number of 1’s and 0’s overlapping forms the group.
A pair of adjacent 1’s in a K-map eliminates the variable that appears in the complemented and uncomplemented form.
Similarly, we can make group of quads and octets.
Algorithm:
- Draw the k-map and place 1’s in those cells corresponding to the 1’s in the truth table. Place 0’s in the other cells.
- Examine the map for adjacent 1’s and group those 1’s which are not adjacent to any other 1’s. These are called isolated 1’s.
-
Next, look for those two adjacent 1’s. Any pair containing such a 1.
- Any octet even it contains some 1’s that have already been grouped.
- Any quad containing one or more 1’s which have not already been grouped.
- group any pairs necessary to include any 1’s that have not yet been grouped making sure to use the minimum number of groups.
-
Find the OR sum of all the terms generated by each group.
Example: Simplify a four variable logic function using K map.
f(A, B, C,D)=Σm(0,1,2,4,5,6,8,9,12,13,14).
Solution:
Given, f(A, B, C,D)=Σm(0,1,2,4,5,6,8,9,12,13,14).
Step 1: draw a 16 cell map and put 1’s in such cell as given in f(A,B,C,D).
Step 2: one group of 8, 2 group of 4’s are formed.
Step 3: finally we write minimised SOP.
F=C’+A’D’+BD’
Frequently Asked Questions
-
How many maximum possible minterm and maxterm can be made with n number of variables?
With n number of variables the maximum possible minterm or maxterm is equal to 2ⁿ.
-
What is meant by equality of K-maps?
The two K-maps are said to be equal if 1’s are placed in the same position on both the maps. Thus, the logical expression is also the same
-
What is meant by complementation of K-maps?
The two K maps are said to be complemented if K-map has 1’s and another K map has 0’s on the same location.
Conclusion
This article taught us about Karnaugh Maps. We individually discussed about their structure and the steps to simplify an expression.
We hope you could easily take away all critical and conceptual techniques by walking over the given examples.
Recommended Reading - Canonical Cover In DBMS.
Now, we strongly recommend you to understand the other related concepts in boolean algebra and enhance your learning. You can get a wide range of topics similar to this on booleanalgebra
It's not the end. Learn and explore more.
568+ registered 
