ENGN 100 Week 4 Boolean Algebra and Logic Simplification - Continued

Chapter 4
Boolean Algebra and Logic

Simplification
(continued)
sibt.nsw.edu.au navitas.com
Boolean Expressions and Truth Tables
• All Boolean expressions can be converted into

truth table format.
• Conversely, all truth tables can reveal a Boolean
expression associated with them.
• These conversions are extremely critical in
designing logic circuits.
• SOP and POS are treated differently to link
Boolean expressions and truth tables.
• SOPs are linked with 1s in Booleans expressions
or truth tables.
• Whereas, POS are related with 0s.
Boolean Expressions and Truth
Tables
• SOP to Truth Table

• Develop a truth table for the standard SOP
expression 𝐴 𝐵 𝐶 + 𝐴𝐵 𝐶 + 𝐴𝐵𝐶.
• This expression will generate a 1 if any of the
product term is 1.
• And each product term will be 1 if all literals
in it are 1.
• There are 3 variables in this expression, list
their all possible combinations.
• Mark the combinations where each product
term is 1.
• Mark all other combinations, the given
expression will be 0 at these combinations.
Tables
• SOP to Truth Table
Tables
• POS to Truth Table

• Develop a truth table for the standard POS
expression (𝐴 + 𝐵 + 𝐶) ∙ (𝐴 + 𝐵 + 𝐶 ) ∙ (𝐴 +
𝐵 + 𝐶) ∙ (𝐴 + 𝐵 + 𝐶) ∙ (𝐴 + 𝐵 + 𝐶 ).
• This expression will generate a 0 if any of the
sum term is 0.
• And each sum term will be 0 if all literals in it
are 0.
• List all possible combinations of the variables.
• Mark the combinations where each sum term
is 0.
• Mark all other combinations, the given
expression will be 1 at these combinations.
Tables
• POS to Truth Table
Tables
• Truth Table to standard SOP
• Mark all the input combinations where the

output is 1.
• Convert each input combination to
corresponding product term by replacing 1 at
each variable and 0 at each complement.
• Add product terms together to reveal the
corresponding SOP.
Tables
Tables
Tables
• Truth Table to standard POS
• Mark all the input combinations where the

output is 0.
• Convert each input combination to
corresponding sum term by replacing 0 at
each variable and 1 at each complement.
• Multiply sum terms together to reveal the
corresponding POS.
Tables
Tables
The Karnaugh Map
• The methods to generate standard SOP or POS

from the truth tables are not efficient.
• The expressions achieved from these methods are

not in the simplest ones.
• Using the Karnaugh map method, we can achieve

the simplest logical expressions from a truth table
called the Minimum Expression.
The Karnaugh Map
• Karnaugh map is an array of cells.
• The number of cells is equal to the number of all

possible combinations of input variables.
• Karnaugh map for 3 input variable will have 8 cells,

for 4 input variables will have 16 cells and for 5
input variables will have 32 cells.
• Each cell represents a combination of input

variables and the corresponding output.
The Karnaugh Map
• 3 Variable Karnaugh Map
The Karnaugh Map
• 4 Variable Karnaugh Map
The Karnaugh Map
• Cell Adjacency
• Top-bottom
• Left-right
• Wrap around
 Vertical
 Horizontal
• No diagonal
Karnaugh Map SOP Minimization
• Mapping a standard SOP expression
• Mapping a non-standard SOP expression
• For example a term in SOP is simply B.

• This means B = 1, the other two variables A
and C can have any value.
• Keep B = 1 and attach all possible
combinations of A and C with it.
• Minimization for SOP

• SOP Karnaugh maps are minimized by grouping 1s.
• A group must contain either 1, 2, 4, 8, or 16 cells,
which are all powers of two. In the case of a 3-
variable map, 23 = 8 cells is the maximum group.
• Each cell in a group must be adjacent to one or
more cells in that same group, but all cells in the
group do not have to be adjacent to each other.
• Always include the largest possible number of 1s in
a group in accordance with rule 1.
• Each 1 on the map must be included in at least one
group. The 1s already in a group can be included in
another group as long as the overlapping groups
include non common 1s.
• Writing SOP expression from the map
• In a group, look for variable(s) whose value is

not changed within the group.
• If the unchanged variable is 0, it will be included
in the product term in complemented form,
otherwise as is.
• The variable(s) that change within a group will
not be a part of product term.
• Each group will produce one product term which
will added together to produce the SOP
expression
• Don’t Care Conditions

• It is not necessary to have output for all possible
combinations of input variables.
• In certain situations, some input combinations
are not allowed.
• These states are called Don’t Care conditions.
• For example, in BCD counting 4 bits are used to
count from 0 to 9.
• 4 bits can count up to 15.
• Bit combinations from 10 to 15 are Don’t Care
conditions.
• Don’t Care conditions can be used to increase
the size of a group on Karnaugh map.
Karnaugh Map POS Minimization
• Mapping a standard POS expression
Karnaugh Map POS Minimization
• Mapping a standard POS expression
• Writing POS expression from the map
• Writing POS expression from the map

ENGN 100 Week 4 Boolean Algebra and Logic Simplification - Continued

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

ENGN 100 Week 4 Boolean Algebra and Logic Simplification - Continued

Uploaded by

Copyright:

Available Formats

Chapter 4

Boolean Algebra and Logic

• All Boolean expressions can be converted into

• SOP to Truth Table

• SOP to Truth Table

• POS to Truth Table

• POS to Truth Table

• Truth Table to standard SOP

• Mark all the input combinations where the

• Truth Table to standard SOP

• Truth Table to standard SOP

• Truth Table to standard POS

• Mark all the input combinations where the

• Truth Table to standard POS

• Truth Table to standard POS

• The methods to generate standard SOP or POS

• The expressions achieved from these methods are

• Using the Karnaugh map method, we can achieve

• Karnaugh map is an array of cells.

• The number of cells is equal to the number of all

• Karnaugh map for 3 input variable will have 8 cells,

• Each cell represents a combination of input

• 3 Variable Karnaugh Map

• 4 Variable Karnaugh Map

• Mapping a standard SOP expression

• Mapping a standard SOP expression

• Mapping a standard SOP expression

• Mapping a standard SOP expression

• Mapping a standard SOP expression

• Mapping a non-standard SOP expression

• For example a term in SOP is simply B.

• Mapping a non-standard SOP expression

• Mapping a non-standard SOP expression

• Mapping a non-standard SOP expression

• Mapping a non-standard SOP expression

• Minimization for SOP

• Minimization for SOP

• Minimization for SOP

• Writing SOP expression from the map

• In a group, look for variable(s) whose value is

• Writing SOP expression from the map

• Writing SOP expression from the map

• Writing SOP expression from the map

• Don’t Care Conditions

• Don’t Care Conditions

• Don’t Care Conditions

• Don’t Care Conditions

• Mapping a standard POS expression

• Mapping a standard POS expression

• Writing POS expression from the map

• Writing POS expression from the map

You might also like