100% found this document useful (1 vote)
168 views55 pages

3.2 (1) - K Map - 3 Variable

The document discusses Karnaugh maps, which are a systematic way to minimize Boolean expressions. It involves placing the Boolean function into a K-map grid, grouping adjacent 1s to find the largest possible combinations, and extracting the simplified expression from the groupings. An example is provided to demonstrate simplifying a 3-variable Boolean function using a K-map.

Uploaded by

f2022266836
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
100% found this document useful (1 vote)
168 views55 pages

3.2 (1) - K Map - 3 Variable

The document discusses Karnaugh maps, which are a systematic way to minimize Boolean expressions. It involves placing the Boolean function into a K-map grid, grouping adjacent 1s to find the largest possible combinations, and extracting the simplified expression from the groupings. An example is provided to demonstrate simplifying a 3-variable Boolean function using a K-map.

Uploaded by

f2022266836
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 55

Digital Logic Design

2. Simplification of Boolean Function

2.1.1 K Map - 3 Variable Case

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ʹ

K-Map : Systematic way to minimize Boolean Expression

Step 1: Placing Boolean Function into K-Map

Step 2: Grouping 1’s in the K-Map

Step 3: Extract Simplified Expression from K-map


KARNAUGH MAP
Example: Simplify the following problem using K-Map

F(A, B, C) = B C + Aʹ Bʹ Cʹ +Aʹ B Cʹ

Step 1: Placing Boolean Function into K-Map:


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

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

a) Make a group as large as possible


b) Group Size:
Allowed: ( 1, 2, 4, 8, 16, . . . ) Not Allowed: ( 3, 5, 7, 9, 11, . . . )
c) Group Rules:
Allowed: Adjacent 1’s - Horizontal
Adjacent 1’s – Vertical
Not Allowed: Diagonal 1’s
d) Minimum number of groups
KARNAUGH MAP
K-Map Truth Table
1 bit change
A B C
0 1 F
0 0 0
1 1
1 0 0 1
BC
A 00 01 11 10 1 0 1 0
0 1 1
0 1 1 1
1 0 0
1 1 1 0 1
1 1 0
1 1 1
KARNAUGH MAP
K-Map Truth Table
1 bit change
Two adjacent squares can be A B C
combined to make a group 0 1 F
0 0 0
1 1
1 0 0 1
BC
A 00 01 11 10 1 0 1 0
0 1 1
0 1 1 1 A’ B
1 0 0
C
A B 1 0 1
1 1
C
1 1 0
= A’ B C + A B C 1 1 1
= B C ( A’ + A )
=BC
KARNAUGH MAP
K-Map Truth Table
A B C
0 0 F
0 0 0
1 1
0 0 0 1
BC
A 00 01 11 10 0 0 1 0
0 1 1
0 Squares in diagonal can 1 0 0
not be grouped
1 1 0 1
1 1 0
1 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) = Aʹ Cʹ Sum of Groups


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
B C

F(A, B, C) = Aʹ Cʹ + B C Sum of Groups


KARNAUGH MAP
Step 1: Placing Boolean Function into K-Map:
Method 2: Placing Function into K-Map Using Truth Table :

F(A, B, C) = B C + Aʹ Bʹ Cʹ + Aʹ B Cʹ Truth Table


A B C
F
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
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 A B C 0 1 0
- 1 1 0 1 1 0 1 1
1 1 1 1 0 0
1 0 1
1 1 0
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 A B C 0 1 0
- 1 1 0 1 1 0 1 1
1 1 1 1 1
0 0
1 0 1
1 1 0
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 A B C 0 1 0
- 1 1 0 1 1 0 1 1
1 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 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

F(A, B, C) = B C + Aʹ Bʹ Cʹ + Aʹ B Cʹ Truth Table


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 3: Extracting Result from K-Map

F(A, B, C) = B C + Aʹ Bʹ Cʹ + Aʹ B Cʹ Truth Table


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
F(A, B, C) = Aʹ Cʹ + B C
KARNAUGH MAP
CIRCUIT DIAGRAM
Before Simplification: F(A, B, C) = B C + Aʹ Bʹ Cʹ + Aʹ B Cʹ

After Simplification: F(A, B, C) = Aʹ Cʹ + B C

You might also like