Академический Документы
Профессиональный Документы
Культура Документы
Distributive Laws
Complement Laws
Identity Laws
BOOLEAN ALGEBRA
The operations +, ∗, and ‘ are called sum, product, and complement,
respectively.
Boolean Algebra is the mathematics of digital systems.
Definition of terms
Variable- symbol used to represent a logical quantity. Any variable can
have a value of 1 or 0.
Complement- inverse of a variable. or
Literal is a variable/ complement of a variable.
Boolean addition is equivalent to the OR operation.
Basic rules for Boolean addition:
Boundedness laws:
Absorption laws:
Involution law:
BOOLEAN ALGEBRA
De Morgan Laws
The complement of a sum of variables is equal to the product of the
complements of the variables
The complement of a product of variables is equal to the sum of the
complements of the variables
BOOLEAN ALGEBRA
Simplification
of Boolean expressions using Boolean Algebra
Its reducing a particular expression to its simplest form or change its form to
a more convenient one.
Use basic laws, rules and theorems of Boolean Algebra
Simplified Boolean expression uses the fewest gates possible to implement
a given expression.
Example:
Simplify the following Boolean Expression:
Distinctive Shape
Symbol
Truth Table
BOOLEAN ALGEBRA
Not gate/ Inverter
performs inversion/ complementation operation- changes one logic level to
the opposite level
The negation indicator is a bubble.
BOOLEAN ALGEBRA
And Gate
Its composed of 2/ more inputs and a single output.
the total number of possible combinations of binary inputs is given
by where N is the input combinations and n is the number of input
variables.
performs logical multiplication
produces a HIGH output when all of the inputs are HIGH
.
BOOLEAN ALGEBRA
Or Gate
Its composed of 2/ more inputs and a single output.
performs logical addition.
produces a HIGH output when any of the inputs is HIGH.
.
BOOLEAN ALGEBRA
NAND
gate
Contraction of NOT-AND i.e. AND function with a complemented output.
produces a LOW output only when all of the inputs are HIGH; the output
will be HIGH when any of the inputs is LOW.
DeMorgan’s Theorem:
NOR gate
Contraction of NOT-OR i.e. OR function with a complemented output.
produces a LOW output when any of the inputs are HIGH; the output will
be HIGH when all of the inputs are LOW.
DeMorgan’s Theorem:
BOOLEAN ALGEBRA
Truth Table Distinctive Shape
Symbol
BOOLEAN ALGEBRA
Boolean algebra provides a concise way to express the operation of a logic
circuit formed by a combination of logic gates so that the output can be
determined for various combinations of input values.
To derive a Boolean expression for a given logic circuit, begin at the left-most
inputs and work towards the final output, writing the expression for each
gate.
Example:
´
𝐀 ´ ( 𝐀+ 𝐁)=𝐀
𝐀 ´ 𝐁
𝐀
( 𝐀+𝐁 ) + 𝐀´ 𝐁
𝐁
𝐀+𝐁
BOOLEAN ALGEBRA
Standard
Forms of Boolean Expressions
Standardization makes the evaluation, simplification and implementation of
Boolean expression much more systematic and easier.
Domain of Boolean expression is the set of variables contained in the
expression in complemented or un complemented form.
The domain of the expression is the set of variables
A, B, C ,D.
All Boolean expressions, regardless of their form can be converted into 2
standard forms:
Sum-of-Product
Product-of-Sum
BOOLEAN ALGEBRA
Sum
of Products
Its formed when 2 or more product terms that are summed by Boolean
addition.
It can contain a single-variable term as in
In SOP expression, a single overbar cannot extend over more than one
variable.
SOP expression can have but not
Implementing a SOP expression simply ORing the outputs of 2 or more AND
gates( AND-OR implementation of SOP expression).
SOP can be implemented by NAND-NOR.
Conversion of a general expression to SOP form is done using Boolean
algebra techniques.
A standard SOP expression is one in which all the variables in the domain
appear in each product term in the expression
NB : Important in constructing truth table and in the K-map simplification
method
BOOLEAN ALGEBRA
To
converting product terms to standard SOP
Multiply each nonstandard product term by where A is the missing
variable.
Repeat the step above until all resulting product terms contain all
variables in the domain.
A standard product term = 1 for only one combination of variable values.
A product term is implemented with an AND gate whose output is 1 only if
each of its inputs is 1.
SOP expression is =1 only if one or more product terms in the expression =1.
BOOLEAN ALGEBRA
Example:
Convert into standard SOP form.
Standard SOP
++ ++
BOOLEAN ALGEBRA
Product
of Sums
Formed when 2 or more sum terms multiplied.
A POS expression can contain a single-variable term.
In a POS expression, a single overbar cannot extend over more than one
variable.
Implementing a POS expression requires ANDing the outputs of 2 or more
OR gates.
A standard POS expression is one in which all variables in the domain is in
each sum term.
To convert sum terms to standard POS
Add to each non-standard product term where A is the missing
variable.
Apply rule
Repeat step 1, until all resulting sum terms contain all variables in the
domain.
BOOLEAN ALGEBRA
A standard sum term =0 for only one combination of variable values and is 1
for all other combinations of values for variables.
Example
Develop a truth table for the standard SOP expression .
: 001 : 111
BOOLEAN ALGEBRA
Inputs Output
A B C X Product Term
0
0 0
0 0
0 0
0
0 0 1 1
0 0 1 1
0 1 0 0
0 1 0 0
0 1 1 0
0
1 1
0 1
0 0
1
1 0 0
1 1
0
1 1
0 0
1 0
1
1 1
1 1
0 1
0
1 1 1 1
BOOLEAN ALGEBRA
Steps
considered when entering a POS expression into the
TRUTH Table
Convert the POS expression standard form
List all possible combinations of binary values of the variables in the
variables in the expressions.
Place 0 in the output column for each binary value that makes the
standard POS=0.
Place 1 for all the remaining binary values.
Example
Develop a truth table for the standard POS expression .
: 001 : 111
BOOLEAN ALGEBRA
Karnaugh Map
K map provides a systematic method for simplifying Boolean expression and
if properly used will introduce the simplest SOP/ POS expression
possible(minimum expression).
Its an array of cells in which each cell represents a binary value of the input
variable.
Cells are arranged in a way so that simplification of a given expression is a
matter of grouping the cells.
K-map can be used for expressions with 2,3,4 and 5 variables.
The Quine McClusky method can be used for higher numbers of variables.
The number of cells in a K-map = total number of possible input variable
combinations.
BOOLEAN ALGEBRA
3 variable K-map array of 8 cells
C
AB 0 1
00
00
01
01
11
11
10
10
C
Á B́C
AB 0 1
00 1
ÁB Ć
01 1
For
11
a nonstandard SOP
1 1
ABC
RULES
Groups must contain either 1,2,4,8 or 16 cells( cells).
Each cell in the group must be adjacent to 1 or more cells in that same group.
Include the largest possible number of 1s in a group.
Each 1 on the map must be included in at least 1 group. The 1s already in a
group can be included in another group.
Groups may overlap.
Maximize the size the groups and minimize the number of groups.
BOOLEAN ALGEBRA
Determination of SOP expressions from K-map
Each group of cells containing 1s creates one product term composed of variables that stay
the same within a group . i.e. variables that do not change from in complemented to
uncomplemented or vice versa.
CD
A group of 8 cells AB 00 01 11 10
formed by adjacent 1 1 1
00
outer column produces
01 1 1
A group of 4 cells 11 1 1
formed by adjacent 10 1 1 1
outer column produces
Minimum expression +
BOOLEAN ALGEBRA
With
POS expressions in standard form, 0s representing the standard
terms are on the K-map.
Example
Map the standard POS expression on the K-map
Example
Map the standard POS expression on the K-map
BOOLEAN ALGEBRA
Conversion
between POS and SOP using the K-map
With POS expressions, all cells that do not contain 0s contain 1s from which
SOP expression is derived.
Likewise for an SOP expression, all the cells that do not contain 1s contain
0s, from which the POS expression is derived.
This provides a good way to compare both minimum forms of an expression
to determine if one of them can be implemented with fewer gates than the
other.
Example
Convert the following standard POS expression into a minimum POS
expression, a standard SOP expression and a minimum SOP expression