Presentation is loading. Please wait.

Presentation is loading. Please wait.

KARNAUGH MAP Introduction Strategy for Minimization Minimization of Product-of-Sums Forms Minimization of More Complex Expressions Don't care Terms 1.

Similar presentations


Presentation on theme: "KARNAUGH MAP Introduction Strategy for Minimization Minimization of Product-of-Sums Forms Minimization of More Complex Expressions Don't care Terms 1."— Presentation transcript:

1 KARNAUGH MAP Introduction Strategy for Minimization Minimization of Product-of-Sums Forms Minimization of More Complex Expressions Don't care Terms 1

2 Introduction Why karnaugh map Example (With Boolean algebra) 2

3 Introduction ( cont. ) Using Boolean algebra for minimization causes it’s own problem because of it mainly being a trial and error process, and we can almost never be sure that we have reached a minimal representation. If we can form a graphical notation for our Boolean algebra the insight need for the minimization will be less vital in solving the problems. We can come close to our aim by using a graphical notation named Karnaugh Map that will be defined in next slides 3

4 Introduction ( cont. ) Comparing Karnaugh Map and Boolean Algebra ABW Truth Table B A W Karnaugh Map 4 As it can be seen, each box of the Karnaugh map corresponds to a row of the truth table and has been numbered accordingly This form of representing w in the following example is called a Sum of Product (SOP) Which will be define in next slides

5 Strategy for Minimization Terminology Minimization Procedure 5

6 Terminology Implicant : Product term that implies function Prime Implicant : An Implicant that is not completely covered by any other Implicant but itself Essential prime Implicant : A prime Implicant that has a minter not covered by any other prime Implicant Product term : An and expression 6

7 Terminology Minterm : We define a Minterm to be a product that contains all variables of that particular switching function in either complemented or non-complemented form Maxterm : We define a Maxterm to be a sum that contains all variables of that particular switching function in either complemented or non-complemented form Standard SOP(Sum Of Products) : In standard SOP, the products are obtained directly from the Karnaugh map or truth table, so the SOP contains all of the variables of the function Standard POS(Product Of Sums) : In standard POS, the products are obtained directly from the Karnaugh map or truth table, so the POS contains all of the variables of the function 7

8 Terminology ( cont. ) A simpler shorthand form of representing a SOP is to use the number of the Minterms that appear in that representation. In the following example for instance we could have written Karnaugh Map AB C

9 Terminology ( cont. ) Sometimes writing an expression in a POS form is easier as seen in the following example: Karnaugh Map AB C 9

10 Strategy for Minimization Terminology Minimization Procedure 10


Download ppt "KARNAUGH MAP Introduction Strategy for Minimization Minimization of Product-of-Sums Forms Minimization of More Complex Expressions Don't care Terms 1."

Similar presentations


Ads by Google