Scribd
Upload
35 views

Chap 5. Karnaugh Maps

The document discusses Karnaugh maps, which are a method for simplifying Boolean functions and minimizing logic circuits. Karnaugh maps allow plotting of minterms in a two-dimensional grid based on variable assignments. Adjacent minterms can be combined to find prime implicants and minimum covers. Examples show how to use 2, 3, 4, 5, and 6 variable Karnaugh maps to find minimum sum of products expressions. Essential prime implicants that participate in all covers are identified. Don't cares can also be incorporated into the maps. Homework problems are listed at the end.

Uploaded by

riddler_007
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
35 views

Chap 5. Karnaugh Maps

The document discusses Karnaugh maps, which are a method for simplifying Boolean functions and minimizing logic circuits. Karnaugh maps allow plotting of minterms in a two-dimensional grid based on variable assignments. Adjacent minterms can be combined to find prime implicants and minimum covers. Examples show how to use 2, 3, 4, 5, and 6 variable Karnaugh maps to find minimum sum of products expressions. Essential prime implicants that participate in all covers are identified. Don't cares can also be incorporated into the maps. Homework problems are listed at the end.

Uploaded by

riddler_007
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 22

Chap 5. Karnaugh Maps Chap 5.

Karnaugh Maps
A method to simplify Boolean function: Faster, simpler & optimum solution.

Minimum Number of Terms. Minimum Number of Literals. Minimum Number of Terms. Minimum Number of Literals. Minimum Sum of Products Minimum Sum of Products

F = a'b'c' + a'b'c + a'bc' + ab'c + abc'+ abc = Fm(0,1, 2, 5, 6, 7) = a'b' + b'c + bc' + ab = a'b' + bc' + ac
1

Minimum Number of Factors. Minimum Number of Factors. Minimum Number of Literals. Minimum Number of Literals. Minimum Product of Sums Minimum Product of Sums

Ex. F=(A+B '+C+D ')(A+B '+C '+D ')(A+B '+C '+D)(A '+B '+C '+D)(A+B+C '+D)(A '+B+C '+D) =(A+B '+D ')(A+B '+C ')(B '+C '+D)(B+C '+D) =(A+B '+D ')(A+B '+C ')(C '+D) =(A+B '+D ')(C '+D)

Eliminated by consensus Theorem


2

2-3-variableKarnaugh Maps 2-3-variable Karnaugh Maps

A B 0 0 A=0, B=0 1 A=1, B=0 A=1, B=1

A B F 0 0 1 1 0 1 0 1 1 1 0

A B 0 A'B' 1 A'B 0 1 m0 1 m1

A' 1

1 A=0, B=1

0 m2 0 m3

A=1, B=0 A=1, B=1

