Chapter-3b - K Maps - II
Chapter-3b - K Maps - II
DESIGN
SOYIBA JAWED
FALL, 2023
CHAPTER 3 – GATE-LEVEL MINIMIZATION
2
Prime Implicants
•Prime Implicants
•All the minterms are covered.
•Minimize the number of terms.
•A prime implicant: a product term obtained by
combining the maximum possible number of adjacent
squares (combining all possible maximum numbers of
squares).
•Essential P.I.: a minterm is covered by only one
prime implicant.
•The essential P.I. must be included.
•Redundant P.I.: a minterm’s all literals are is
covered by other prime implicant(s).
Prime Implicants
• Consider F(A, B, C, D) = Σ(0, 2, 3, 5, 7, 8, 9, 10, 11, 13, 15)
• The simplified expression may not be unique
•F = BD+B'D'+CD+AD = BD+B'D'+CD+AB'
= BD+B'D'+B'C+AD = BD+B'D'+B'C+AB'
Prime Implicants
Prime Implicants
Prime Implicants
Five-Variable Map
•Map for more than four variables becomes complicated
• Five-variable map: two four-variable map (one on the top of the
other).
Example 3.8
•Simplify F = S(0, 2, 4, 6, 9, 13, 21, 23, 25, 29, 31)
F = A'B'E'+BD'E+ACE
Example 3.8
•Another Map for Example 3-8
Product of Sums Simplification
• Simplified F' in the form of sum of products
• Apply De-Morgan's theorem F = (F')'
• F': sum of products → F: product of sums
Example 3.9
• Simplify F = S(0, 1, 2, 5, 8, 9, 10) into (a) sum-of-
products form, and (b) product-of-sums form:
Example 3.9
• Simplify F = S(0, 1, 2, 5, 8, 9, 10) into (a) sum-of-
products form, and (b) product-of-sums form:
b) F' = AB+CD+BD'
a) Apply De-Morgan's theorem;
F=(A'+B')(C'+D')(B'+D)
Example 3.9
•Gate implementation of the function of Example 3.9
• In sum-of-minterm:
F ( x, y , z ) (1,3, 4,6)
• In product-of-maxterm:
F ( x, y , z ) (0, 2,5,7)
Sum-of-Minterm Procedure
•Consider the function defined in Table 3.2.
Combine the 1’s:
F ( x, y , z ) x z xz
•Combine the 0’s we will
get F in simplified form
in SOP.
•Take the complement of
F to get simplified form of F in POS form.
Don't-Care Conditions
•The value of a function is not specified for certain
combinations of variables
• BCD; 1010-1111: don't care
•F = yz + w'x'
F = S(0, 1, 2, 3, 7, 11, 15)
•F = yz + w'z
F = S(1, 3, 5, 7, 11, 15)