Chapter 2
Boolean algebra
and Logic functions
Part 2
Boolean algebra
Boolean algebra
A Minterm:
For an n-variable function, a minterm is a product term of n
variables in complemented or un-complemented form.
If the variable’s value is 0 complemented form.
If the variable’s value is 1 uncomplemented form.
Boolean algebra
A Minterm:
With n variables 2n minterms.
Symbol for minterm: mi , whereas i is the value of binary
combination of variables.
Example:
If X, Y and Z are the input variables, the minterms are:
X’Y’Z’ X’Y’Z X’YZ’ X’YZ XY’Z’ XY’Z XYZ’ XYZ
Boolean algebra
A Maxterm:
For an n variable function, a maxterm is a sum term of n
variables in complemented or un-complemented form.
If the value of variable is 1 complemented form.
If the value of variable is 0 uncomplemented form.
Boolean algebra
A Maxterm:
With n variables 2n maxterms.
Symbol for maxterm: Mi, whereas i is the value of binary
combination of variables.
Example:
If X, Y and Z are the input variables, the maxterms are:
X’+Y’+Z’ X’+Y’+Z X’+Y+Z’ X’+Y+Z X+Y’+Z’
X+Y’+Z X+Y+Z’ X+Y+Z
Boolean algebra
Boolean algebra
The complement of minterm is maxterm and vice versa
mi = M i
M i = mi
Boolean algebra
Standard (Canonical) forms of an expression
A switching function can be represented by several
different, but equivalent, algebraic expressions.
The standard form is a unique algebraic representation
of each function.
There are two Standard forms: SOP and POS
Boolean algebra
Standard form 1: (Standard Sum of Products - SOP)
Express a Boolean function
Whereas:
mi is the ith minterm.
Fi is the F-function’s value corresponding to the ith minterm.
Example:
Boolean algebra
Boolean algebra
Example: Express the following functions in the
Standard form 1 in term of sum of minterms.
Boolean algebra
Example:
Write the expression form of the following functions.
Boolean algebra
Standard form 2: (Standard Product of Sums - POS)
Express a Boolean function
Whereas:
Mi is the ith maxterm.
Fi is the F-function’s value corresponding to the ith maxterm.
Example:
Boolean algebra
Example: Express the following functions in the
Standard form 2 in term of product of maxterms.
Boolean algebra
Example:
Write the expression form of the following functions.
Transform the function F into Standard form 2.
Boolean algebra
Transform from the algebraic form into Truth Table form
1. Transform the expression form into Standard form 1.
Fill values “1” in the rows having the binary combinations
equals to the minterm indices of the expression. The other
rows will have F=0.
Boolean algebra
Boolean algebra
Boolean algebra
Transform from the algebraic form into Truth Table form
2. Transform the expression form into Standard form 2.
Fill values “0” in the rows having the binary combinations
equals to the maxterm indices of the expression. The other
rows will have F=1.
Boolean algebra
Boolean algebra
Boolean algebra
Transform from Truth Table form into the algebraic form
1. From the Truth Table, the Boolean function is equal to
the sum of minterms for which the output is one.
the sum of minterms (also called the standard SOP) form
Boolean algebra
Example: Write the algebraic form of the following function
Boolean algebra
Transform from Truth Table form into the algebraic form
2. From the Truth Table, the Boolean function is equal to
the product of maxterms for which the output is 0.
the product of Maxterms (also called the standard
Product of Sums) form.
Boolean algebra
Example: Write the algebraic form of the following function
Boolean algebra
“Don’t care”
In practical, there are some cases in which the binary
combinations of variables does not exist. Thus, the output
(the value of the function) corresponding to these binary
combinations can be 0 or 1 (called “don’t care”), symbol “d”.
When filling in the Truth Table for the “don’t care” cases, the
symbol “x” is used.
Boolean algebra
Example:
Write the Truth Table for F
Boolean algebra
Example:
Write the Truth Table for F