F = A ' B ' + A ' B = A ' (B + B ' ) = A '

uniting

theorem

Example 1: Example 1:
A B C 0 0 0 0 1 1 1 1 0 0 1 1 0 0 1 1 0 1 0 1 0 1 0 1 F 0 0 1 1 0 0 1 0
01 11 10 bc 00 a 0 m0 000 m1 001 m3 011 m2 010 1 m4 100 m5 101 m7 111 m6 110

Why?

A BC 00 ABC=001, F=0 01 11 10 A'B 0 1 1 0 0 1 BC' ABC=110, F=1 0 0 1 0

F = m(2 , 3 , 6 ) = A ' BC ' + A ' BC + ABC' = A ' B + BC '


4

Example 2: Example 2:
a bc 00 01 11 10 0 m0 m1 m3 m2 1 m4 m5
a'c
bc 00 01 11 10 a 0 0
0

F = m (1 , 3 , 5 )

= M (0 , 2 , 4 , 6 , 7 )

= a ' b ' c + a ' bc + ab ' c = a ' c + b' c


1 0
4

b'c

1
1

1
5

m7 m6

1
3

0
7

0
2

0
6

Simplification by Karnaugh Maps Simplification by Karnaugh Maps Adjacency between each neighboring minterm
a bc 00 01 b=1 11 10 1 1 1 1 bc=01, a=X 0 F=b 1
bc 00 01 c=0 11 b=X 10 1 a 0

How minterms are ploted:

F=ac 1 1 a=1

a bc 00 01 10 11 1 0

F=bc 1

Karnaugh Plot directly from algebraic form Karnaugh Plot directly from algebraic form

a F=abc'+b'c+a' bc 00 01 11 10 a' 0 1 1 1 1 1 abc'


7

1 b'c 1

Simplification Using Uniting Theorem: Simplification Using Uniting Theorem:

X(Y+Y)=X X(Y+Y)=X

Ex:

a bc 00 01 11 10

F=a'b'c+a'bc+ab'c 0 1

T1=a'b'c+a'bc =a'c

1 1

T2=a'b'c+ab'c =b'c

ac covers minterms: (1, 3)=abc + abc

Ex2: bc

F=a'b'c'+ab'c'+a'bc'+abc'+abc 0 1 Ex3: 1 0 0 1 1 0 1

x yz

xy+x'z+yz=xy+x'z proved by Karnaugh map 0 1 0 0 1 1 yz

00 T1=a'b'c'+ab'c' +a'bc'+abc' 01 =c' 11 10

x'z

00 01 11

0 1 1 0

1 T2=abc+abc' =ab

10

xy

Ex4:

F=a'b'+bc'+ac a =a'c'+b'c+ab bc 0 1 00 a'b' 01 11 a'c' 10 1 1 0 1 bc' 0 1

Two Minimum forms of the same function

b'c

ac 1 1
10

ab

4-Variable Karnaugh Maps 4-Variable Karnaugh Maps


ab cd 00 01 11 10 00 0 1 3 2 01 4 5 7 6 11 12 13 15 14 10 8 9 11 10
cd 00 01 11 10 1 ab 00 1 F=acd+a'b+d' 01 11 1 1 1 1 a'b
11

10 1 d'

acd 1 1 1 1 d'

Example1: Simplification bc' ab cd 00 01 a'b'd 11 10 00 0 1 1 0 01 1 1 0 0 11 1 1 0 0 10 0 0 0 1 ab'cd'

F(a,b,c,d)=(1,3,4,5,10.12.13) F=bc'+a'b'd+ab'cd'

12

Example 2: F=c+b'd'+a'bd ab cd b'd' F=m(0,2,3,5,6,7,8,10,11,14,15) 00 00 01 11 10 1 1 1 1 1 1 1 1 c 1 1 01 11 10 1 b'd'

With Dont Care X With Dont Care X

F = m(1,3 ,5 ,7 ,9 ) + d (6 ,12 ,13 )


a'bd

ab cd 00 00 0 1 1 0

F=a'd+c'd 01 11 0 1 1 X X X 0 0

10 0 1 0 0 c'd

b'd'

b'd'

01 a'd 11 10

13

To Obtain Minimum POS form from Karnough Map

wx yz 00 01 11 10 00 1 0 1 1 01 1 0 0 0 w'xy

wxz' 11 0 0 1 0

10 1 0 1 1

F' = m(1,5 ,6 ,7 ,9 ,12 ,13 ,14 )


F

F = m(0 ,2 ,3 ,4 ,8 ,10 ,11,15 )

(F' )' = m(1,5 ,6 ,7 ,9 ,12 ,13 ,14 ) {


y'z

F' = y' z + wxz' + w' xy F = ( y + z' )(w' + x' + z )(w + x' + y )


14

Implicant : Single element of the ON - SET or any group of elements that can be combined together in a K - Map. Prime Inplicant : Implicant that can not be combined with another implicant to eliminate a term. Essential Prime Implicant : if an element of the ON - SET is covered by a single prime implicant, the prime implicant is an essential prime implicant.

15

Goal: Grow implicates into prime implicants. Cover the ONSET with as few prime implicants as possible
Essential Prime participate in ALL possible Covers.

Ex1 :
ab cd 00 A'C'D 01 11 10 00 0 1 0 0 01 0 1 1 1 A'BC ABC' 11 1 1 1 0 10 0 0 1 0

Implicants :

m1 ,m5 m12 ,m13 m6 ,m7 m11,m15 A' C' D ABC' A' BC ABC BD

Prime implicants AC'D ABC' A' BC ABC BD : Essential Prime Implicants AC'D ABC' A' BC ABC :
BD

ABC

F = 14' + ACD + A444A' C'3 + BD ABC444 2' BC + 44D 4


Minimum Cover
16

Prime Implicants : A' B' D, BC' , AC, A' C' D, AB, B' CD Essential Implicants : BC' , AC
ab cd 00 A'C'D 01 A'B'D 11 10
Essential Prime Implicants participate in all possible covers

00 0 1 1 0

BC' 01 1 1 0 0

11 1 1 1 1

AB 10 0 0 1 1 AC
17

B'CD

F=

6 74 4 8 BC'+ AC

+ A' C' D + B' CD

F = BC'+ AC + A' B' D Minimum Cover

ab

A' BD F = A' C' + A' B' D' + ACD + or BCD Essential Prime implicants
ab cd A'C' 00 01 A'BD 11 10 00 1 1 0 1 01 1 1 1 0 11 0 0 1 0 10 0 0 1 0 BCD

cd 00 01 11 10

00 X 0 0 0

01 1 1 X
m6

11 0 1 X 0

10 1 1 0
m10

ACD

Only m(6,10 ) are covered by only one prime inpliccant.


18

A'B'D'

A minimum solution: must contain all essential prime implicants

5 Variable Karnaugh Maps 5 Variable Karnaugh Maps


F = A' B' C' D' E' + A' B' CD' E' + AB' DE' +CDE + BD'
D'E' BC DE 00 01 11 10 A=0 00 01 1
m0

BC DE 00 A'B'C'D'E' 01 11 10 0
16 0

AB'CD'E' 00 01 1 1 0 0 0
20 4

BD' 11 1 0 0 1 0
28 12

10 1 1 1 1 0
24 8

1 1 0 0 CDE

0
17 1

0
21 5

1
29 13

1
25 9

0
19 3

1
23 7

1
31 15

0
27 11

1
18 2

1
22 6

0
30 14

0
26 10

AB'DE'

BC 11 1
m12

10 1
m8

DE 00 01 11 10

A=1 00 1
m16

01 1
m20

11 1
m28

10 1
m24

1
m4

1
m1

0
m5

1
m13

0
m9

1
m17

0
m21

1
m29

0
m25

F = D' E' + B' C' D' + BCE + A' BC' E' + ACDE
19

0
m3

0
m7

1
m15

0
m11

0
m19

1
m23

1
m31

0
m27

0
m2

0
m6

0
m14

1
m10

0
m18

0
m22

0
m30

0
m26

B'C'D'

A'BC'E'

BCE

ACDE

Another Example Another Example

BC DE

00 1 A'B'D' 0 01 1 0 11 0 0 10 0

00 0

AB' C F = 1444442ACD 4A' 43 + or A' B' D + ABE' + 44 + 4 BCE 4 4 Essential Prime Inplicants AB'C B' CD'
01 11 10 1 1 1 1 1 0 1 0 ACD 1 0 1 1 1 0 ABE' 0 1 0 0 1 0 0 0 A'BCE 1 0 B'CD'

F ( A, B ,C , D , E ) = m(0 ,1,4 ,5 ,13 ,15 ,20 ,21,22 ,23 ,24 ,26 ,28 ,30 ,31)
20

ab 11 10 cd ef 00 01 4 5 7 6 11 12 13 15 14 10 8 9 11 10 01

6-Variable K-Maps 6-Variable K-Maps

A'BC'D'E' 1 1 1 1 1 1 1 C'D'EF' 1

00 48 00 32 16 0 01 11 10 1 3 2 17 19 18

BCE'F' 1 1 1 1

1 1

1 1 1 1 1 CD'EF'

ABEF

21

Homework Chap 5. Homework Chap 5.


1: 1: 2: 2: 4: 4: 5: 5: 7: (b) (d) 7: (b) (d)

10: (b) 10: (b) 12: 12: 19: 19: 21: (b) 21: (b) 27: 27:
22

You might also like