Lecture2 Chapter2 - Canonical Forms, Other Logic Operations
Lecture2 Chapter2 - Canonical Forms, Other Logic Operations
Gates
Lecture2- Canonical Forms, Other Logic Operations
x y z G
0 0 0 0
x
0 0 1 0 x
x
0 1 0 0 x
G
0 1 1 1 x
x
1 0 0 0 x
x
1 0 1 0 x
1 1 0 1
1 1 1 1
x y z
G = xyz + xyz′ + x′yz
EE-223 Digital Logic Design Spring 2024 11
Truth Table to Expression (Product of
Maxterms)
• Any Boolean function can be expressed as a product of maxterms or
product of sums (i.e. the ANDing of terms).
➢ You can form the function algebraically by forming a maxterm for
each combination of the variables that produces a 0 in the function.
(Each row with output of 0 becomes a standard sums)
➢ AND these maxterms together.
x y z Minterm x y z Maxterm
0 0 0 x’y’z’ m0 0 0 0 x+y+z M0
0 0 1 x’y’z m1 0 0 1 x+y+z’ M1
… …
1 0 0 xy’z’ m4 1 0 0 x’+y+z M4
… …
1 1 1 xyz m7 1 1 1 x’+y’+z’ M7
EE-223 Digital Logic Design Spring 2024 14
Obtaining Sum of Minterms Form
F = (A+B+C)(Aˊ+B+C)(Aˊ+Bˊ+C)(Aˊ+Bˊ+Cˊ)
= M0 . M4 . M6 . M7
F(A, B, C) = π(0, 4, 6, 7)
EE-223 Digital Logic Design Spring 2024 16
Canonical Form Conversion
• A function represented as Sum of minterms can be represented as the
Product of maxterms of the remaining terms.
• The complement of a function expressed in sum of minterms equals the
sum of minterms missing from the original function
➢ F(A, B, C) = ∑(0, 3,4) = m0+m3+m4
➢ Fˊ(A, B, C) = ∑(1,2,5,6,7)= m1+m2+m5+m6+m7
• Now if we take the complement of F’ using DeMorgan’s theorem, we
obtain F in the product of maxterms form:
o (Fˊ)ˊ = (m1+m2+m5+m6+m7)ˊ
o F = m1ˊ . m2ˊ . m5ˊ . m6ˊ . m7ˊ [Complement of minterms]
o = M1M2M5M6M7 [maxterms]
o = π(1,2, 5, 6, 7)
• This implies the following relation:
miˊ = Mj
• So sum of minterms: ∑(0,3,4) = product of maxterms: π(1,2, 5, 6, 7)
EE-223 Digital Logic Design Spring 2024 17
Table A: Conversion of Forms
Desired Form