Karnaugh Map: Solved Example
This document provides a detailed, step-by-step solved example of Boolean function
simplification using the Karnaugh Map method.
Problem Statement
Simplify the following Boolean function using the Karnaugh Map method:
F(A, B, C, D) = Σm(0, 2, 5, 7, 8, 10, 13, 15)
Where Σm represents the sum of minterms.
Step 1: Creating the Karnaugh Map
First, we need to construct a 4-variable Karnaugh Map and place the '1's in the cells
corresponding to the given minterms. The variables A and B will represent the rows, and C
and D will represent the columns. Both rows and columns will be labeled using Gray code
(00, 01, 11, 10) to ensure that adjacent cells differ by only one bit.
The minterms are:
• m0 (0000)
• m2 (0010)
• m5 (0101)
• m7 (0111)
• m8 (1000)
• m10 (1010)
• m13 (1101)
• m15 (1111)
All other cells will contain '0's.
The constructed K-map is shown below:
Step 2: Grouping the 1s
Now, we identify and group adjacent '1's in the K-map. The goal is to form the largest
possible rectangular groups whose sizes are powers of two (1, 2, 4, 8, etc.). Groups can wrap
around the edges of the map and can overlap. Each '1' must be part of at least one group.
Here are the optimal groupings for this function:
1. Octet (8 '1's): There is an octet formed by the minterms m0, m2, m8, m10, m5, m7,
m13, m15. This group covers all cells where B and D are changing, and A and C are
changing. This group simplifies to B'D' + BD. Let's re-evaluate this. An octet would
eliminate 3 variables. Looking at the K-map, there isn't a clear octet. Let's re-evaluate
the groupings based on the image generated.
Looking at the generated image kmap_solved_example_image.png :
• Group 1 (Quad): The '1's at (00,00), (00,10), (10,00), (10,10) form a quad. This
corresponds to minterms m0, m2, m8, m10. In this group, C and D change, while A and B
are 00 and 10. This group simplifies to B'D'.
• Group 2 (Quad): The '1's at (01,01), (01,11), (11,01), (11,11) form a quad. This
corresponds to minterms m5, m7, m13, m15. In this group, A and C change, while B and
D are 1 and 1. This group simplifies to BD.
Let's generate an image with these groupings highlighted.
The K-map with the identified groupings is shown below:
Step 3: Deriving the Simplified Expression
For each identified group, we derive a product term by observing which variables remain
constant within that group. Variables that change their state (from 0 to 1 or 1 to 0) within the
group are eliminated.
1. Group 1 (Four corners: m0, m2, m8, m10):
• A: Changes (0 to 1)
• B: Constant (0)
• C: Changes (0 to 1)
• D: Constant (0)
2. Group 2 (m5, m7, m13, m15):
• A: Changes (0 to 1)
• B: Constant (1)
• C: Changes (0 to 1)
• D: Constant (1)
Final Simplified Expression
By combining the simplified terms from all the groups using logical OR, we get the final
minimized Boolean expression:
F(A, B, C, D) = B ransformed{'}D ransformed{'} + BD
This simplified expression is equivalent to the original function but requires fewer logic
gates for implementation, thus optimizing the digital circuit.
