1. CS 140 Lecture 5 Professor CK Cheng CSE Dept. UC San Diego

2. Part I. Combinational Logic 1.Specification 2.Implementation K-map: Sum of products Product of sums

3. Implicant: A product term tat covers at least an element in F and has no intersect with R. Prime Implicants: Largest rectangles that intersect on-set but not off-set that correspond to product terms. Essential Primes: Prime implicants covering elements in F that are not covered by any other primes.

4. Example Given F =  m (3, 5), D =  m (0, 4) 0 2 6 4 1 3 7 5 b c a - 0 0 - 0 1 0 1 Primes:  m (3),  m (4, 5) Essential Primes:  m (3),  m (4, 5) Min exp: f(a,b,c) = a’bc + ab’

5. Five variable K-map 0 4 12 8 c d b e 1 5 13 9 3 7 15 11 2 6 14 10 16 20 28 24 c d b e a 17 21 29 25 19 23 31 27 18 22 30 26 Neighbors of minterm 5 are: 1, 4, 13, 7, and 21 Neighbors of minterm 10 are: 2, 8, 11, 14, and 26

6. Six variable K-map d e c f d e c d e c f 48 52 60 56 d e c b 49 53 61 57 51 55 63 59 50 54 62 58 a 32 36 44 40 33 37 45 41 35 39 47 43 34 38 46 42 f f 0 4 12 8 1 5 13 9 3 7 15 11 2 6 14 10 16 20 28 24 17 21 29 25 19 23 31 27 18 22 30 26

7. Min product of sums Given F =  m (3, 5), D =  m (0, 4) 0 2 6 4 1 3 7 5 b c a - 0 0 - 0 1 0 1 Prime Implicates:  M (0,1),  M (0,2,4,6),  M (6,7) Essential Primes Implicates:  M (0,1),  M (0,2,4,6),  M (6,7) Min exp: f(a,b,c) = (a+b)(c )(a’+b’)

8. Corresponding Circuit a b a’ b’ c f(a,b,c,d)

9. Another min product of sums example Given R =  m (3, 11, 12, 13, 14) D =  m (4, 8, 10) K-map b c a d 1 - 0 - 1 1 0 1 0 1 1 0 1 1 0 - 0 4 12 8 1 5 13 9 3 7 15 11 2 6 14 10

10. Prime Implicates:  M (3,11),  M (12,13),  M(10,11),  M (4,12),  M (8,10,12,14) Essential Primes:  M (8,10,12,14),  M (3,11),  M(12,13)