1. Chapter 3 The Karnough Map 3 - 1

2. 3 - 2

3. Minimum Forms of Switching Functions 1.Combine terms by using ( Adjacency) Do this repeatedly to eliminates as many literals as possible. A given term may be used more than once because 2. Eliminate redundant terms by using the consensus theorems. 3 - 3

4. Minimum Forms of Switching Functions Example: Find a minimum sum-of-products 3 - 4

5. Minimum Forms of Switching Functions Example: Find a minimum product-of-sums Eliminate by consensus 3 - 5

6. Map Representation Boolean n-cube Each n-cube represents a minterm of an n-variable Boolean function. There is 1-to-1 correspondence between each row in the truth table and each vertex in the n-cube. Boolean m-subcube Set of 2 m vertices in which n-m of the variables have the same value at every vertex, while the remaining m variables will take on the 2 m possible combinations of the values 0 and 1. In a standard sum-of-product form, each term will be a subcube of 1- minterms and each 1-minterm will be in at least one subcube. 3 - 6

7. (a) Boolean n-cubes for n = 1, 2, and 3. (b) One of 2-subcubes of a 3-cube. 1110 0001 01 101100 000001 111110 011010 101100 000001 111110 011010 3 - 7

8. Prime implicant(PI) A subcube that is not contained within any other subcube. Essential prime implicant(EPI) A subcube that includes a 1-minterm that is not included in any other subcube. Karnaugh map(K-map, or map) Map is a 2-dimensional form of Boolean n-cube. An array of squares arranged in rows and columns. Each square corresponds to one vertex of the cube - that is, one minterm of the Boolean function. 1 inside its square when the minterm is 1-minterm. 0 inside its square when the minterm is 0-minterm. 3 - 8

9. (a) Boolean cubes and corresponding Karnaugh-maps for n = 1, 2, 3, and 4. m1m1 m0m0 m0m0 m1m1 m2m2 m3m3 m0m0 m1m1 m3m3 m2m2 m4m4 m5m5 m7m7 m6m6 m0m0 m1m1 m3m3 m2m2 m4m4 m5m5 m7m7 m6m6 m 12 m 13 m 15 m 14 m8m8 m9m9 m 11 m 10 3 - 9

10. Two-variable map (a) Example subcubes of size 2 Subcube x’ Subcube y 3 - 10

11. Chapter 3 The Karnaugh Map 3.1 Introduction to the Karnaugh Map(K-map)  Layout An array of squares arranged in rows and columns. Each square corresponds to one vertex of the cube - that is, one minterm of the Boolean function. A’B’A B’ A’BA B m0m0 m2m2 m1m1 m 03 B A P.114 Map 3.1 3 - 11

12. Map representation of three two-variable Boolean functions. (a) Truth table(b) AND: xy (d) XOR: x’y + xy’(c) OR: x + y 1 1 11 1 1 3 - 12

13. Chapter 3 The Karnaugh Map 3.1 Introduction to the Karnaugh Map(K-map)  Three-variable Maps Three-variable maps have eight squares, arranged in a rectangle P.114 - 115 Map 3.3 Another Example Map 3.4 is incorrect. 3 - 13

14. Chapter 3 The Karnaugh Map 3.2 Minimum Sum of Product Expressions using the K-map  Adjacencies on three- and four-variable maps 1 1 1 1 P.123 Map 3.14 3 - 14

15. Three-variable map (b) Example subcubes of size 4(c) Example subcubes of size 2 (a) Map organization z x x’y’ yz xz’ 3 - 15

16. Map representation of carry and sum functions of FA (a) Truth table of FA (b) Carry function: (c) Sum function: 3 - 16

17. Copyright © 2005 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Example 3.9 x yz + x yz + xy z + xy z + xyz. P.128 3 - 17

18. Chapter 3 The Karnaugh Map 3.1 Introduction to the Karnaugh Map(K-map)  Four-variable Maps A’B’C’D’A’B C’D’A B C’D’A B’C’D’ A’B’C’DA’B C’DA B C’DA B’C’D A’B’C DA’B C DA B C DA B’C D A’B’C D’A’B C D’A B C D’A B’C D’ P.117 Map 3.8 3 - 19

19. Four-variable map (a) Map organization (b) Example of 2-subcubes (c) Example of 3-subcubes y’w x’y xz w’ x’ x’y’z’w’x’y’z’w x’y’zw x’y’zw’ x’yz’w’x’yz’wx’yzwx’yzw’ xyz’w’xyz’wxyzwxyzw’ xy’z’w’xy’z’wxy’zwxy’zw’ 3 - 20

