Gate-Level Minimization. BME208 Logic Circuits Yalçın İŞLER

Size: px

Start display at page:

Download "Gate-Level Minimization. BME208 Logic Circuits Yalçın İŞLER"

Darcy Atkinson
6 years ago
Views:

1 Gate-Level Minimization BME28 Logic Circuits Yalçın İŞLER

2 Complexity of Digital Circuits Directly related to the complexity of the algebraic expression we use to build the circuit. Truth table may lead to different implementations Question: which one to use? Optimization techniques of algebraic expressions So far, ad hoc. Need more systematic (algorithmic) way Quine-McCluskey Karnaugh (K-) map technique Espresso 2

3 Quine-McCluskey Method F(x,x2,x3,x4)=S 2,4,6,8,9,,2,3,5 mi x x2 x3 x

4 Quine-McCluskey Method List List 2 List 3 mi x x2 x3 x4 mi x x2 x3 x4 mi x x2 x3 x4 2 ok 2,6-8,9,2, ok 2, - 8,2,9, ok 4,6 - Finished 6 ok 4,2-9 ok 8,9 - ok ok 8, - 2 ok 8,2 - ok 3 ok 9,3 - ok 5 ok 2,3 - ok 3,5 -

5 Quine-McCluskey Method List List 2 List 3 mi x x2 x3 x4 mi x x2 x3 x4 mi x x2 x3 x4 2,6 - t2 8,9,2,3 - - t 2, - t3 4,6 - t4 Finished 4,2 - t5 8, - t6 3,5 - t7

6 Quine-McCluskey Method t X X X X t2 X X t3 X X t4 X X t5 X X t6 X X t7 X X t2 X X t3 X X t4 X X F(x,x2,x3,x4)=t+t7+t3+t4 =xx3 + xx2x4 + x2 x3x4 + x x2x4 t5 t6 X X t5 is a subset of t4 t6 is a subset of t3

7 Two-Variable K-Map Two variables: x and y 4 minterms: m = x y m = x y m 2 = xy m 3 = xy y x m m m 2 m 3 y x x y x y xy xy 7

8 Example: Two-Variable K-Map y x F = m + m + m 2 = x y + x y + xy F = F = F = F = x + y We can do the same optimization by combining adjacent cells. 8

9 Three-Variable K-Map yz x m m m 3 m 2 m 4 m 5 m 7 m 6 Adjacent squares: they differ by only one variable, which is primed in one square and not primed in the other m 2 m 6, m 3 m 7 m 2 m, m 6 m 4 9

10 Example: Three-Variable K-Map F (x, y, z) = S (2, 3, 4, 5) yz x F (x, y, z) = F 2 (x, y, z) = S (3, 4, 6, 7) yz x F (x, y, z) =

11 Example: Three-Variable K-Map F (x, y, z) = S (2, 3, 4, 5) yz x F (x, y, z) = xy + x y F 2 (x, y, z) = S (3, 4, 6, 7) yz x F (x, y, z) = xz + yz

12 Three Variable Karnaugh Maps One square represents one minterm with three literals Two adjacent squares represent a term with two literals Four adjacent squares represent a term with one literal Eight adjacent squares produce a function that is always equal to. 2

13 F (x, y, z) = S (, 2, 4, 5, 6) Example y x yz x z F (x, y, z) = 3

14 F (x, y, z) = S (, 2, 4, 5, 6) Example y x yz x z F (x, y, z) = 4

15 Finding Sum of Minterms If a function is not expressed in sum of minterms form, it is possible to get it using K-maps Example: F(x, y, z) = x z + x y + xy z + yz x yz F(x, y, z) = x y z + x yz + x yz + xy z + xyz F(x, y, z) = 5

16 Four-Variable K-Map Four variables: x, y, z, t 4 literals 6 minterms zt xy m m m 3 m 2 z x m 4 m 5 m 7 m 6 m 2 m 3 m 5 m 4 m 8 m 9 m m y t 6

17 Example: Four-Variable K-Map F(x,y,z,t) = S (,, 2, 4, 5, 6, 8, 9, 2, 3, 4) zt xy F(x,y,z,t) = 7

