COM111 Introduction to Computer Engineering (Fall 2006-2007) NOTES 6 -- page 1 of 12 Karnaugh Maps In this lecture, we will discuss Karnaugh maps (K-maps) more formally than last time and discuss a more orderly method for optaining the minimal sum. Literal A variable or the complement of a variable. Examples: A, B', C', D Normal Product Term A product term in which no variable appears more than once. Examples: ABC, AB'C', A'B'C' Counter Examples: AA'BC, AB'B'C', ABCC n-variable Minterm A normal product term with n literals. There are 2 n such terms. Example: A B 0 0 A'B' 0 1 A'B 1 0 AB' 1 1 AB Each of the product terms corresponding to a row in the truth table is a minterm. Minimal Sum Implicant A sum of products (SOP) expression such that no SOP expression for Y has fewer product terms and any SOP expression with the same number of product terms has at least as many literals. This is what we are trying to produce through the use of Karnaugh maps. A normal product term that implies Y. Example: For the function Y = AB + ABC + BC, the implicants are AB, ABC, and BC because if any one of those terms are true, then Y is true. Prime Implicant An implicant of Y such that if any variable is removed from the implicant, the resulting term does not imply Y. Example: Y = AB + ABC + BC Prime Implicants: AB, BC Not a prime implicant: ABC ABC is not a prime implicant because the literal A can be removed to give BC and BC still implies Y. Conversely AB is not a prime implicant because you can't remove either A or B and have the remaining term still imply Y. In truth tables the prime implicants are represented by the largest rectangular groups of ones that can be circled. If a smaller subgroup is circled, the smaller group is an implicant, but not a prime implicant. PI Theorem A minimal sum is a sum of prime implicants. Distinguished 1-Cell An input combination that is covered by 1 prime implicant. In terms of Karnaugh maps, distinguished 1-cells are 1's that are circled by only 1 prime implicant.
COM111 Introduction to Computer Engineering (Fall 2006-2007) NOTES 6 -- page 2 of 12 Essential Prime Implicant A prime implicant that that includes one or more distinguished one cells. Essential prime implicants are important because a minimal sum contains all essential prime implicants. Karnaugh Map Examples In the following examples the distinguished 1-cells are marked in the upper left corner of the cell with an asterisk (*). The essential prime implicants are circled in blue, the prime implicants are circled in black, and the non-essential prime implicants included in the minimal sum are shown in red. Example 1 Prime Implicants: 5 Distinguished 1-Cells: 2 Essential Prime Implicants: 2 Minimal Sums: 1
COM111 Introduction to Computer Engineering (Fall 2006-2007) NOTES 6 -- page 3 of 12 Y = A'CD' + AC'D + BCD Example 2 Prime Implicants: 7 Distinguished 1-Cells: 2 Essential Prime Implicants: 2 Minimal Sums: 1 Y = B'D' + AD' + A'C'D + BCD
COM111 Introduction to Computer Engineering (Fall 2006-2007) NOTES 6 -- page 4 of 12 Example 3 Prime Implicants: 6 Distinguished 1-Cells: 2 Essential Prime Implicants: 2 Minimal Sums: 3 Y = AB'C' + A'CD' + AC'D + BCD Y = AB'C' + A'CD' + ABD + A'BC
COM111 Introduction to Computer Engineering (Fall 2006-2007) NOTES 6 -- page 5 of 12 Y = AB'C' + A'CD' + ABD + BCD Example 4 Prime Implicants: 5 Distinguished 1-Cells: 3 Essential Prime Implicants: 3 Minimal Sums: 1 Y = A'B' + A'C' + ABC + A'D Example 5 Prime Implicants: 4 Distinguished 1-Cells: 4 Essential Prime Implicants: 4 Minimal Sums: 1
COM111 Introduction to Computer Engineering (Fall 2006-2007) NOTES 6 -- page 6 of 12 Y = A'C + A'B + BD + CD Example 6 Prime Implicants: 5 Distinguished 1-Cells: 3 Essential Prime Implicants: 3 Minimal Sums: 1 Y = B'D + BC' + AB Example 7 Prime Implicants: 8 Distinguished 1-Cells: 0 Essential Prime Implicants: 0 Minimal Sums: 2
COM111 Introduction to Computer Engineering (Fall 2006-2007) NOTES 6 -- page 7 of 12 Y = A'B'C + A'BD + ABC' + AB'D' Y = B'CD' + A'CD + BC'D + AC'D' Example 8 Prime Implicants: 3 Distinguished 1-Cells: 8 Essential Prime Implicants: 3 Minimal Sums: 1
COM111 Introduction to Computer Engineering (Fall 2006-2007) NOTES 6 -- page 8 of 12 Y = B'C + D + BC' 5-Variable Karnaugh Maps For these you must circle the prime implicants on each map individually and then the prime implicants on the joint map. The joint essential prime implicants are shown in green. Prime Implicants: 7 Distinguished 1-Cells: 7 Essential Prime Implicants: 4 Minimal Sums: 2 Y = A'B'C' + BE + ABC' + ACE + A'DE
COM111 Introduction to Computer Engineering (Fall 2006-2007) NOTES 6 -- page 9 of 12 Y = A'B'C' + BE + ABC' + ACE + CDE Note that the joint map can help you identify the joint prime implicants.
COM111 Introduction to Computer Engineering (Fall 2006-2007) NOTES 6 -- page 10 of 12 6-Variable Karnaugh Maps The prime implicants unique to each map are shown in black. The prime implicants shared between maps 0 and 1 (A=0) are shown in aqua. The prime implicants shared between maps 0 and 2 (B=0) are shown in violet. The prime implicants shared between maps 1 and 3 (B=1) are shown in olive. The prime implicants shared between maps 2 and 3 (A=1) are shown in brown. The prime implicants shared between all 4 maps are shown in orange. To find the prime implicants shared among maps it may help to draw out each of the 5 joint maps. Distinguished 1-Cells: 10 Essential Prime Implicants: 5 Minimal Sums: 2 Essential Prime Implicants
COM111 Introduction to Computer Engineering (Fall 2006-2007) NOTES 6 -- page 11 of 12 A'EF (Maps 0 & 1) BCD' (Maps 1 & 3) B'D'F' (Maps 0 & 2) ACE' (Maps 2 & 3) ABDE' (Map 3) Y = A'EF + BCD' + B'D'F' + ACE' + ABDE' + B'DE'F + A'B'C'F
COM111 Introduction to Computer Engineering (Fall 2006-2007) NOTES 6 -- page 12 of 12 Y = A'EF + BCD' + B'D'F' + ACE' + ABDE' + B'DE'F + A'B'C'D'