20. Chapter 3 The Karnaugh Map 3.1 Introduction to the Karnaugh Map(K-map)  An Implicant of a Function Implicants of F Minterms A’B’C’D’ A’B’CD A’BCD ABC’D’ ABC’D ABCD AB’CD Groups of 2 A’CD BCD ACD B’CD ABC’ ABD Groups of 4 CD P.121 Map 3.12 3 -21

21. Chapter 3 The Karnaugh Map 3.1 Introduction to the Karnaugh Map(K-map)  Groups of eight 1’s A’D’ P.119 Map 3.11 3 - 22

22. Representation of greater-than and less-than functions in maps. (a) Truth table (b) Greater-than function: (c) Less-than function: 3 -23

23. EXAMPLE Map method Using the map method, simplify the Boolean function (a) Prime implicants in the map (c) Two functional expressions (b) PI, EPI, and cover lists w’z’ wz yzw’y PIs w’y’z’wzxyzw’y 3 - 33

24. Copyright © 2008 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. g=xz+wz+wyz+wxy g=xz+wz+wyz+xyz g=xz+wz+xyz+wxy Example 3.10 g(w, x, y, z) = Σm(2, 5, 6, 7, 9, 10, 11, 13, 15) P.128 - 129 3 - 24

25. not usedminimum G = ABC + ACD + ABC + ACD Copyright © 2008 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Example 3.10 P.129 - 130 3 - 25

26. Chapter 3 The Karnaugh Map 3.5 Five-Variable Maps  A Five Variable Map A five-variable map consists of 2 5 = 32 squares. P.141 Map 3.16 3 - 36

27. Chapter 3 The Karnaugh Map 3.5 Five-Variable Maps  A Five Variable Map Example(1) F(A, B, C, D, E) = ∑ m(2, 5, 7, 11, 18, 21, 23, 27) m 2 +m 18 = A’B’C’DE’ + AB’C’DE’ = B’C’DE’ m 11 +m 27 = A’BC’DE + ABC’DE = BC’DE m 5 +m 7 +m 21 +m 23 = B’CE P.142 Example 3.6 3 - 38

28. Six-variable map (a) Map organization 3 - 41

29. Six-variable map(cont’d) (b) Example subcubes of size 16 z’w’ xz x’v 3 - 42

30. Chapter 4 Designing Combinational Systems 4.8 LARGER EXAMPLES 4.8.2 A Driver for a Seven-Segment Display The seven-segment display : commonly used for decimal digits. Four inputs : W, X, Y, Z Seven outputs : a, b, c, d, e, f, g P.225 Display Driver abcdefgabcdefg W X Y Z a b c d e f g Figure 4.26 3 - 54

31. Chapter 2 Combinational Systems 2.1 The Design Process for Combinational Systems  The Development of Truth Tables A truth table for the seven-segment display driver. DigitWXYZabcdefg 000001111110 100010110000 200101101101 300111111001 401000110011 501011011011 60110X011111 7011111100X0 810001111111 91001111X011 -1010XXXXXXX -1011XXXXXXX -1100XXXXXXX -1101XXXXXXX -1110XXXXXXX -1111XXXXXXX P.42 Table 2.6 3 - 53

32. Chapter 4 Designing Combinational Systems 4.8 LARGER EXAMPLES P.226 Map 4.3 3 - 55

33. Chapter 4 Designing Combinational Systems 4.8 LARGER EXAMPLES Several prime implicants that can be shared. a = W + Y + XZ + X’Z’ b = X’ + YZ + Y’Z’ c = X + Y’ + Z d = X’Z’ + YZ’ + X’Y + XY’Z e = X’Z’ + YZ’ f = W + X + Y’Z’ g = W + X’Y + XY’ + {XZ’ or YZ’} The shared terms are shown in colorful. TypeNumber Number of modulesChip 2-in8 27400 3-in4 17410 4-in3 27420 P.226 - 227 3 - 56

34. Copyright © 2008 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Figure 2.12 NAND gates. Figure 2.13 Alternate symbol for NAND. Figure 2.14 Symbols for NOR gate. P.65 3 - 69

35. Conversion and Optimization Rules Replace AND and OR gates with NAND(NOR) gates by using Rules 1 and 2(3 and 4), and eliminate double inverters whenever possible. 3 - 72

36. Translation of Sum of Products and Product of Sums to NAND and NOR Schematics 3 - 73

37. Example design with static-1 hazard (a) Map representation (b) Logic schematic(c) Timing diagram 3 - 92

38. Example of hazard-free design (a) Map representation (b) Logic schematic(c) Timing diagram Redundant cover 3 - 93