18 Example: Four-Variable K-Map F(x,y,z,t) = S (,, 2, 4, 5, 6, 8, 9, 2, 3, 4) zt xy F(x,y,z,t) = 8

19 Example: Four-Variable K-Map F(x,y,z,t) = x y z + y zt + x yzt + xy z zt xy F(x,y,z,t) = 9

20 Example: Four-Variable K-Map F(x,y,z,t) = x y z + y zt + x yzt + xy z zt xy F(x,y,z,t) = 2

21 Example: Four-Variable K-Map zt xy F(x,y,z,t) = 2

22 Prime Implicants A product term obtained by combining maximum possible number of adjacent squares in the map If a minterm is covered by only one prime implicant, that prime implicant is said to be essential. A single on the map represents a prime implicant if it is not adjacent to any other s. Two adjacent s form a prime implicant, provided that they are not within a group of four adjacent s. So on 22

23 Example: Prime Implicants F(x,y,z,t) = S (, 2, 3, 5, 7, 8, 9,,, 3, 5) zt xy Prime implicants y t essential since m is covered only in it yt - essential since m 5 is covered only in it They together cover m, m 2, m 8, m, m 5, m 7, m 3, m 5 23

24 zt Example: Prime Implicants xy m 3, m 9, m are not yet covered. How do we cover them? There are actually more than one way. 24

25 zt Example: Prime Implicants xy 3 2 Both y z and zt covers m 3 and m. m 9 can be covered in two different prime implicants: xt or xy m 3, m zt or y z m 9 xy or xt 4 25

26 Example: Prime Implicants F(x, y, z, t) = yt + y t + zt + xt or F(x, y, z, t) = yt + y t + zt + xy or F(x, y, z, t) = yt + y t + y z + xt or F(x, y, z, t) = yt + y t + y z + xy Therefore, what to do 26 Find out all the essential prime implicants Other prime implicants that covers the minterms not covered by the essential prime implicants Simplified expression is the logical sum of the essential implicants plus the other implicants

27 Five-Variable Map Downside: Karnaugh maps with more than four variables are not simple to use anymore. 5 variables 32 squares, 6 variables 64 squares Somewhat more practical way for F(x, y, z, t, w) tw yz m m m 3 m 2 m 4 m 5 m 7 m 6 m 2 m 3 m 5 m 4 m 8 m 9 m m tw yz m 6 m 7 m 9 m 8 m 2 m 2 m 23 m 22 m 28 m 29 m 3 m 3 m 24 m 25 m 27 m x = x =

28 Many-Variable Maps Adjacency: Each square in the x = map is adjacent to the corresponding square in the x = map. For example, m 4 m 2 and m 5 m 3 Use four 4-variable maps to obtain 64 squares required for six variable optimization Alternative way: Use computer programs Quine-McCluskey method Espresso method 28

29 Example: Five-Variable Map F(x, y, z, t, w) = S (, 2, 4, 6, 9, 3, 2, 23, 25, 29, 3) tw yz tw yz F(x,y,z,t,w) = x = x = 3

30 Product of Sums Simplification So far simplified expressions from Karnaugh maps are in sum of products form. Simplified product of sums can also be derived from Karnaugh maps. Method: A square with actually represents a minterm Similarly an empty square (a square with ) represents a maxterm. Treat the s in the same manner as we treat s The result is a simplified expression in product of sums form. 32

31 Example: Product of Sums F(x, y, z, t) = S (,, 2, 5, 8, 9, ) Simplify this function in a. sum of products b. product of sums zt xy F(x, y, z, t) = 33

32 Example: Product of Sums F (x,y,z,t) = Apply DeMorgan s theorem (use dual theorem) F = zt xy F(x,y,z,t) = y t + y z + x z t 34 F(x,y,z,t) = (y +t)(z +t )(x +y )

33 Example: Product of Sums y t y F z x z t F(x,y,z,t) = y t + y z + x z t: sum of products implementation y t x y z F t F = (y + t)(x + y )(z + t ): product of sums implementation 35

34 Product of Maxterms If the function is originally expressed in the product of maxterms canonical form, the procedure is also valid Example: F(x, y, z) = (, 2, 5, 7) x yz 36 F(x, y, z) = F(x, y, z) = x z + xz

