MODULE 3-2
MODULE 3-2
gates
• Boolean Algebra,
• Basic Theorems and properties of Boolean Algebra
Q. Determine output level from the diagram
Universal Gates
• NAND and NOR gates are considered universal because they can be
combined to create the functionality of all other basic logic gates.
XOR using NAND
XOR using NOR
Boolean Algebraic
Properties
The Commutative Property
• It applies equally to addition and multiplication.
• We can reverse the order of variables that are either added
together or multiplied together without changing the truth of the
expression.
The Associative Property
• It applies equally to addition and multiplication.
• We can associate groups of added or multiplied variables together with
parentheses without altering the truth of the equations.
The Distributive Property
• Boolean expression formed by the product of a sum, and in
reverse shows us how terms may be factored out of Boolean
sums-of-products.
Boolean Algebra Theorems
Boolean Rules for
Simplification
Boolean Rules for Simplification
• Boolean algebra finds its most practical use in the simplification of logic
circuits.
• If we translate a logic circuit’s function into symbolic (Boolean) form, and
apply certain algebraic rules to the resulting equation to reduce the number
of terms and/or arithmetic operations, the simplified equation may be
translated back into circuit form for a logic circuit performing the same
function with fewer components.
• If equivalent function may be achieved with fewer components, the result
will be increased reliability and decreased cost of manufacture.
• Several rules of Boolean algebra are used in reducing expressions to their
simplest forms.
Circuit Simplification Examples
• Let’s begin with a semiconductor gate circuit in need of
simplification.
• The “A,” “B,” and “C” input signals are assumed to be provided
from switches, sensors, or perhaps other gate circuits.
• Where these signals originate is of no concern in the task of
gate reduction.
Apply the rules of Boolean algebra to reduce the expression to its
simplest form
Apply the rules of Boolean algebra to reduce the expression to its
simplest form
Q. Write Boolean Expression for the logic diagram and Simply it
as much as possible and draw logic diagram that implements
simplified expression.
Q. Write Boolean Expression for the logic diagram
and Simply it as much as possible and draw logic
diagram that implements simplified expression.
Examples of gates IC
IC 7404 (NOT Gate): IC 7408 (AND Gate): IC 7432 (OR Gate): IC 7400 (NAND Gate)
Examples of gates IC
IC 7402 (NOR Gate) IC 7486 (EX-OR Gate)
Duality
• https://www.allaboutcircuits.com/textbook/digital/chpt-
7/demorgans-theorems/