1.6 Boolean Functions
1.6 Boolean Functions
MODULE 1
1.1 Number Systems: Binary, Octal, Hexadecimal
Boolean Function
Canonical SOP
Each product term contains all literals. So, these product terms are nothing but
the Minterms. Hence, canonical SoP form is also called as Sum of
Minterms(SOM) form. Eg. F = AB’C’ + ABC
Canonical POS
Each sum term contains all literals. So, these sum terms are nothing but the
Maxterms. Hence, canonical PoS form is also called as Product of Max
terms(POM) form. Eg. F = (a'+b+c’). (a+b'+c)
Implementation of SOP
Introduction to SOP
SOP Minimization
Implementation of POS
Introduction to POS
POS Minimization
• Sum terms which contain all the variables of a Boolean function are
called "canonical sum terms", or "maxterms".
• (A+B+C) is an example of a maxterm in a three variable logic
function.
Minterms
• A minterm is a product of all variables taken either in their direct or
complemented form.
• n variables combined with AND operation, 2n combinations.
• if the variable is 0, A‘.
• if the variable is 1, A.
Table of Minterms:
x y z Minterms
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
Maxterms
• A Maxterm is a sum of all variables taken either in
their direct or complemented form.
• n variables combined with OR
• if the variable is 0, A.
• if the variable is 1, A‘.
Table of Maxterms
x y z Maxterms
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
3. Obtain the truth table of the following functions, and express each
function in sum‐of‐minterms and product‐of‐maxterms form:
(b+cd)(c+bd)
Next Session...