Karnaugh Map (K MAP)
A Karnaugh Map (K-Map) is a graphical method used to simplify Boolean expressions in digital logic circuits. It helps reduce complex Boolean expressions into simpler forms by grouping adjacent 1s or 0s in a specific pattern.
In a Karnaugh Map (K-Map), we group adjacent 1s or adjacent 0s, depending on the type of Boolean expression being simplified.
Groups must contain 1, 2, 4, 8, or 16 adjacent cells (powers of 2). |
A Karnaugh Map makes Boolean simplification easier than using the laws of Boolean algebra. It is commonly used in digital electronics to design simple and efficient logic circuits with fewer logic gates.
Types of Karnaugh Maps
Karnaugh Maps are classified according to the number of input variables used in a Boolean function.
- 2-Variable K-Map: Contains 4 cells and is used for Boolean functions with two input variables.
- 3-Variable K-Map: Contains 8 cells and is used for Boolean functions with three input variables.
- 4-Variable K-Map: Contains 16 cells and is used for Boolean functions with four input variables.
- 5-Variable K-Map: Contains 32 cells and is used for Boolean functions with five input variables.
- 6-Variable K-Map: Contains 64 cells and is used for Boolean functions with six input variables.
K-Maps can be designed for more than six variables, such as 7-variable and 8-variable functions. However, they become increasingly complex and difficult to simplify manually. Therefore, K-Maps are most commonly used for 2 to 4 variables, while 5- and 6-variable K-Maps are also used.
| Important:
Number of Cells = 2^n, where n represents the number of input variables. |
Karnaugh Map Simplification Rules | Grouping Cells
2-Variable K-Map
A 2-variable Karnaugh Map (K-Map) is used to simplify Boolean expressions containing two variables, A and B. It consists of 4 cells, representing all possible combinations of the two input variables.
Here is the simple structure of 2-Variable K-Map