Scribd
Upload
21 views39 pages

Lecture 6 &7 DLD

Uploaded by

m9107985
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
21 views39 pages

Lecture 6 &7 DLD

Uploaded by

m9107985
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/ 39

Boolean Algebra

Boolean Algebra
🠶 Boolean algebra is mathematics of digital systems. A basic
knowledge of Boolean algebra is to the study and analysis of
logic circuits.
🠶 Variable, complement, and literal are term used in
Boolean algebra.
🠶 A variable is a symbol (usually an uppercase letter) used to
represent a logical quantity. Any single variable can have 1 or
0 value.
🠶 The complement is the inverse of variable A=0
A=1
A literal is a basic variable in a Boolean expression. It can
either be in its original (uncomplemented) form or
complemented form.
Laws and Rules of Boolean Algebra

🠶 The basic laws of Boolean Algebra- the


commutative laws, associative laws and
Distributive laws.
🠶 Commutative laws for multiplication and
addition the associative laws for addition and
multiplication, and distributive law- are same as
in ordinary algebra.
🠶 Each of the laws is illustrated with two or three
variables but number of variables is not limited
to this.
Commutative laws for addition

• The commutative law of


addition for two variables is
written as.
A+B = B+A
This law states the order in
which the variables are ORed
makes no difference.
Commutative laws for multiplication

• The commutative law of


multiplication for two
variables is written as.
AB = BA
This law states the order in
which the variables are
ANDed makes no difference.
Associative Law for addition

• This law states that when ORing


more than two variables, the A

result is the same regardless of


the grouping of the variables.
• A+(B+C)=(A+B)+C
Associative Law for Multiplication

• This law states that it makes


no difference in what order
the variables are grouped
when ANDing more than two
variables.
• A(BC)=(AB)C
Distribution Law

• This law states that ORing two or


more variables and then ANDing
the result with a single variable is
equivalent to ANDing the single
variable with two or more
variables and then ORing the
products.
• A(B+C)=AB+AC
Boolean Algebra Rules

• 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 previously
discussed.
Continue………..
Continue
Continue……….
12 Rule proof
🠶 Rule 12: (A+B) (A+C) = A+BC this rule can be proved as
(A+B)(A+C) = AA + AC + AB + BC Distributive law
= A + AC + AB + BC Rule 7: AA = A
= A(1+C) + AB + BC Factoring
= Ax1 + AB + BC Rule 2: 1+C=1
= A(1+B) + C
Factoring
=Ax1 + BC
Rule 2: 1+B=1
=A+BC proved
DeMorgan’s Theorms
🠶 Demorgan, a mathematician who knew boole, proposed two theorms that are
an important part of Boolean algebra.

🠶 In practical terms, Demorgan’s theorems provide mathmatical verification of


the equivalency of NAND and negative-OR gates and equivalency of NOR and
negative-AND gates.
DeMorgan’s first theorem

• One of the DeMorgan’s theorem is


stated as follows:
The complement of a product of variables
is equal to the sum of complements of
each variable.

or
The complement of two or more variable
ANDed is equivalent to the OR of the
complements of the individual
variables.
XY = X + Y
DeMorgan’s Second theorem

• DeMorgan’s second theorem is stated


as follows:
The complement of a sum of variables is
equal to the product of the
complements of the variables.
or
The complement of two or more variables
ORed is equivalent to the complements
of the individual variables.
X+Y =X Y
Standard SOP and POS form

🠶 Standard SOP and POS form has all the variables in all the terms
🠶 A non-standard SOP is converted into standard SOP by using the rule
🠶 A non-standard POS is converted into standard POS by using the rule
Sum of products (sop)

🠶 When two or more product terms are summed by Boolean addition, the
resulting
expression is a sum-of-products (SOP).
Some examples are
AB + ABC
ABC + CDE + BCD
AB + ABC + AC
🠶 NAND/NAND Implementation of an SOP Expression
NAND gates can be used to implement an SOP expression. By using only
NAND gates, an AND/OR function can be accomplished, as illustrated in Figure
4–23. The first level of NAND gates feed into a NAND gate that acts as a
negative-OR gate. The NAND and negative-OR inversions cancel and the
result is effectively an AND/OR circuit.
Converting Product Terms to Standard
SOP
Step 1. Multiply each non standard product term by a term made up of
the sum of a missing variable and its complement (e.g: A+A).

Step 2. Repeat step 1 until resulting product terms contain all variables
in the domain in either complemented or uncomplemented form.

An SOP expression is equal to 1 only if one or more of the product


terms in the expression is equal to 1.

Exercise: Convert the following Boolean expression into standard SOP


form. ABC+AB+ABCD
Standard SOP form
Standard POS form
Why Standard SOP and POS
🠶 forms?
Minimal Circuit implementation by switching between Standard SOP or POS
🠶 Alternate Mapping method for simplification of expressions
🠶 PLD based function implementation
Minterms and Maxterms

🠶 Minterms: Product terms in Standard SOP form


🠶 Maxterms: Sum terms in Standard POS form
🠶 Binary representation of Standard SOP product terms
🠶 Binary representation of Standard POS sum terms
Minterms and Maxterms & Binary
representations
A B C Min- Max-
terms terms
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
SOP-POS Conversion
🠶 Minterm values present in SOP expression not present in corresponding POS
expression
🠶 Maxterm values present in POS expression not present in corresponding SOP
expression

Canonical Form
In case of SOP, minterm is the product of variable whose combined output is equal
to one.
In case of Pos, maxterm is the sum of variable whose combined output is equal to
0.
SOP-POS Conversion

🠶 Canonical Sum

🠶 Canonical Product

🠶 =
Boolean Expressions and Truth
Tables
🠶 Standard SOP & POS expressions converted to truth table form
🠶 Standard SOP & POS expressions determined from truth table
SOP-Truth Table Conversion

Input Output
A B C F
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 1
POS-Truth Table Conversion

Input Output
A B C F
0 0 0 1
0 0 1 0
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 1

You might also like