Download presentation

Published byHannah Lindsey Modified over 4 years ago

2
**Overview Part 2 – Circuit Optimization 2-4 Two-Level Optimization**

2-5 Map Manipulation 2-6 Pragmatic Two-Level Optimization (Espresso) 2-7 Multi-Level Circuit Optimization

3
Circuit Optimization Goal: To obtain the simplest implementation for a given function Optimization is a more formal approach to simplification that is performed using a specific procedure or algorithm Optimization requires a cost criterion to measure the simplicity of a circuit Distinct cost criteria we will use: Literal cost (L) Gate input cost (G) Gate input cost with NOTs (GN)

4
**Literal Cost Literal – a variable or it complement**

Literal cost – the number of literal appearances in a Boolean expression corresponding to the logic circuit diagram Examples: F = AB+C(D+E) L = 5 F = AB+CD+CE L = 6 Which solution is best? 2nd Literal Cost = 11 3rd Literal Cost = 10 The first solution is best Which is best? The same complexity?

5
Gate Input Cost Gate input costs - the number of inputs to the gates in the implementation corresponding exactly to the given equation or equations. (G - inverters not counted, GN - inverters counted) For SOP and POS equations, it can be found from the equation(s) by finding the sum of: all literal appearances the number of terms excluding single literal terms,(G) and optionally, the number of distinct complemented single literals (GN). Example: Which solution is best? G = 15, GN = 18 (second value includes inverter inputs) G = 14, GN = 17 1st solution is best

6
**Cost Criteria (continued)**

GN = G + 2 = 9 GN(gate input count with NOTs) adds the inverter inputs Example 1: F = A + B C + L = 5 L (literal count) counts the AND inputs and the single literal OR input. B C G = L + 2 = 7 G (gate input count) adds the remaining OR gate inputs A B C F

7
**Cost Criteria (continued)**

B C F Example 2: F = A B C + L = 6 G = 8 GN = 11 F = (A + )( + C)( + B) L = 6 G = 9 GN = 12 Same function and same literal cost But first circuit has better gate input count and better gate input count with NOTs Select it! => Gate input cost performs better. A B C C B A F A B C

8
**Boolean Function Optimization**

Minimizing the gate input (or literal) cost of a (a set of) Boolean equation(s) reduces circuit cost. We choose gate input cost. Boolean Algebra and graphical techniques are tools to minimize cost criteria values. Some important questions: When do we stop trying to reduce the cost? Do we know when we have a minimum cost? => Optimization problem Treat optimum or near-optimum cost functions for two-level (SOP and POS) circuits first. Introduce a graphical technique using Karnaugh maps (K-maps, for short)

9
**Karnaugh Maps (K-map) A K-map is a collection of squares**

Each square represents a minterm The collection of squares is a graphical representation of a Boolean function Adjacent squares differ in the value of one variable Alternative algebraic expressions for the same function are derived by recognizing patterns of squares The K-map can be viewed as A reorganized version of the truth table

10
**Some Uses of K-Maps Provide a means for:**

Finding optimum or near optimum SOP and POS standard forms, and two-level AND/OR and OR/AND circuit implementations for functions with small numbers of variables Visualizing concepts related to manipulating Boolean expressions, and Demonstrating concepts used by computer-aided design programs to simplify large circuits

11
**Two Variable Maps A 2-variable Karnaugh Map:**

Note that all the adjacent minterms are differ in value of only one variable

12
**From Truth Tables to K-Map**

K-Maps can be used to simplify Boolean functions by systematic methods. Terms are selected to cover the 1’s cells in the map. Example – Two variable function: Result of simplification :

13
**K-Map Function Representation**

Example 2-4: Result of simplification=?

14
**K-Map Function Representation**

