BOOLEAN FUNCTIONS 1
Boolean function or Switching
The variable in true or complemented form (eg: X
Function:
or Z’) is called as a Literal
consists of an algebraic
expression formed with binary
Domain of a Boolean expression is set of literals
variables, the constants 0 and 1,
contained in the expression.
the logic operation symbols,
parenthesis, and an equal sign. Eg: Domain of AB + C is A, B, and C
Eg: F(X,Y,Z) = X + Y’ Z +1
2
A function can be specified or represented in any
of the following ways:
B O O L EA N • Truth table
• Logic Circuit
F UN CT IO • Boolean expression
NS • SOP (Sum Of Products)
• POS (Product of Sums)
• Canonical SOP
• Canonical POS
MINTERMS 3
Minterms (Product terms or AND terms) Given that each binary variable may appear
normal (x) or complemented (x’), there are 2n
They are a literal or the logical product
minterms for n variables.
(AND) of multiple literals within the Eg: 2 variables (X & Y) produce 22 = 4 minterms
logic system.
Eg: X XY XYZ X’YZ’ A’BC
Variables with a value 0 can be
represented by its complement.
Eg: If x=0,y=1,z=0, then minterm is x ’ y z ’
Minterms can also be written as m with
a subscript which is decimal equivalent
of given input combination . Eg: m2
1 Sum-of-Products (SOP) Expression
4
– also called as Disjunctive Normal Form
– two or more product terms are logically added together
– Eg: X ’. Y + X Y ’ X.Y+Z X+Y
SOP &
CANONICAL
2 Canonical Sum-of-Products (SOP) Expression
SOP
– when a Boolean expression is represented purely as sum
of minterms (product terms) and every variable in the
domain must appear in each term.
– Eg: F = A B ’ C + A’ B ’ C + A B C
Can also be represented as F = Σ
(1,5,7)
– SOP: Two or more product terms are logically added 5
together.
– Eg: AB + ABC BC + CDE + B’CD’ A + A’BC
– In SOP expression, a single overbar cannot extend over Sum of
more than one variable; however, more than one
variable in a term can have an overbar.
Products
– Eg: an SOP expression can have the term A’B’C’ but not (SOP) Form
(ABC)’
Minterms:
– SOP can be implemented using 2-level AND-OR circuit 0 - complements (X’)
1 - true value (X)
6
SOP FORM
SOP FORM
AND/OR
IMPLEMENTATION
OF SOP FORM
E X E RC I S E S
1. AB+A’C+BD
2. AB’C+AB+AC
– Any logic expression can be changed into SOP form by
7
applying Boolean algebra techniques.
– Eg: A(B+CD) can be converted into SOP form by applying the
distributive law as AB + ACD CO N V E R S I O N O F A
– Exercises: GENERAL
1. Convert (A+B)(B+C+D) E X P R E S S I O N TO
2. Convert A’BC’ + (A+B’)(B+C’+AB’) S O P FO R M
– In standard SOP expression, all the variables in the domain
must appear in each product term in the expression.
– Two methods to generate standard (Canonical) SOP terms S TA N DA R D S O P
• Using Truth table FO R M ( C A N O N I C A L
• Using algebraic method SOP)
Algebraic Method for Minterm expansion 8
1. Convert the given expression in SOP form
2. In each term, if any variable is missing, multiply that
term with (missingterm +missingterm’) factor. SOP FORM
3. Expand the expression
4. Remove the duplicates
Example:
Convert F=X+Y to minterms
F = X + Y = X.1+Y.1
= X.(Y+Y’)+Y.(X+X’) EXAMPLE-
= XY+XY’+XY+X’Y ALGEBRAIC METHOD
= XY+XY’+X’Y
9
SOP FORM
EXAMPLE-
ALGEBRAIC METHOD
E X E RC I S E S
1. AB’+A’C+A’
2. ABC+A’B’+C
SOP Expression from Truth Table 10
1. For a given expression, prepare a truth table for all
possible combinations of inputs.
2. Add all the minterms which produces HIGH output.
SOP FORM
Minterms:
0 - complements (X’)
1 - true value (X)
F = A’BC + AB’C + ABC ‘ + ABC
= Σ(3,5,6,7)
A Boolean function F defined on 3 variables – A, B & C 11
is 1 iff odd number of one inputs. Draw the truth table
for the function and express it in canonical SOP form. SOP FORM
Hint: The output Z is one only for odd number of one inputs. Draw the
truth table and then add all the minterms corresponding to the high
output
Minterms:
0 - complements (X’)
1 - true value (X)
F = A’B’C + A’BC’ + AB’C ‘+ ABC
EXAMPLE-
= Σ(1,2,4,7)
T RU T H TA B L E M E T H O D
Shorthand Minterm Notation 12
1. First of all, copy original terms
2. Substitute 0’s for complements and 1’s for true
letters. SOP FORM
3. Express the decimal equivalent as subscript of m.
Example:
Example
Find the minterm designation of X Y’ Z’
Copy original term - X Y’ Z’ A B C’ D’
Substitute 1’s & 0’s - 1 0 0
1 1 0 0
Decimal Equivalent of 100 is 4, Thus X Y’ Z’ = m4
m12
Converting Shorthand Notation to minterms 13
1. Find binary equivalent of decimal subscript
2. For every 1’s write the variable as it is and for 0’s SOP FORM
SOP FORM
write variable’s complemented form.
Example:
Convert F = Σ(0,1,2,5) into canonical SOP form
F = m0 + m1 + m2 + m5
EXERCISES
000 001 010 101
1. F = m3 + m4 + m5
X’Y’Z’+X’Y’Z + X’YZ’ + XY’Z
2. F = Σ(7,12,15)
