Beruflich Dokumente
Kultur Dokumente
Presentation on
Lecture 6 : Canonical and Standard forms
revisited
Presented By :
Parag Parandkar
Acknowledgement
The presenter would like to thanks and
acknowledge for the adoption of slides from
Logic and Computer Design fundamentals 4th Edition
by Charles Kime and Thomas for 2008 Pearson
Education limited.
Contents
Logic gate symbols and behavior revisited
Gate Delay
Review of Boolean Algebra
Min Terms and Max terms revisited
Observations
Converting to Sum of Min terms form
Converting to product of Max terms form
Conversion between canonical forms
Standard form
X
Z =
X Y
Z =
X +
Z =
NOT gate or
OR gate
AND gate
(AND)
(OR)
(NOT)
X Y
X +
inverter
Gate Delay
In actual physical gates, if an input changes that
causes the output to change, the output change
does not occur instantaneously.
The delay between an input change and the
output change is the gate delay denoted by tG:
1
Input
tG
tG
Output
tG = 0.3 ns
1
0
0
0.5
1.5
Time (ns)
Boolean Algebra and Logic Gates 6
Boolean Algebra
1.
+0
3.
+ 1
2.
= 1
4.
.
.
= X
= 0
5.
X+X
= X
6.
X X
7.
X+X
= 1
8.
X X
9.
X=X
Identity element
= X
Idempotence
= 0
Complement
Involution
10.
X+Y
12.
(X + Y)
14.
X(Y +
Z)
16.
X+Y
.
= X Y
Y+X
+ Z
=
X + (Y
XY + XZ
+ Z)
11.
XY
13.
(XY)
15.
17.
= YX
Z
+ YZ
.
X Y
Commutative
X(Y
=
=
Associative
Z)
(X + Y)
(X + Z)
Distributive
DeMorgan
X+Y
Boolean Algebra is defined in general by a set B that can have more than two values
A two-valued Boolean algebra is also know as Switching Algebra. The Boolean set B is restricted to
0 and 1. Switching circuits can be represented by this algebra.
The identities appear in dual pairs. When there is only one identity on a line the identity is selfdual, i. e., the dual expression = the original expression.
Sometimes, the dot symbol (AND operator) is not written when the meaning is clear
Complementing Functions
Use DeMorgan's Theorem:
1.
2.
Example: Complement F =
F = (x + y + z)(x + y + z)
xy z x y z
G = (a (b + c) + d) e
Boolean Algebra and Logic Gates 10
Minterms
Minterms are AND terms with every variable
present in either true or complemented form.
Given that each binary variable may appear
normal (e.g., x) or complemented (e.g., x ), there
are 2n minterms for n variables.
Example: Two variables (X and Y) produce
2 x 2 = 4 combinations:
(both normal)
Y (X normal, Y complemented)
Y (X complemented, Y normal)
Y (both complemented)
XY
X
X
X
Maxterms
Maxterms are OR terms with every variable in
true or complemented form.
Given that each binary variable may appear
normal (e.g., x) or complemented (e.g., x), there
are 2n maxterms for n variables.
Example: Two variables (X and Y) produce
2 x 2 = 4 combinations:
X Y (both normal)
X Y (x normal, y complemented)
X Y (x complemented, y normal)
X Y (both complemented)
Boolean Algebra and Logic Gates 13
Index
Minterm
Maxterm
m0 = x y
M0 = x + y
m1 = x y
M1 = x + y
m2 = x y
M2 = x + y
1 1
3
m3 = x y
M3 = x + y
The minterm mi should evaluate to 1 for each
combination of x and y.
The maxterm is the complement of the minterm
Boolean Algebra and Logic Gates 14
Index
Minterm
Maxterm
m0 = x y z
M0 = x + y + z
m1 = x y z
M1 = x + y + z
m2 = x y z
M2 = x + y + z
m3 = x y z
M3 = x + y + z
m4 = x y z
M4 = x + y + z
m5 = x y z
M5 = x + y + z
m6 = x y z
M6 = x + y + z
m7 = x y z
M7 = x + y + z
For Maxterms:
0 means the variable is Not Complemented and
1 means the variable is Complemented.
Standard Order
All variables should be present in a minterm or
maxterm and should be listed in the same order
(usually alphabetically)
Example: For variables a, b, c:
Maxterms (a + b + c), (a + b + c) are in standard order
However, (b + a + c) is NOT in standard order
(a + c) does NOT contain all variables
Minterms (a b c) and (a b c) are in standard order
However, (b a c) is not in standard order
(a c) does not contain all variables
Boolean Algebra and Logic Gates 17
Sum-of-Minterm (SOM)
Sum-Of-Minterm (SOM) canonical form:
Sum of minterms of entries that evaluate to 1
x
0
0
0
0
1
1
1
1
0
0
1
1
0
0
1
1
0
1
0
1
0
1
0
1
0
1
0
0
0
0
1
1
Minterm
m1 = x y z
Focus on the 1
entries
m6 = x y z
m7 = x y z
F = m1 + m6 + m7 = (1, 6, 7) = x y z + x y z + x y z
Boolean Algebra and Logic Gates 18
Sum-of-Minterm Examples
F(a, b, c, d) = (2, 3, 6, 10, 11)
F(a, b, c, d) = m2 + m3 + m6 + m10 + m11
abcd
+abcd
+abcd
+abcd
+abcd
+abcd
+abcd
+abcd
Product-of-Maxterm (POM)
Product-Of-Maxterm (POM) canonical form:
Product of maxterms of entries that evaluate to 0
x
y z
F
Maxterm
0
0
0
0
1
1
1
1
0
0
1
1
0
0
1
1
0
1
0
1
0
1
0
1
1
1
0
1
0
1
0
1
M2 = (x + y + z)
M4 = (x + y + z)
Focus on the 0
entries
M6 = (x + y + z)
Product-of-Maxterm Examples
F(a, b, c, d) = (1, 3, 6, 11)
F(a, b, c, d) = M1 M3 M6 M11
(a+b+c+d)
(a+b+c+d)
(a+b+c+d)
(a+b+c+d)
(a+b+c+d)
(a+b+c+d)
(a+b+c+d)
Observations
We can implement any function by "ORing" the minterms
corresponding to the 1 entries in the function table. A
minterm evaluates to 1 for its corresponding entry.
We can implement any function by "ANDing" the maxterms
corresponding to 0 entries in the function table. A maxterm
evaluates to 0 for its corresponding entry.
The same Boolean function can be expressed in two
canonical ways: Sum-of-Minterms (SOM) and Product-ofMaxterms (POM).
If a Boolean function has fewer 1 entries then the SOM
canonical form will contain fewer literals than POM.
However, if it has fewer 0 entries then the POM form will
have fewer literals than SOM.
Boolean Algebra and Logic Gates 22
Minterm
0
0
0
0
1
1
1
1
1
1
1
0
1
1
0
0
m0 = x y z
m1 = x y z
m2 = x y z
0
0
1
1
0
0
1
1
0
1
0
1
0
1
0
1
F = (0, 1, 2, 4, 5) =
m0 + m1 + m2 + m4 + m5 =
xyz+xyz+xyz+
m4 = x y z
m5 = x y z
xyz+xyz
0
0
0
0
1
1
1
1
1
1
1
0
1
1
0
0
0
0
1
1
0
0
1
1
0
1
0
1
0
1
0
1
Minterm
F = (3, 6, 7) =
M3 M6 M7 =
M3 = (x+y+z)
M6 = (x+y+z)
M7 = (x+y+z)
Boolean Algebra and Logic Gates 24
0
0
0
0
1
1
1
1
0
0
1
1
0
0
1
1
0
1
0
1
0
1
0
1
0
1
1
1
0
1
0
1
Minterm
Maxterm
M0 = (x + y + z)
m1 = x y z
m2 = x y z
m3 = x y z
M4 = (x + y + z)
m5 = x y z
M6 = (x + y + z)
m7 = x y z
F = m1+m2+m3+m5+m7 = (1, 2, 3, 5, 7) =
xyz+xyz+xyz+xyz+xyz
F = M0 M4 M6 = (0, 4, 6) = (x+y+z)(x+y+z)(x+y+z)
Boolean Algebra and Logic Gates 25
Function Complements
The complement of a function expressed as a
sum of minterms is constructed by selecting the
minterms missing in the sum-of-minterms
canonical form
Alternatively, the complement of a function
expressed by a Sum of Minterms form is simply
the Product of Maxterms with the same indices
Example: Given F(x, y, z) = (1, 3, 5, 7)
F(x, y, z) = (0, 2, 4, 6)
F(x, y, z) = (1, 3, 5, 7)
Boolean Algebra and Logic Gates 28
Standard Forms
Standard Sum-of-Products (SOP) form:
equations are written as an OR of AND terms
Standard Product-of-Sums (POS) form:
equations are written as an AND of OR terms
Examples:
SOP:
POS:
A B C A B
C B
(A B) (A B C ) C
(A
B C)
A B C
(A C)
A C (A
B)
( 1, 4 , 5 , 6 , 7 )
Questions:
How can we attain a simplest expression?
Is there only one minimum cost circuit?
The next part will deal with these issues
Boolean Algebra and Logic Gates 34
Terms of Use
All (or portions) of this material 2008 by Pearson
Education, Inc.
Permission is given to incorporate this material or
adaptations thereof into classroom presentations and
handouts to instructors in courses adopting the latest
edition of Logic and Computer Design Fundamentals
as the course textbook.
These materials or adaptations thereof are not to be
sold or otherwise offered for consideration.
This Terms of Use slide or page is to be included within
the original materials or any adaptations thereof.