Example: G(x,y) = x + y For G(x,y), two pairs of adjacent cells containing 1’s can be combined using the Minimization Theorem: G = x+y y = 0 y = 1 x = 0 1 x = 1 ( ) ( ) y x xy ) , ( G + = Duplicate x y

15
**Three Variable Maps z y x A three-variable K-map:**

Where each minterm corresponds to the product terms: Note that if the binary value for an index differs in one bit position, the minterms are adjacent on the K-Map yz=00 yz=01 yz=11 yz=10 x=0 x=1 z y x

16
Three-Variable Maps Reduced literal product terms for SOP standard forms correspond to rectangles on K-maps containing cell counts that are powers of 2. Rectangles of 2 cells represent 2 adjacent minterms; of 4 cells represent 4 minterms that form a “pairwise adjacent” ring. 2 cells rectangle will cancel 1 variable 4 (=22 ) cells rectangle will cancel 2 variables 8 (=23 ) cells rectangle will cancel 3 variables What is the result for this case in three variables K-map?

17
Three Variable Maps Example 2-5: Simplify Result:

18
Three Variable Maps Example 2-6: Simplify Result:

19
Three Variable Maps Example 2-7: Simplify Result:

20
**Three-Variable Map Simplification**

Use a K-map to find an optimum SOP equation for F = Z’ + X’ Y’ + X Y

21
Four Variable Maps Map and location of minterms:

22
Four Variable Terms Four variable maps can have rectangles corresponding to: A single 1 = 4 variables, (i.e. Minterm) Two 1s = 3 variables, Four 1s = 2 variables Eight 1s = 1 variable, Sixteen 1s = zero variables (i.e. Constant "1")

23
Four-Variable Maps Example 2-8: Simplify Result:

24
Four-Variable Maps Example 2-9: Simplify Result:

25
**Four-Variable Map = S F(W, X, Y, Z) (3,4,5,7,9,1 3,14,15 ) m**

F = W' X Y' + W' Y Z + WXY + WY'Z

26
2-5 Map Manipulation Implicant: the rectangles on a map made up of squares containing 1s correspond to implicants. A Prime Implicant is a product term obtained by combining the maximum possible number of adjacent squares in the map into a rectangle with the number of squares a power of 2. A prime implicant is called an Essential Prime Implicant if it is the only prime implicant that covers (includes) one or more minterms. Prime Implicants and Essential Prime Implicants can be determined by inspection of a K-Map. A set of prime implicants "covers all minterms" if, for each minterm of the function, at least one prime implicant in the set of prime implicants includes the minterm.

27
**Example of Prime Implicants**

Find ALL Prime Implicants CD ESSENTIAL Prime Implicants C 1 B D A 1 B C D A D B D B C B Minterms covered by single prime implicant BD BD AD B A

28
**Another Example Find all prime implicants for:**

Hint: There are seven prime implicants! Prime Implicants are AB, B C' D', A' C' D', A' B' D', A' B' C, A' C D, B C D.

29
**Optimization Algorithm**

Find all prime implicants. Include all essential prime implicants in the solution Select a minimum cost set of non-essential prime implicants to cover all minterms not yet covered. Minimize the overlap among prime implicants as much as possible. In particular, in the final solution, make sure that each prime implicant selected includes at least one minterm not included in any other prime implicant selected.

30
**Selection Rule Example**

Simplify F(A, B, C, D) given on the K-map. Selected Essential 1 B D A C 1 B D A C 1 Minterms covered by essential prime implicants

31
**Example 2-12 Simplifying a function using the selection rule Result:**

Prime implicants are: A, B'C, and B'D' Result:

32
**Product-of-Sums Optimization**

The minterm not included in the function belong to the complement of the function. Example 2-13:

33
Don't Cares in K-Maps Sometimes a function table or map contains entries for which it is known: the input values for the minterm will never occur, or The output value for the minterm is not used In these cases, the output value need not be defined Instead, the output value is defined as a “don't care” By placing “don't cares” ( an “x” entry) in the function table or map, the cost of the logic circuit may be lowered. Example 1: A logic function having the binary codes for the BCD digits as its inputs. Only the codes for 0 through 9 are used. The six codes, 1010 through 1111 never occur, so the output values for these codes are “x” to represent “don’t cares.”

34
Don't Cares in K-Maps Example 2-14: Simplify

35
Example: BCD “5 or More” The map below gives a function F1(w,x,y,z) which is defined as "5 or more" over BCD inputs. With the don't cares used for the 6 non-BCD combinations: F1 (w,x,y,z) = w + x z + x y G = 7 This is much lower in cost than F2 where the “don't cares” were treated as "0s." G = 12 For this particular function, cost G for the POS solution for F1(w,x,y,z) is not changed by using the don't cares. y 1 3 2 1 1 1 4 5 7 6 x y x w z z) y, x, F2(w, + = X X X X 12 13 15 14 w 1 1 X X 8 9 11 10 z

36
**2-7 Multiple-Level Circuit Optimization**

Multiple-level circuits - circuits that are not two-level (with or without input and/or output inverters) Multiple-level circuits can have reduced gate input cost compared to two-level (SOP and POS) circuits Multiple-level optimization is performed by applying transformations to circuits represented by equations while evaluating cost

37
**From two-level circuit to multiple-level circuit**

Gate-input cost =17

38
**From two-level circuit to multiple-level circuit**

Gate-input cost =13

39
**From two-level circuit to multiple-level circuit**

Share (C+D) in the preceding circuit: Gate-input cost =11 But, Gate-input cost =12 <= increasing gate cost

40
**From two-level circuit to multiple-level circuit**

Gate-input cost = 9

41
Transformations Factoring - finding a factored form from SOP or POS expression Decomposition - expression of a function as a set of new functions Substitution of G into F - expression function F as a function of G and some or all of its original variables Elimination - Inverse of substitution Extraction - decomposition applied to multiple functions simultaneously

42
**Example 2-16 Multilevel optimization**

Factoring: Decomposition:

43
**Example 2-16 Multilevel optimization (continue)**

Substitution: Applying similar process to H, we have

44
**Example 2-16 Multilevel optimization (continue)**

Substitution and sharing: Gate-input cost: Original: 48 Decomposition without sharing: 31 Decomposition with sharing: 25

45
**Example 2-16 Multilevel optimization (continue)**

Fig. 2-21

46
**Delay problem (Example 2-17)**

Multiple-level circuit causes long delay In Fig (b), four logic gates in the longest path (from C, D, E, F and A to H) Delay reduction from Fig (b) What happened?

Similar presentations

© 2019 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google