MODULE-2
•Basic Definitions,
Axiomatic Definition of
Boolean Algebra, Basic
Boolean Theorems and Properties
algebra of Boolean
Boolean
Algebra,
Functions,
Canonical and Standard
Forms
ECE2003 – DIGITAL LOGIC DESIGN 2
ECE2003 – DIGITAL LOGIC DESIGN 3
BOOLEAN ALGEBRA
BOOLEAN ALGEBRA INTRODUCTION
Boolean Algebra is the mathematics we use to
analyze digital gates and circuits.
We can use these “Laws of Boolean” to both
reduce and simplify a complex Boolean expression
to reduce the number of logic gates required.
Boolean Algebra is therefore a system of
mathematics based on logic that has its own set of
rules or laws which are used to define and reduce
Boolean expressions.
ECE2003 – DIGITAL LOGIC DESIGN 4
BOOLEAN ALGEBRA
LAWS OF BOOLEAN ALGEBRA
Commutative Laws: The commutative law of
addition for two variables is written as:A+B=B+A
The commutative law of multiplication for two
variables is, AB = BA
ECE2003 – DIGITAL LOGIC DESIGN 5
BOOLEAN ALGEBRA
LAWS OF BOOLEAN ALGEBRA
Associative Laws: The associative law of addition
is written as follows for three variables:
A + (B + C) = (A + B) + C
The associative law of multiplication is written as
follows for three variables:A(BC) = (AB)C
ECE2003 – DIGITAL LOGIC DESIGN 6
BOOLEAN ALGEBRA
LAWS OF BOOLEAN ALGEBRA
Distributive Law: The distributive law is written
for three variables as follows:
A(B + C) = AB + AC
ECE2003 – DIGITAL LOGIC DESIGN 7
BOOLEAN ALGEBRA
DEMORGAN’S LAW – FIRST LAW
The complement of a product of variables is equal
to the sum of the complements of the variables
The formula for expressing this theorem for two
variables is
ECE2003 – DIGITAL LOGIC DESIGN 8
BOOLEAN ALGEBRA
DEMORGAN’S LAW – SECOND LAW
The complement of a sum of variables is equal to
the product of the complements of the variables.
The formula for expressing this theorem for two
variables is
ECE2003 – DIGITAL LOGIC DESIGN 9
BOOLEAN ALGEBRA
DEMORGAN’S LAW – EXAMPLES
ECE2003 – DIGITAL LOGIC DESIGN 10
BOOLEAN ALGEBRA
RULES OF BOOLEAN ALGEBRA
Basic rules that are useful in manipulating and
simplifying Boolean expressions.
ECE2003 – DIGITAL LOGIC DESIGN 11
BOOLEAN ALGEBRA
RULES OF BOOLEAN ALGEBRA
RULE - 1
RULE - 2
RULE - 3
ECE2003 – DIGITAL LOGIC DESIGN 12
BOOLEAN ALGEBRA
RULES OF BOOLEAN ALGEBRA
RULE - 4
RULE - 5
RULE - 6
ECE2003 – DIGITAL LOGIC DESIGN 13
BOOLEAN ALGEBRA
RULES OF BOOLEAN ALGEBRA
RULE - 7
RULE - 8
RULE - 9
ECE2003 – DIGITAL LOGIC DESIGN 14
BOOLEAN ALGEBRA
RULES OF BOOLEAN ALGEBRA
ECE2003 – DIGITAL LOGIC DESIGN 15
BOOLEAN ALGEBRA
RULES OF BOOLEAN ALGEBRA
ECE2003 – DIGITAL LOGIC DESIGN 16
BOOLEAN ALGEBRA
RULES OF BOOLEAN ALGEBRA
ECE2003 – DIGITAL LOGIC DESIGN 17
BOOLEAN ALGEBRA
MINIMIZATION OF BOOLEAN EXPRESSION
(x’+ y) (x+ y)
= x’.x+ x’y+ yx+ y.y
= 0+ x’y+ xy+ y [ x.x’= 0]; [ y. y= y]
= y ( x’+ x+ 1)
= y( 1 ) [ 1+ x = 1 ]
= y.
ECE2003 – DIGITAL LOGIC DESIGN 18
BOOLEAN ALGEBRA
MINIMIZATION OF BOOLEAN EXPRESSION
xy+ xyz+ xyz’+ x’yz
= xy ( 1+ z+ z’)+ x’yz
= xy ( 1 ) + x’yz [ 1+ x = 1 ]
= xy+ x’yz
= y ( x+ x’z ) [ x+ x’y = x+ y]
= y ( x+ z ).
ECE2003 – DIGITAL LOGIC DESIGN 19
BOOLEAN ALGEBRA
MINIMIZATION OF BOOLEAN EXPRESSION
x’yz+ xy’z’+ x’y’z’+ xy’z+ xyz
= yz (x’+x) + xy’z’+ x’y’z’+ xy’z
= yz (1) + y’z’ (x+ x’) + xy’z [ x+ x’= 1]
= yz+ y’z’ (1) + xy’z [ x+ x’= 1]
= yz+ y’z’+ xy’z
= yz+ y’ (z’+ xz)
= yz+ y’ (z’+ x) [ x’+ xy = x’+ y]
= yz+ y’z’+ xy’
ECE2003 – DIGITAL LOGIC DESIGN 20
BOOLEAN ALGEBRA
MINIMIZATION OF BOOLEAN EXPRESSION
xy+ xy’( x’z’)’
= xy+ xy’ (x’’+ z’’)
= xy+ xy’ (x+ z) [x’’ = x]
= xy+ xy’x+ xy’z
= xy+ xy’+ xy’z [x. x= x]
= xy+ xy’ [1+ z]
= xy+ xy’ [1] [1+ x = 1]
= xy+ xy’
= x( y+ y’)
= x [1] [x+ x’= 1]
=x
ECE2003 – DIGITAL LOGIC DESIGN 21
BOOLEAN ALGEBRA
MINIMIZATION OF BOOLEAN EXPRESSION
[(xy)’+ x’+ xy]’
= [ x’+ y’+ x’+ xy]’
= [ x’+ y’+ xy]’ [x+ x= x]
= [x’+ y’+ x]’ [ x’+ xy = x’+ y]
= [y’+ 1]’ [ x+ x’= 1]
= [ 1 ]’ [ 1+ x = 1 ]
= 0.
ECE2003 – DIGITAL LOGIC DESIGN 22
BOOLEAN ALGEBRA
MINIMIZATION OF BOOLEAN EXPRESSION - EXERCISE
1. xyz+ xy’z+ xyz’ = x(y+ z)
2. w’xyz’+ xyz’+ xy’z’+ xy’z = xz
3. w’xy’z+ w’xyz+ wxz = xz
4. AB + (AC)' + AB’C (AB + C) = 1
5. x’y’z’+ x’y’z+ x’yz’+ x’yz+ xy’z’ = x’+ y’z’
6. (x+ y) (x’z’+ z) (y’+ xz)’ = x’y
ECE2003 – DIGITAL LOGIC DESIGN 23
ECE2003 – DIGITAL LOGIC DESIGN 24
CANONICAL AND STANDARD FORMS
BOOLEAN EXPRESSION FOR A LOGIC CIRCUIT
To derive the Boolean expression for a given logic
circuit, begin at the left-most inputs and work
toward the final output, writing the expression for
each gate.
ECE2003 – DIGITAL LOGIC DESIGN 25
CANONICAL AND STANDARD FORMS
CONSTRUCTING A TRUTH TABLE FOR A LOGIC CIRCUIT
Truth table shows the output for all possible values
of the input variables can be developed.
The procedure requires that you evaluate the
Boolean expression for all possible combinations
of values for the input variables.
The first step is to list the sixteen input variable
combinations of 1’s and 0’s in binary sequence.
Next apply the inputs to the circuit and find the
output, enter it in the output column of truth
table.
ECE2003 – DIGITAL LOGIC DESIGN 26
CANONICAL AND STANDARD FORMS
CONSTRUCTING A TRUTH TABLE FOR A LOGIC CIRCUIT
ECE2003 – DIGITAL LOGIC DESIGN 27
CANONICAL AND STANDARD FORMS
Standard form: In a standard form we don’t have
to compulsorily write all the literals in all the
terms of an expression.
e.g. f = xyz + y + x
Canonical form: In a canonical form we have to
compulsorily write all the literals in all the terms
of an expression.
e.g. f = xyz+x’yz’+xy’z’
ECE2003 – DIGITAL LOGIC DESIGN 28
CANONICAL AND STANDARD FORMS
All Boolean expressions, regardless of their form,
can be represented into either of two forms:
Sum-of-Products Form (SOP)
Product-of Sums Form (POS)
Sum of Products(SOP): The logical sum of two or
more logical product terms is referred to as a sum
of products expression.
It is basically an OR operation on AND operated
variables. For example,
Y = A + BC + AB’C or Y = AB’C’ + A’BC + AB’C
ECE2003 – DIGITAL LOGIC DESIGN 29
CANONICAL AND STANDARD FORMS
Product of Sums(POS): Similarly, the logical
product of two or more logical sum terms is called
a product of sums expression.
It is an AND operation on OR operated variables.
For example, Y=(A) (B+C) (A+B’+C)
or
Y= (A+B’+C’)(A′+ B+C) (A+B’+C)
Minterm: A binary variable may appear either in
its normal form (x) or in its complement form (x’).
ECE2003 – DIGITAL LOGIC DESIGN 30
CANONICAL AND STANDARD FORMS
When two binary variables x and y combined with an
AND operation, there are four possible combinations:
x’y’, x’y, xy’ and xy
Each of these four AND terms is called as ‘minterm’.
Maxterm: In a similar fashion, when two binary
variables x and y combined with an OR operation,
there are four possible combinations:
x+ y, x+ y’, x’+ y and x’+ y’
Each of these four OR terms is called as ‘maxterm’.
ECE2003 – DIGITAL LOGIC DESIGN 31
CANONICAL AND STANDARD FORMS
ECE2003 – DIGITAL LOGIC DESIGN 32
CANONICAL AND STANDARD FORMS
DERIVING SOP AND POS FROM TRUTH TABLE
ECE2003 – DIGITAL LOGIC DESIGN 33
CANONICAL AND STANDARD FORMS
Canonical Sum of Product Expression: If each term
in SOP form contains all the literals then the SOP
is known as Standard (or) Canonical SOP form.
Example:
F (A, B, C) = AB’C+ ABC+ ABC’
The same can be expressed in a compact form by
listing the corresponding decimal-equivalent codes
of the minterms containing a function value of 1.
ECE2003 – DIGITAL LOGIC DESIGN 34
CANONICAL AND STANDARD FORMS
For example, if the canonical sum of product form
of a three-variable logic function F has the
minterms A′BC, AB′C, and ABC′, this can be
expressed as the sum of the decimal codes
corresponding to these minterms as below.
F (A,B,C) = Σ (3,5,6)
= m3 + m5 + m6
= A′BC + AB′C + ABC′
where Σ(3,5,6) represents the summation of
minterms corresponding to decimal codes 3, 5,
and 6.
ECE2003 – DIGITAL LOGIC DESIGN 35
CANONICAL AND STANDARD FORMS
Example-1: .Obtain the canonical sum of product form
of the following function, F (A, B, C) = A + BC
Solution:
The given function contains three variables A, B,
C.
The variables B and C are missing from the first
term of the expression and the variable A is missing
from the second term of the expression.
Therefore, first term is to be multiplied by (B+B′)
and (C+C′).The second term is to be multiplied by
(A+A′).
ECE2003 – DIGITAL LOGIC DESIGN 36
CANONICAL AND STANDARD FORMS
Example-2:
ECE2003 – DIGITAL LOGIC DESIGN 37
CANONICAL AND STANDARD FORMS
Canonical Product of Sum Expression:
When a Boolean function is expressed as the
logical product of all the maxterms from the rows
of a truth table, for which the value of the
function is 0, it is referred to as the canonical
product of sum expression.
The same can be expressed in a compact form by
listing the corresponding decimal equivalent codes
of the maxterms containing a function value of 0.
ECE2003 – DIGITAL LOGIC DESIGN 38
CANONICAL AND STANDARD FORMS
For example, if the canonical product of sums
form of a three-variable logic function F has the
maxterms A + B + C, A + B′+ C, and A′+ B + C′,
this can be expressed as the product of the decimal
codes corresponding to these maxterms as below,
Where ∏(0,2,5) represents the product of
maxterms corresponding to decimal codes 0, 2,
and 5.
ECE2003 – DIGITAL LOGIC DESIGN 39
CANONICAL AND STANDARD FORMS
Example-1: Obtain the canonical product of the
sum form of the following function,
F(A,B,C)=(A+B′) (B+C) (A+C′)
Solution:
In the above three-variable expression, C is missing
from the first term, A is missing from the second
term, and B is missing from the third term.
Therefore, CC′ is to be added with first term, AA′ is
to be added with the second, and BB′ is to be
added with the third term.
ECE2003 – DIGITAL LOGIC DESIGN 40
CANONICAL AND STANDARD FORMS
ECE2003 – DIGITAL LOGIC DESIGN 41
CANONICAL AND STANDARD FORMS
Example-2:
ECE2003 – DIGITAL LOGIC DESIGN 42
CANONICAL AND STANDARD FORMS
Exercises
Obtain the canonical Sum of products form of the
following function
(i). Y (A, B, C, D) = AB+ ACD
(ii). Y (A, B, C) = A+ ABC
Obtain the canonical product of sum form of the
following function
(i). Y= A. (B+ C+ A)
(ii). Y= (A+B’) (B+C) (A+C’)
ECE2003 – DIGITAL LOGIC DESIGN 43
CANONICAL AND STANDARD FORMS
CONVERTING CANONICAL SOP TO CANONICAL POS
To convert from canonical SOP to canonical POS,
the following steps are taken:
Step 1. Evaluate each product term in the SOP
expression. That is, determine the binary numbers
that represent the product terms.
Step 2. Determine all of the binary numbers not
included in the evaluation in Step 1.
Step 3. Write the equivalent sum term for each
binary number from Step 2 and express in POS
form.
ECE2003 – DIGITAL LOGIC DESIGN 44
CANONICAL AND STANDARD FORMS
CONVERTING CANONICAL SOP TO CANONICAL POS
ECE2003 – DIGITAL LOGIC DESIGN 45
