‫بسم ميحرلا نمحرلا هللا‬

Bayan University of Science and Technology

Collage of Engineering

Biomedical Engineering Department

Digital Circuit

T. Ryan Osman
 Lec5
Boolean Algebra
Minterms and Maxterms
Timing diagram(waveforms):
 Timing diagram of AND, OR, NOT gates:
 Notes:
 Waveforms provide another approach for
representing functionality.
 Values are either high (logic 1) or low (logic 0).
 Example:
Find output X from the below timing diagram of 2
input A,B for AND , OR gates .
 Solve:

A AND B

A OR B
Complement of a Function:
 If the function is F=x+yz then the complement of
this function is F’ = (x+yz)’
 The complement function can simplified by using
the rules of Boolean algebra.
 For example:

 F’ = (x+yz)’= x’.(yz)’ using De Morgan rule

 Example:
Find the complement of the functions F1 = x'yz' +
x'y'z and F2 = x(y'z' + yz) by applying DeMorgn's
theorems and simplified it.
 Solve:
 F1 = x'yz' + x'y'z
(F1)'= (x'yz' + x'y'z)' = (x'yz')'.(x'y'z)' = (x'+y+z').(x'+y'+z)
 F2 = x(y'z' + yz)
(F2)'= (x(y'z' + yz))' = x'+(y'z' + yz)'
= x'+(y'z')'.(yz)' = x'+(y+z)(y'+z')
= x'+(yy'+yz'+zy'+zz')
= x'+yz'+zy'
 Each variable in a Boolean expression is a literal.
 Boolean variables can appear in normal (x) or
complement form (x').
 Each AND combination of terms is a minterm.
 Each OR combination of terms is a maxterm.
 For example:
 Minterms and Maxterms for 2 binary variables:

Inputs Minterms Maxterms

x y Term Designation Term Designation
0 0 x'y' m0 x+y M0
0 1 x'y m1 x+y' M1
1 0 xy' m2 x'+y M2
1 1 xy m3 x'+y' M3
 Example:
 Minterms and Maxterms for 3 binary variables:

Inputs Minterms Maxterms

x y z Term Designation Term Designation
0 0 0 x'y'z' m0 x+y+z M0
0 0 1 x'y'z m1 x+y+z' M1
0 1 0 x'yz' m2 x+y'+z M2
0 1 1 x'yz m3 x+y'+z' M3
1 0 0 xy'z' m4 x'+y+z M4
1 0 1 xy'z m5 x'+y+z' M5
1 1 0 xyz' m6 x'+y'+z M6
1 1 1 xyz m7 x'+y'+z' M7
 Implementation of the Boolean functions and
Logic Circuit by using Minterms and Maxterms:
Notes:
 The Minterms called Sum of Product (SOP).
 The Maxterms called Product of Sum (POS).
 The Minterms and Maxterms are found from the
truth table (Minterms output=1 Maxterms output=0).
 Any Boolean function can be expressed as a sum of
Minterms (with "sum" meaning the ORing of terms).
 Example:
Write the Boolean equations and draw the logic
diagram of the circuit whose outputs are defined by
the following truth table (using the Minterms and
Maxterms).
x y z F1 F2
0 0 0 0 0
0 0 1 1 0
0 1 0 0 0
0 1 1 0 1
1 0 0 1 0
1 0 1 0 1
1 1 0 0 1
1 1 1 1 1
 Solve:
 To find Minterms from truth table: (when
output=1)
F1=m1+m4+m7 =x'y'z+xy'z'+xyz (the relation between
inputs is AND gate and between output is OR gate
(SOP)).
 To find Maxterms from truth table: (when
output=0)
F1=M0.M2.M3.M5.M6=(x+y+z)(x+y'+z)(x+y'+z')(x'+y+z')(x'
+y'+z) (the relation between inputs is OR gate and
between output is AND gate (POS)).
 Note:
 Consider the complement of a Boolean function. It
may be read from the truth table by forming a
Minterms for each combination that produces a 0 in
the function and then ORing those terms. The
complement of F1 is read as:
(F1)'=m0+m2+m3+m5+m6=(x'y'z')+(x'yz')+(x'yz)+(xy'z)+
(xyz')
 If we take the complement of (F1)' we obtain the
function F1(Maxterms)
((F1)')'=(m0+m2+m3+m5+m6)'=((x'y'z')+(x'yz')+(x'yz)+(x
y'z)+(xyz'))'
F1=M0.M2.M3.M5.M6=(x+y+z)(x+y'+z)(x+y'+z')(x'+y+z')(
x'+y'+z)
 Solve:
The circuit diagram of F1(Minterms):
z y x

x x'y'z
x
x

x xy'z' F1(SOP)
x
x

x xyz
x
x
 Solve:
The circuit diagram of F1(Maxterms):
z y x

x x+y+z
x
x
x x+y'+z
x
x
x x+y'+z' F1(POS)
x
x

x x'+y+z'
x
x
x x'+y'+z
x
x
F2: Homework
Thank you