Karnaugh-map usage

16
Logic System Design I 4-36 Karnaugh-map usage Plot 1s corresponding to minterms of function. Circle largest possible rectangular sets of 1s. # of 1s in set must be power of 2 OK to cross edges Read off product terms, one per circled set. Variable is 1 ==> include variable Variable is 0 ==> include complement of variable Variable is both 0 and 1 ==> variable not included Circled sets and corresponding product terms are called “prime implicants” Minimum number of gates and gate inputs

Transcript of Karnaugh-map usage

Page 1: Karnaugh-map usage

Logic System Design I 4-36

Karnaugh-map usage

Plot 1s corresponding to minterms of function.Circle largest possible rectangular sets of 1s.

– # of 1s in set must be power of 2– OK to cross edges

Read off product terms, one per circled set.– Variable is 1 ==> include variable– Variable is 0 ==> include complement of variable– Variable is both 0 and 1 ==> variable not included

Circled sets and corresponding product terms are called “prime implicants”

Minimum number of gates and gate inputs

Page 2: Karnaugh-map usage

Logic System Design I 4-37

Prime-number detector

Page 3: Karnaugh-map usage

Logic System Design I 4-38

Resulting Circuit.

Page 4: Karnaugh-map usage

Logic System Design I 4-39

Another example

Page 5: Karnaugh-map usage

Logic System Design I 4-40

Yet another example

Distinguished 1 cellsEssential prime implicants

Page 6: Karnaugh-map usage

Logic System Design I 4-41

Another Example

F(W,X,Y,Z) = Σm(0,1,2,4,5,6,8,9,12,13,14)

Page 7: Karnaugh-map usage

Logic System Design I 4-42

Another Example

F(W,X,Y,Z) = Σm(0,1,2,3,6,8,9,10,11,14)

Page 8: Karnaugh-map usage

Logic System Design I 4-43

Another Example

F(W,X,Y,Z) = Σm( )

Page 9: Karnaugh-map usage

Logic System Design I 4-44

Don’t Cares

0

1

3

2

4

5

7

6

12

13

15

14

8

9

11

10

00 01 11 10N3 N2

N1 N0

00

1 1 d

d

d

d

d

d

11

1

01

11

10

N3

N2

N1

N0

N3 N2

N1 N0

N3

N2

N1

N0

(a)00 01 11 10

00

1 1 d

d

d

d

d

d

11

1

01

(b)

F = N3′ • N0 + N2′ • N1

11

10

N3′ • N0

N2′ • N1

N2 • N0

F = ΣN3,N2,N1,N0(1,2,3,5,7) + d(10,11,12,13,14,15)

Copyright © 2000 by Prentice Hall, Inc. Digital Design Principles and Practices, 3/e

Page 10: Karnaugh-map usage

Logic System Design I 4-45

Another Example

F(W,X,Y,Z) = Σm(0,1,2,3,6,8,9,10,11,14) + d(7,15)

Page 11: Karnaugh-map usage

Logic System Design I 4-46

Another Example

F(W,X,Y,Z) = Σm( ) + d( )

Page 12: Karnaugh-map usage

Logic System Design I 4-47

Resulting Circuit

F(W,X,Y,Z) = Σm( ) + d( )

Page 13: Karnaugh-map usage

Logic System Design I 4-48

Another Example

F(V,W,X,Y,Z) = Σm(0,1,2,3,16,17,18,19,20,21,22) + d(23,30,31)

16

17

19

18

20

21

23

22

28

29

31

30

24

25

27

26

V=0 V=1

Page 14: Karnaugh-map usage

Logic System Design I 4-49

Resulting Circuit

F(V,W,X,Y,Z) = Σm(0,1,2,3,16,17,18,19,20,21,22) + d(23,30,31)

Page 15: Karnaugh-map usage

Logic System Design I 4-50

Another Example

F(V,W,X,Y,Z) = Σm( ) + d( )

16

17

19

18

20

21

23

22

28

29

31

30

24

25

27

26

V=0 V=1

Page 16: Karnaugh-map usage

Logic System Design I 4-51

Current Logic Design

Lots more than 6 inputs -- can’t use Karnaugh mapsUse software to synthesize logic expressions and

minimize logicHardware Description Languages -- VHDL and Verilog