35 Product of Sums To enter a function F, expressed in product of sums, in the map. take its complement, F 2. Find the squares corresponding to the terms in F, 3. Fill these square with s and others with s. Example: F(x, y, z, t) = (x + y + z )(y + t) F (x, y, z, t) = zt xy 37

36 Don t Care Conditions /2 Some functions are not defined for certain input combinations Such function are referred as incompletely specified functions For instance, a circuit defined by the function has never certain input values; therefore, the corresponding output values do not have to be defined This may significantly reduces the circuit complexity 38

37 Don t Care Conditions 2/2 Example: A circuit that takes the s complement of decimal digits 39

38 Unspecified Minterms For unspecified minterms, we do not care what the value the function produces. Unspecified minterms of a function are called don t care conditions. We use X symbol to represent them in Karnaugh map. Useful for further simplification The symbol X s in the map can be taken or to make the Boolean expression even more simplified 4

39 Example: Don t Care Conditions F(x, y, z, t) = S(, 3, 7,, 5) function d(x, y, z, t) = S(, 2, 5) don t care conditions zt xy X X X F = F = F 2 = or 4

40 Example: Don t Care Conditions F = zt + x y = S(,, 2, 3, 7,, 5) F 2 = zt + x t = S(, 3, 5, 7,, 5) The two functions are algebraically unequal As far as the function F is concerned both functions are acceptable Look at the simplified product of sums expression for the same function F. zt xy X X X F = F = 42

41 Another Way to Handle K-Maps - SOP x y z t F zt xy yz x t t' t t' 43

42 Another Way to Handle K-Maps - SOP x y z t F zt xy yz x t + t t t' t t + t t' 44

43 Another Way to Handle K-Maps - SOP x y z t F zt xy yz x t + t t t' t t + t t' 45

44 Another Way to Handle K-Maps -SOP x y z t F zt xy yz x t + t t t' t t + t t' 46

45 Another Way to Handle K-Maps - SOP x y z t F zt xy yz x t + t t t' t t + t t' 47

46 Another Way to Handle K-Maps - SOP We have s in the boxes = x+x = +x = +x Use this wherever useful If you partition = x+x then include x in one term, x in another If you use = +x, then include x in a neighboring bigger block, and process as usual 48

47 Another Way to Handle K-Maps - POS x y z t F zt xy yz x t t' t. t t' t. t 49

48 Another Way to Handle K-Maps - POS x y z t F zt xy yz x t t' t. t t' t. t 5

49 Another Way to Handle K-Maps - POS x y z t F zt xy yz x t t' t. t t' t. t 5

50 Another Way to Handle K-Maps - POS We have s in the boxes = x.x =.x =.x Use this wherever useful If you partition = x.x then include x in one term, x in another If you use =.x, then include x in a neighboring bigger block, and process as usual 52

51 Simultaneous Minimization of Multiple Boolean Functions yz x 53

52 Simultaneous Minimization of Multiple Boolean Functions yz x z x 54

53 Simultaneous Minimization of Multiple Boolean Functions yz x z x xy 55

54 Simultaneous Minimization of Multiple Boolean Functions yz x z x y z xy 56

55 Simultaneous Minimization of Multiple Boolean Functions yz x z x xy z y z xy 57

56 NAND and NOR Gates NAND and NOR gates are easier to fabricate V DD A C = (AB) B CMOS 2-input AND gates requires 6 CMOS transistors 58 CMOS 3-input NAND gates requires 6 CMOS transistors

57 Design with NAND or NOR Gates It is beneficial to derive conversion rules from Boolean functions given in terms of AND, OR, an NOT gates into equivalent NAND or NOR implementations x (x x) = x NOT x y [ (x y) ] = x y AND x (x y ) = x + y OR 59 y

58 x y z New Notation (xyz) x y z x + y + z AND-invert Invert-OR Implementing a Boolean function with NAND gates is easy if it is in sum of products form. Example: F(x, y, z, t) = xy + zt x y z t F(x, y, z, t) = xy + zt x y z t F(x, y, z, t) = ((xy) ) + ((zt) ) 6

