Scribd
Upload
11 views44 pages

Lec - 11 12 13

The document provides an overview of Boolean algebra, including its operations, laws, and rules for simplifying expressions. It discusses standard forms such as sum-of-products (SOP) and product-of-sums (POS), as well as the implementation of these forms using logic gates. Additionally, it covers DeMorgan's Theorems and the construction of truth tables for evaluating Boolean expressions.

Uploaded by

Daniya Abbasi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
11 views44 pages

Lec - 11 12 13

The document provides an overview of Boolean algebra, including its operations, laws, and rules for simplifying expressions. It discusses standard forms such as sum-of-products (SOP) and product-of-sums (POS), as well as the implementation of these forms using logic gates. Additionally, it covers DeMorgan's Theorems and the construction of truth tables for evaluating Boolean expressions.

Uploaded by

Daniya Abbasi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 44

BOOLEAN ALGEBRA

AND
LOGIC SIMPLIFICATION
• Simplification using Boolean algebra and
theorems,
• standard forms of Boolean expressions,
• Boolean expressions and truth tables,
Boolean Algebra
• Boolean Algebra is convenient and systematic way of
expressing and analyzing the operation of logic circuit.
[Those having conditions “TRUE” or “FALSE”, “HIGH” or
“LOW” or sometimes called “1” and “0”.]

• In conventional algebra, the values of the variables are


numbers, and main operation is addition, subtraction,
multiplication and division but in Boolean Algebra the
main operations are conjunction (AND), disjunction
(OR) and negation (NOT).
Laws and rules of Boolean Algebra
• Commutative Laws:
A+B = B+A and A.B = B.A
• Associative Laws :
A + (B + C) = (A + B) + C

• A(BC) = (AB)C
• Distributive Law:
A(B + C) = AB + AC
Summary
Commutative Laws:
A+B = B+A A.B = B.A

Associative Laws :
A + (B + C) (A + B) + C

Distributive Law:
A(B + C) AB + AC
Rules of Boolean Algebra
• Table lists 12 basic rules that are useful in manipulating and
simplifying Boolean expressions. Rules 1 through 9 will be
viewed in terms of their application to logic gates. Rules 10
through 12 will be derived in terms of the simpler rules and
the laws
• Rule 1. A + 0 = A

• Rule 2. A + 1 = 1

• Rule 3. A . 0 = 0
• Rule 4. A . 1 = A

• Rule 5. A + A = A

• Rule 6. A + A’ = 1
• Rule 7. A . A = A

• Rule 8. A . A’ = 0

• Rule 9. A = A’’
• Rule 10. A + AB = A
Proof:
A + AB = A( 1 + B) Factoring (distributive law)
=A.l Rule 2: (1 + B) = 1
=A Rule 4: A . 1 = A
Proof: Rule 11. A + A’B = A + B
Rule 11. A + A’B = A + B
DEMORGAN’s Theorem &
Boolean Simplification
DeMorgan’s theorems provide the
mathematical verification of the equivalency
of the NAND and negative-OR gates and the
equivalency of the NOR and negative-AND
gates.

DeMorgan’s first theorem states that “The


compliment of a product of variables is equal
to the sum of the compliments of the
variables individually.”
DeMorgan’s second law states that “The
compliment of a sum of variables is equal to
the product of the compliments of the
variables individually.”

DeMorgan’s law proof for equivalent logic gates


ADVANTAGES

DeMorgan's Theorem is useful in the


implementation of the basic gate operations
with alternative gates, particularly
with NAND and NOR gates which are readily
available in IC form.
Standard form of Boolean expression
• the sum-of-products form
• the product-of-sums form.

• Standardization makes the evaluation,


simplification, and implementation of Boolean
expressions much more systematic and easier.
The Sum-of-Products (SOP) Form
When two or more product terms are summed
by Boolean addition, the resulting expression is
a sum-of-products (SOP). Some examples are
AND/OR Implementation of an SOP
Expression
• Implementing an SOP expression simply requires ORing the
outputs of two or more AND gates. A product term is
produced by an AND operation, and the sum (addition) of two
or more product terms is produced by an OR operation.
Therefore, an SOP expression can be implemented by AND-OR
logic.
NAND/NOR Implementation of an SOP
Expression
• An SOP expression is equal to 1 only if one or
more of the product terms in the expression is
equal to 1.
The Product-of-Sums (POS) Form
• When two or more sum terms are multiplied,
the resulting expression is a product-of-sums
(POS). Some examples are
Implementation of a POS Expression
• Implementing a POS expression requires ANDing the outputs of two or
more OR gates. Therefore, a POS expression can be implemented by logic
in which the outputs of a number of OR gates connect to the inputs of an
AND gate, (A + B)(B + C + D)(A + C). The output X of the AND gate equals
the POS expression.
The Standard POS Form
• For example, the expression
• A POS expression is equal to 0 only if one or
more of the sum terms in the expression is
equal to 0.
Converting Standard SOP to Standard POS

To convert from standard SOP to standard POS, the


following steps are taken:
• 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. Using a
similar procedure, you can go from POS to SOP.
Boolean Expressions and Truth Tables
• The first step in constructing a truth table is to list all possible
combinations of binary values of the variables in the
expression.
• Next, convert the SOP expression to standard form if it is not
already.
• Finally, place a 1 in the output column (X) for each binary
value that makes the standard SOP expression a 1 and place a
0 for all the remaining binary values.
Determining Standard Expressions from a
Truth Table
THANK YOU

You might also like