K-MAP

A Karnaugh map (K-map) is a pictorial method used to minimize Boolean expressions without having to use Boolean algebra theorems and equation manipulations. A K-map can be thought of as a special version of a truth table.

Using a K-map, expressions with two to four variables are easily minimized. Expressions with five to six variables are more difficult but achievable, and expressions with seven or more variables are extremely difficult (if not impossible) to minimize using a K-map.

If you might wonder, K-map provides a simple and straight-forward method of minimising Boolean expressions. With the Karnaugh map Boolean expressions having up to four and even six variables can be simplified. A Karnaugh map provides a pictorial method of grouping together expressions with common factors and therefore eliminating unwanted variables. The Karnaugh map can also be described as a special arrangement of a truth table.

Based on its history, the founder of the K-MAP is Maurice Karnaugh during the year 1953. 

The K-Map can be a little tricky to understand in some ways and may slightly seem complex to comprehend but a concentration of the mind will help you develop the ideas rapidly of what k-map is all about, how it is used and the purpose of learning this method. As for me, I found this method so fun and exciting for it plays a good role in simplifying Boolean equations. This is what I use at often times if the equation that is given to us is large or small.

During the lecture of this topic, I was paying attention to our teacher but I couldn’t concentrate well in understanding how the process of using the K-map would work. So I took the liberty of searching for a video tutorial on youtube in solving K-map in any kinds of variables, either 2, 4, and above. (K-MAP 3 Variables, K-Map Tutorial 4 Variables). After watching this video, I was able to improve my understanding of the importance of K-Map with what I learned from my teacher and what I learned on the video tutorial on youtube. 

Here is a sample of a K-MAP with a 3 Variable:

Here is also a sample of a K-Map with a 4 Variable:

To be quite precise, there are also K-Map which consists of 5 and more variables, but in most cases, the 4 variable K-Map is commonly used.

Once again, a Karnaugh map provides a pictorial method of grouping together expressions with common factors and therefore eliminating unwanted variables. The Karnaugh map can also be described as a special arrangement of a truth table. This is why K-Map is very important in solving Boolean equations.

By: Kirk Macaraeg