Boolean Pres14 - 1
Boolean Pres14 - 1
Isaac Hanson
Eng Dept/GTUC
AB+A(B+C)+B(B+C)
B
C
Simplification Using Boolean Algebra
AB+A(B+C)+B(B+C)
A
(distributive law)
AB+AB+AC+BB+BC B
C AB+A(B+C)+B(B+C)
(rule 7; BB=B)
AB+AB+AC+B+BC
(rule 5; AB+AB=AB)
AB+AC+B+BC B B+A
(rule 10; B+BC=B) C
A
AB+AC+B C
(rule 10; AB+B=B)
B+AC
Simplification Using Boolean Algebra
Try these:
[ AB (C BD) A B ]C
A BC AB C A B C AB C ABC
AB AC A B C
Standard Forms of Boolean
Expressions
All Boolean expressions, regardless of their
form, can be converted into either of two
standard forms:
The sum-of-products (SOP) form
The product-of-sums (POS) form
Standardization makes the evaluation,
simplification, and implementation of
Boolean expressions much more systematic
and easier.
Sum-of-Products (SOP)
The Sum-of-Products (SOP) Form
An SOP expression In an SOP form, a
when two or more single overbar cannot
product terms are extend over more than
summed by Boolean one variable; however,
addition. more than one variable
Examples: in a term can have an
AB ABC overbar:
ABC CDE B CD example: A B C is
A B A BC AC OK!
Also: ABC
A A B C BCD But not:
Implementation of an SOP
X=AB+BCD+AC
AND/OR implementation NAND/NAND implementation
A A
B B
B B
C X C X
D D
A A
C C
General Expression SOP
AB C AB C ( D D ) AB CD AB CD
A B A B (C C ) A B C A B C
A B C ( D D ) A B C ( D D ) A B CD A B CD A B C D A B C D
AB C A B ABC D AB CD AB CD A B CD A B CD A B C D A B C D ABC D
Binary Representation of a Standard
Product Term
A standard product term is equal to 1 for only
one combination of variable values.
Example: AB CD is equal to 1 when A=1, B=0, C=1,
and D=0 as shown below
AB CD 1 0 1 0 1 1 1 1 1
And this term is 0 for all other combinations of values
for the variables.
Product-of-Sums (POS)
The Product-of-Sums
When two or more sum
(POS) Form
terms are multiplied,
the result expression is
In a POS form, a single
a product-of-sums overbar cannot extend
(POS): over more than one
Examples: variable; however,
more than one variable
( A B )( A B C ) in a term can have an
( A B C )(C D E )( B C D) overbar:
(Also:
A B)( A B C )( A C ) example: A B C is
OK!
A B C
A ( A B C )( B C D ) But not:
Implementation of a POS
X=(A+B)(B+C+D)(A+C)
OR/AND implementation
A
B
B
C X
D
A
C
The Standard POS Form
A B C A B C DD ( A B C D)( A B C D )
B C D B C D AA ( A B C D )( A B C D )
( A B C )( 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)
Binary Representation of a Standard
Sum Term
A standard sum term is equal to 0 for only one
combination of variable values.
Example:A B C D is equal to 0 when A=0, B=1, C=0,
and D=1 as shown below
A B C D 0 1 0 1 0000 0
And this term is 1 for all other combinations of values
for the variables.
SOP/POS
Converting Standard SOP to
Standard POS
The Facts:
The binary values of the product terms in a given
standard SOP expression are not present in the
equivalent standard POS expression.
The binary values that are not represented in the
SOP expression are present in the equivalent POS
expression.
Converting Standard SOP to
Standard POS
What can you use the facts?
Convert from standard SOP to standard POS.
How?
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.
Converting Standard SOP to Standard
POS (example)
Convert the SOP expression to an equivalent
POS expression:
A B C A BC A BC AB C ABC
The evaluation is as follows:
000 010 011 101 111
There are 8 possible combinations. The SOP expression
contains five of these, so the POS must contain the other
3 which are: 001, 100, and 110.
( A B C )( A B C )( A B C )
Boolean Expressions & Truth
Tables
All standard Boolean expression can be
easily converted into truth table format
using binary values for each term in the
expression.
Also, standard SOP or POS expression can
be determined from the truth table.
Converting SOP Expressions to
Truth Table Format
Recall the fact:
An SOP expression is equal to 1 only if at least one of the
product term is equal to 1.
Constructing a truth table:
Step 1: List all possible combinations of binary values of
the variables in the expression.
Step 2: Convert the SOP expression to standard form if it
is not already.
Step 3: Place a 1 in the output column (X) for each binary
value that makes the standard SOP expression a 1 and
place 0 for all the remaining binary values.
Converting SOP Expressions to Truth
Table Format (example)
Develop a truth table Inputs Output Product
for the standard SOP A B C X Term
expression
0 0 0 0 ABC
A B C AB C ABC
0 0 1 1
0 1 0 0
0 1 1 0 AB C
1 0 0 1
1 0 1 0
1 1 0 0 ABC
1 1 1 1
Converting POS Expressions to
Truth Table Format
Recall the fact:
A POS expression is equal to 0 only if at least one of the
product term is equal to 0.
Constructing a truth table:
Step 1: List all possible combinations of binary values of
the variables in the expression.
Step 2: Convert the POS expression to standard form if it
is not already.
Step 3: Place a 0 in the output column (X) for each binary
value that makes the standard POS expression a 0 and
place 1 for all the remaining binary values.
Converting POS Expressions to Truth
Table Format (example)
Develop a truth table Inputs Output Product
for the standard SOP A B C X Term
expression ( A B C)
( A B C )( A B C )( A B C ) 0 0 0 0
( A B C )( A B C ) 0 0 1 1 ( A B C)
0 1 0 0 (A B C )
0 1 1 0
1 0 0 1 (A B C )
1 0 1 0 ( A B C)
1 1 0 0
1 1 1 1
Determining Standard Expression from
a Truth Table
To determine the standard SOP expression
represented by a truth table.
Instructions:
Step 1: List the binary values of the input variables for
which the output is 1.
Step 2: Convert each binary value to the corresponding
product term by replacing:
each 1 with the corresponding variable, and
each 0 with the corresponding variable complement.
Example: 1010 AB CD
Determining Standard Expression from
a Truth Table
To determine the standard POS expression
represented by a truth table.
Instructions:
Step 1: List the binary values of the input variables for
which the output is 0.
Step 2: Convert each binary value to the corresponding
product term by replacing:
each 1 with the corresponding variable complement, and
each 0 with the corresponding variable.
Example: 1001 A B C D
Determining Standard Expression from
a Truth Table (example)
I/P O/P There are four 1s There are four 0s in
SOP POS
A B C X in the output and the output and the
the corresponding corresponding
0 0 0 0 binary value are binary value are
0 0 1 0 011, 100, 110, and 000, 001, 010, and
0 1 0 0 111. 101.
011 A BC 000 A B C
0 1 1 1 100 AB C 001 A B C
1 0 0 1 110 ABC 010 A B C
1 1 0 1 X A BC AB C ABC ABC
1 1 1 1
X ( A B C )( A B C )( A B C )( A B C )
The Karnaugh Map
The Karnaugh Map
C
0 1
AB
00 ABC ABC
01 A BC A BC
11 ABC ABC
10 AB C AB C
The 4-Variable K-Map
CD
00 01 11 10
AB
00 ABC D ABCD A B CD A B CD
01 A BC D A BC D A BCD A BCD
10 AB C D AB C D AB CD AB CD
Cell Adjacency
CD
00 01 11 10
AB
00
01
11
10
K-Map SOP Minimization
10
1
Mapping a Nonstandard SOP
Expression
A Boolean expression must be in standard
form before you use a K-map.
If one is not in standard form, it must be
converted.
You may use the procedure mentioned
earlier or use numerical expansion.
Mapping a Nonstandard SOP
Expression
Numerical Expansion of a Nonstandard product
term
Assume that one of Athe
B product terms in a certain 3-variable
SOP expression is .
It can be expanded numerically to standard form as follows:
Step 1: Write the binary
C value of the two variables and attach a 0 for
the missing variable : 100.
Step 2: Write the binary
C value of the two variables and attach a 1 for
the missing variable : 100.
The two resulting binary numbers are the values of the
AB C AB C
standard SOP terms and .
If the assumption that one of the product term in a 3-
variable expression is B. How can we do this?
Mapping a Nonstandard SOP
Expression
Map the following SOP expressions on K-maps:
A AB ABC
BC A C
B C AB ABC AB CD A B C D AB CD
A C D ACD A BCD
K-Map Simplification of SOP
Expressions
After an SOP expression has been mapped,
we can do the process of minimization:
Grouping the 1s
Determining the minimum SOP expression from
the map
Grouping the 1s
C C
AB 0 1 0 1
AB
00 1 00 1 1
01 1 01 1
11 1 1 11 1
10 10 1 1
Grouping the 1s (example)
CD CD
AB 00 01 11 10 AB 00 01 11 10
00 1 1 00 1 1
01 1 1 1 1 01 1 1 1
11 11 1 1 1
10 1 1 10 1 1 1
Determining the Minimum SOP
Expression from the Map
The following rules are applied to find the
minimum product terms and the minimum
SOP expression:
1. Group the cells that have 1s. Each group of cell
containing 1s creates one product term composed
of all variables that occur in only one form (either
complemented or complemented) within the
group. Variables that occur both complemented
and uncomplemented within the group are
eliminated called contradictory variables.
Determining the Minimum SOP
Expression from the Map
2. Determine the minimum product term for each
group.
For a 3-variable map:
1. A 1-cell group yields a 3-variable product term
2. A 2-cell group yields a 2-variable product term
3. A 4-cell group yields a 1-variable product term
4. An 8-cell group yields a value of 1 for the expression.
For a 4-variable map:
1. A 1-cell group yields a 4-variable product term
2. A 2-cell group yields a 3-variable product term
3. A 4-cell group yields a 2-variable product term
4. An 8-cell group yields a a 1-variable product term
5. A 16-cell group yields a value of 1 for the expression.
Determining the Minimum SOP
Expression from the Map
3. When all the minimum product terms are derived
from the K-map, they are summed to form the
minimum SOP expression.
Determining the Minimum SOP
Expression from the Map (example)
CD
00 01 11 10 B A C AC D
AB
00 1 1 AC
01 1 1 1 1 B
11 1 1 1 1
AC D
10 1
Determining the Minimum SOP
Expression from the Map
(exercises)
C C
AB 0 1 0 1
AB
00 1 00 1 1
01 1 01 1
11 1 1 11 1
10 10 1 1
AB BC A B C B A C AC
Determining the Minimum SOP
Expression from the Map (exercises)
CD CD
AB 00 01 11 10 AB 00 01 11 10
00 1 1 00 1 1
01 1 1 1 1 01 1 1 1
11 11 1 1 1
10 1 1 10 1 1 1
A B A C AB D D AB C BC
Practicing K-Map (SOP)
AB C A BC A B C A B C AB C
B AC
B C D A BC D ABC D A B CD AB CD
A B CD A BCD ABCD AB CD
D BC
Mapping Directly from a Truth
Table
I/P O/P
A B C X C
0 1
0 0 0 1 AB
0 0 1 0
00 1
0 1 0 0
0 1 1 0 01
1 0 0 1
11 1
1 0 1 0 1
1 1 0 1
10 1
1 1 1 1
“Don’t Care” Conditions
Sometimes a situation arises in which some input
variable combinations are not allowed, i.e. BCD code:
There are six invalid combinations: 1010, 1011, 1100, 1101,
1110, and 1111.
Since these unallowed states will never occur in an
application involving the BCD code they can be
treated as “don’t care” terms with respect to their
effect on the output.
The “don’t care” terms can be used to advantage on
the K-map (how? see the next slide).
“Don’t Care” Conditions
INPUTS O/P CD
A B C D Y 00 01 11 10
0 0 0 0 0 AB
0 0 0 1 0
0 0 1 0 0 00
01 1
0 0 1 1 0
0 1 0 0 0
0
0
1
1
0
1
1
0
0
0
11 x x x x
0
1
1
0
1
0
1
0
1
1
10 1 1 x x
1 0 0 1 1
Without “don’t care”
1 0 1 0 X
Y AB C A BCD
1 0 1 1 X
1 1 0 0 X
1 1 0 1 X With “don’t care”
Y A BCD
1 1 1 0 X
1 1 1 1 X
K-Map POS Minimization
C
0 1
AB A
00 0 0 A( B C )
01 0
AB AC
0
11 AC
0 1
B C
10 1 1 AB
Rules of Boolean Algebra
1. A 0 A 7. A A A
2. A 1 1 8. A A 0
3. A 0 0 9. A A
4. A 1 A 10. A AB A
5. A A A 11 . A A B A B
6. A A 1 12.( A B )( A C ) A BC
___________________________________________________________
A, B, and C can represent a single variable or a combination of variables.
Thank You.