3.2 (1) - K Map - 3 Variable
3.2 (1) - K Map - 3 Variable
Amjad Ali
KARNAUGH MAP
A B C
A F
B Circuit F 0 0 0
C 0 1
0 1
0 0
1 0
0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 1
KARNAUGH MAP
A B C
A F
B Circuit F 0 0 0
C 0 1
0 1
0 0
1 0
0
0 1 1 0
BC 1 0 0 1
A 00 01 11 10
1 0 1 1
0 1 1 0 0
K-Map
1 1 1 1
1
KARNAUGH MAP
A B C
A F
B Circuit F 0 0 0
C 0 1
0 1
0 0
1 0
0
0 1 1 0
BC 1 0 0 1
A 00 01 11 10
1 0 1 1
0 1 1 1 0 0
K-Map
1 1 1 1
1 1 1 1
KARNAUGH MAP
Example: Simplify the following problem using K-Map
F(A, B, C) = B C + Aʹ Bʹ Cʹ +Aʹ B Cʹ
KARNAUGH MAP
Example: Simplify the following problem using K-Map
F(A, B, C) = B C + Aʹ Bʹ Cʹ +Aʹ B Cʹ
F(A, B, C) = B C + Aʹ Bʹ Cʹ +Aʹ B Cʹ
F(A, B, C) = B C + Aʹ Bʹ Cʹ +Aʹ B Cʹ
BC
A 00 01 11 10
1
KARNAUGH MAP
Step 1: Placing Boolean Function into K-Map:
B=1
F(A, B, C) = B C + Aʹ Bʹ Cʹ +Aʹ B Cʹ Bʹ=0
BC
A 00 01 11 10
A B C A B C
- 1 1 0 1 1
0
1 1 1
1
KARNAUGH MAP
Step 1: Placing Boolean Function into K-Map:
F(A, B, C) = B C + Aʹ Bʹ Cʹ +Aʹ B Cʹ
BC
A 00 01 11 10
A B C
0 1 1
0
1 1 1
1
KARNAUGH MAP
Step 1: Placing Boolean Function into K-Map:
F(A, B, C) = B C + Aʹ Bʹ Cʹ +Aʹ B Cʹ
BC
A 00 01 11 10
A B C
0 1 1
0
1 1 1
1
KARNAUGH MAP
Step 1: Placing Boolean Function into K-Map:
F(A, B, C) = B C + Aʹ Bʹ Cʹ +Aʹ B Cʹ
BC
A 00 01 11 10
A B C
0 1 1
0 1
1 1 1
1 1
KARNAUGH MAP
Step 1: Placing Boolean Function into K-Map:
F(A, B, C) = B C + Aʹ Bʹ Cʹ +Aʹ B Cʹ
BC
A 00 01 11 10
0 1
1 1
KARNAUGH MAP
Step 1: Placing Boolean Function into K-Map:
F(A, B, C) = B C + Aʹ Bʹ Cʹ +Aʹ B Cʹ
BC
A 00 01 11 10
Aʹ Bʹ Cʹ
1 0 0 0
0
1 1
KARNAUGH MAP
Step 1: Placing Boolean Function into K-Map:
F(A, B, C) = B C + Aʹ Bʹ Cʹ +Aʹ B Cʹ
BC
A 00 01 11 10
Aʹ Bʹ Cʹ
1 0 0 0
0
1 1
KARNAUGH MAP
Step 1: Placing Boolean Function into K-Map:
F(A, B, C) = B C + Aʹ Bʹ Cʹ +Aʹ B Cʹ
BC
A 00 01 11 10
Aʹ Bʹ Cʹ
1 0 0 0
0
1 1
KARNAUGH MAP
Step 1: Placing Boolean Function into K-Map:
F(A, B, C) = B C + Aʹ Bʹ Cʹ +Aʹ B Cʹ
BC
A 00 01 11 10
Aʹ Bʹ Cʹ
1 1 0 0 0
0
1 1
KARNAUGH MAP
Step 1: Placing Boolean Function into K-Map:
F(A, B, C) = B C + Aʹ Bʹ Cʹ +Aʹ B Cʹ
BC
A 00 01 11 10
0 1 1
1 1
KARNAUGH MAP
Step 1: Placing Boolean Function into K-Map:
F(A, B, C) = B C + Aʹ Bʹ Cʹ +Aʹ B Cʹ
BC
A 00 01 11 10
Aʹ B Cʹ
1 1 0 1 0
0
1 1
KARNAUGH MAP
Step 1: Placing Boolean Function into K-Map:
F(A, B, C) = B C + Aʹ Bʹ Cʹ +Aʹ B Cʹ
BC
A 00 01 11 10
Aʹ B Cʹ
1 1 0 1 0
0
1 1
KARNAUGH MAP
Step 1: Placing Boolean Function into K-Map:
F(A, B, C) = B C + Aʹ Bʹ Cʹ +Aʹ B Cʹ
BC
A 00 01 11 10
Aʹ B Cʹ
1 1 0 1 0
0
1 1
KARNAUGH MAP
Step 1: Placing Boolean Function into K-Map:
F(A, B, C) = B C + Aʹ Bʹ Cʹ +Aʹ B Cʹ
BC
A 00 01 11 10
Aʹ B Cʹ
1 1 1 0 1 0
0
1 1
KARNAUGH MAP
Step 2: Make grouping of 1’s in the Map
F(A, B, C) = B C + Aʹ Bʹ Cʹ + Aʹ B Cʹ
BC
A 00 01 11 10
0 1 1 1
1 1
KARNAUGH MAP
Step 2: Make grouping of 1’s in the Map
a) Make a group as large as possible
F(A, B, C) = B C + Aʹ Bʹ Cʹ + Aʹ B b)
CʹGroup Size:
( 1, 2, 4, 8, 16, . . . )
BC
00 01 11 10 c) Group Rules:
A
Allowed: Adjacent 1’s - Horizontal
0 1 1 1
Adjacent 1’s – Vertical
1 1
Not Allowed: Diagonal 1’s
d) Minimum number of groups
KARNAUGH MAP
Step 2: Make grouping of 1’s in the Map
a) Make a group as large as possible
F(A, B, C) = B C + Aʹ Bʹ Cʹ + Aʹ B Cʹ
b) Group Size:
Grouping: Option 2
( 1, 2, 4, 8, 16, . . . )
BC
00 01 11 10 c) Group Rules:
A
Allowed: Adjacent 1’s - Horizontal
0 1 1 1
Adjacent 1’s – Vertical
1 1
Not Allowed: Diagonal 1’s
d) Minimum number of groups
KARNAUGH MAP
Step 2: Make grouping of 1’s in the Map
a) Make a group as large as possible
F(A, B, C) = B C + Aʹ Bʹ Cʹ + Aʹ B Cʹ
b) Group Size:
Grouping: Option 2
Redundant Group ( 1, 2, 4, 8, 16, . . . )
BC
00 01 11 10 c) Group Rules:
A
Allowed: Adjacent 1’s - Horizontal
0 1 1 1
Adjacent 1’s – Vertical
1 1
Not Allowed: Diagonal 1’s
d) Minimum number of groups
KARNAUGH MAP
Step 2: Make grouping of 1’s in the Map
F(A, B, C) = B C + Aʹ Bʹ Cʹ + Aʹ B Cʹ
BC
A 00 01 11 10
0 1 1 1
1 1
KARNAUGH MAP
Step 3: Extract Simplified Boolean Function from the K-Map
F(A, B, C) = B C + Aʹ Bʹ Cʹ + Aʹ B Cʹ
BC
A 00 01 11 10
0 1 1 1
1 1
KARNAUGH MAP
Step 3: Extract Simplified Boolean Function from the K-Map
F(A, B, C) = B C + Aʹ Bʹ Cʹ + Aʹ B Cʹ
BC
A 00 01 11 10
0 1 1 1
1 1
F(A, B, C) =
KARNAUGH MAP
Step 3: Extract Simplified Boolean Function from the K-Map
F(A, B, C) = B C + Aʹ Bʹ Cʹ + Aʹ B Cʹ
BC
A 00 01 11 10
A B C
0 0 0
0 1 1 1
0 1 0
1 1
F(A, B, C) =
KARNAUGH MAP
Step 3: Extract Simplified Boolean Function from the K-Map
F(A, B, C) = B C + Aʹ Bʹ Cʹ + Aʹ B Cʹ
BC
A 00 01 11 10
A B C
0 0 0
0 1 1 1
0 1 0
1 1
F(A, B, C) =
KARNAUGH MAP
Step 3: Extract Simplified Boolean Function from the K-Map
F(A, B, C) = B C + Aʹ Bʹ Cʹ + Aʹ B Cʹ
BC
A 00 01 11 10
A B C
0 0 0
0 1 1 1
0 1 0
1 1
A B C
Aʹ Cʹ
0 - 0
F(A, B, C) =
KARNAUGH MAP
Step 3: Extract Simplified Boolean Function from the K-Map
F(A, B, C) = B C + Aʹ Bʹ Cʹ + Aʹ B Cʹ
BC
A 00 01 11 10
A B C
0 0 0
0 1 1 1
0 1 0
1 1
A B C
Aʹ Cʹ
0 - 0
F(A, B, C) = Aʹ Cʹ
KARNAUGH MAP
Step 3: Extract Simplified Boolean Function from the K-Map
F(A, B, C) = B C + Aʹ Bʹ Cʹ + Aʹ B Cʹ
BC
A 00 01 11 10
0 1 1 1
1 1
F(A, B, C) = Aʹ Cʹ
KARNAUGH MAP
Step 3: Extract Simplified Boolean Function from the K-Map
F(A, B, C) = B C + Aʹ Bʹ Cʹ + Aʹ B Cʹ
BC
A 00 01 11 10
A B C
0 1 1
0 1 1 1
1 1 1
1 1
F(A, B, C) = Aʹ Cʹ
KARNAUGH MAP
Step 3: Extract Simplified Boolean Function from the K-Map
F(A, B, C) = B C + Aʹ Bʹ Cʹ + Aʹ B Cʹ
BC
A 00 01 11 10
A B C
0 1 1
0 1 1 1
1 1 1
1 1 A B C
- 1 1 B C
F(A, B, C) = B C + Aʹ Bʹ Cʹ + Aʹ B Cʹ
BC
A 00 01 11 10
0 1 1 1
1 1
B C
1 1 1 1
KARNAUGH MAP
Step 1: Placing Boolean Function into K-Map Using Truth Table :
Truth Table
F(A, B, C) = B C + Aʹ Bʹ Cʹ + Aʹ B Cʹ A B C
F
0 0 0
0 0 1
Aʹ Bʹ Cʹ 0 1 0
0 0 0 0 1 1
1 1
0 0
1 0 1
1 1 0
1 1 1 1
KARNAUGH MAP
Step 1: Placing Boolean Function into K-Map Using Truth Table :
Truth Table
F(A, B, C) = B C + Aʹ Bʹ Cʹ + Aʹ B Cʹ A B C
F
0 0 0
0
1 0 1
Aʹ Bʹ Cʹ 0 1 0
0 0 0 0 1 1
1 1
0 0
1 0 1
1 1 0
1 1 1 1
KARNAUGH MAP
Step 1: Placing Boolean Function into K-Map Using Truth Table :
Truth Table
F(A, B, C) = B C + Aʹ Bʹ Cʹ + Aʹ B Cʹ A B C
F
0 0 0
0
1 0 1
Aʹ B Cʹ 0 1 0
0 1 0 0 1 1
1 1
0 0
1 0 1
1 1 0
1 1 1 1
KARNAUGH MAP
Step 1: Placing Boolean Function into K-Map Using Truth Table :
Truth Table
F(A, B, C) = B C + Aʹ Bʹ Cʹ + Aʹ B Cʹ A B C
F
0 0 0
0
1 0 1
Aʹ B Cʹ 0 1 0 1
0 1 0 0 1 1
1 1
0 0
1 0 1
1 1 0
1 1 1 1
KARNAUGH MAP
Step 1: Placing Boolean Function into K-Map Using Truth Table :
Truth Table
F(A, B, C) = B C + Aʹ Bʹ Cʹ + Aʹ B Cʹ A B C
F
0 0 0
0
1 0 1
0 1 0 1
0 1 1
1 1
0 0
1 0 1
1 1 0
1 1 1 1
KARNAUGH MAP
Step 1: Placing Boolean Function into K-Map Using Truth Table :
Truth Table
F(A, B, C) = B C + Aʹ Bʹ Cʹ + Aʹ B Cʹ A B C
F
0 0 0
1
0 0 1 0
0 1 0 1
0 1 1
1
1 0 0 0
1 0 1 0
1 1 0 0
1 1 1 1
KARNAUGH MAP
Step 1: Placing Boolean Function into K-Map Using Truth Table :
Truth Table
F(A, B, C) = B C + Aʹ Bʹ Cʹ + Aʹ B Cʹ A B C
F
0 0 0
BC 1
0 0 1 0
A 00 01 11 10
0 1 0 1
0 1 1
0 1 1 1
1
1 0 0 0
1 1 1 0 1 0
1 1 0 0
1 1 1 1
KARNAUGH MAP
Step 2: Grouping