59 x y z t The Conversion Method x y z t ((xy) ) + ((zt) ) = xy + zt = [ (xy) (zt) ] Example: F(x, y, z) = S(, 3, 4, 5, 7) yz x F = z + xy F = (z ) + ((xy ) ) 6

60 Example: Design with NAND Gates x y x y z F z F F = (z ) + ((xy ) ) F = z + xy Summary. Simplify the function 2. Draw a NAND gate for each product term 3. Draw a NAND gate for the OR gate in the 2 nd level, 4. A product term with single literal needs an inverter in the first level. Assume single, complemented literals are available. 62

61 Multi-Level NAND Gate Designs The standard form results in two-level implementations Non-standard forms may raise a difficulty Example: F = x(zt + y) + yz 4-level implementation z t y x y z F 63

62 Example: Multilevel NAND F = x(zt + y) + yz z t F F 64

63 Design with Multi-Level NAND Gates Rules. Convert all AND gates to NAND gates 2. Convert all OR gates to NAND gates 3. Insert an inverter (one-input NAND gate) at the output if the final operation is AND 4. Check the bubbles in the diagram. For every bubble along a path from input to output there must be another bubble. If not so, a. complement the input literal 65

64 Another (Harder) Example Example: F = (xy + xy)(z + t ) (three-level implementation) x y x y F z t 66

65 Example: Multi-Level NAND Gates x y x y z t F = (xy + xy)(z + t ) G = [ (xy + xy)(z + t) ] F = (xy + xy)(z + t ) F = (xy + xy)(z + t ) 67

66 Design with NOR Gates NOR is the dual operation of NAND. All rules and procedure we used in the design with NAND gates apply here in a similar way. Function is implemented easily if it is in product of sums form. x (x + x) = x NOT x y [ (x+ y) ] = x + y OR x y (x + y ) = x y AND 68

67 Example: Design with NOR Gates F = (x+y) (z+t) w x y z t w F x y z t w F = (x + y) (z + t) w 69

68 Example: Design with NOR Gates F = (xy + zt) (z + t ) x y z t F z t 7 x y z t z t F = [((x + y) + (z + t ) ) + (z + t ) ] = ((x + y) + (z + t ) )(z + t ) = (xy + zt) (z + t )

69 Example: F = x(zt + y) + yz z t Harder Example y x y z F F 7

70 Exclusive-OR Function The symbol: x y = xy + x y (x y) = xy + x y Properties. x = x 2. x = x 3. x x = 4. x x = 5. x y = x y = (x y) - XNOR Commutative & Associative x y = y x (x y) z = x (y z) 72

71 Exclusive-OR Function XOR gate is not universal Only a limited number of Boolean functions can be expressed in terms of XOR gates XOR operation has very important application in arithmetic and error-detection circuits. Odd Function (x y) z = (xy + x y) z = (xy + x y) z + (xy + x y) z = xy z + x yz + (xy + x y ) z = xy z + x yz + xyz + x y z = S (4, 2, 7, ) 73

72 Odd Function If an odd number of variables are equal to, then the function is equal to. Therefore, multivariable XOR operation is referred as odd function. yz x Odd function yz x Even function 74

73 Odd & Even Functions x y z x y z Odd function (x y z) = ((x y) z) x y (x y z) z 75

74 Adder Circuit for Integers Addition of two-bit numbers Z = X + Y X = (x x ) and Y = (y y ) Z = (z 2 z z ) Bitwise addition. z = x y (sum) c = x y (carry) 2. z = x y c c 2 = x y + x c + y c 3. z 2 = c 2 76

75 Adder Circuit z 2 = c 2 z = x y c c 2 = x y + x c + y c z = x y c = x y y x y x FA c c 2 = z 2 z z 77

76 Comparator Circuit with NAND gates F(X>Y) X = (x x ) and Y = (y y ) y y x x F(x, x, y, y ) = x y + x x y + x y y 78

77 79 Comparator Circuit - Schematic

78 8 Comparator Circuit - Simulation

Gate-Level Minimization. section instructor: Ufuk Çelikcan

Gate-Level Minimization. section instructor: Ufuk Çelikcan Gate-Level Minimization section instructor: Ufuk Çelikcan Compleity of Digital Circuits Directly related to the compleity of the algebraic epression we use to build the circuit. Truth table may lead to