K - Mapping
Description
At this point you have the capability to apply the theorems and laws of Boolean algebra to simplify logic expressions to produce simpler and more cost effective digital logic circuits. You may have also realized that simplifying a logic expression using Boolean algebra, though not terribly complicated, is not always the most straightforward process. There isn’t always a clear starting point for applying the various theorems and laws, nor is there a definitive end in the process. Wouldn’t it be nice to have a process for simplifying logic expressions that was more straightforward, had a clearly defined beginning, middle, and end, and didn’t required you to memorize all of the Boolean theorems and laws? Well there is, and it is called Karnaugh mapping. Karnaugh mapping, or K-Mapping, is a graphical technique for simplifying logic expressions containing up to four variables. In this activity you will learn how to utilize the Karnaugh mapping technique to simplify two, three, and four variable logic expressions. Additionally, logic expressions containing don’t care conditions will be simplified using the K-Mapping process.
Conclusion Questions
1. Three advantages of K - Mapping include faster simplification, cleaner writing, and easier reading.
2. Two possible logic expressions include ABC
2. Two possible logic expressions include ABC