Digital Fundamentals Ch4

Generated by Foxit PDF Creator © Foxit Software
http://www.foxitsoftware.com For evaluation only.
Digital
Fundamentals
Tenth Edition
Floyd
Chapter 4
© 2008
© 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights PearsonFloyd,
Reserved Education
Digital Fundamentals, 10th ed
Summary
Boolean Addition
In Boolean algebra, a variable is a symbol used to represent
an action, a condition, or data. A single variable can only
have a value of 1 or 0.
The complement represents the inverse of a variable and is indicated
with an overbar. Thus, the complement of A is A .
A literal is a variable or its complement.
Addition is equivalent to the OR operation. The sum term is 1 if one or
more if the literals are 1. The sum term is zero only if each literal is 0.
Determine the values of A, B, and C that make the sum term
of the expression A +B +C = 0?
Each literal must = 0; therefore A = 1, B = 0 and C = 1.
Floyd, Digital Fundamentals, 10th ed © 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
Summary
Boolean Multiplication
In Boolean algebra, multiplication is equivalent to the AND
operation. The product of literals forms a product term. The
product term will be 1 only if all of the literals are 1.
What are the values of the A , B and C if the

product term of A.B.C = 1?
Each literal must = 1; therefore A = 1, B = 0 and C = 0.
Summary
Commutative Laws
The commutative laws are applied to addition and
multiplication. For addition, the commutative law states
In terms of the result, the order in which variables
are ORed makes no difference.
A +B =B +A
For multiplication, the commutative law states

In terms of the result, the order in which variables
are ANDed makes no difference.
AB =BA
Summary
Associative Laws
The associative laws are also applied to addition and
multiplication. For addition, the associative law states
When ORing more than two variables, the result is
the same regardless of the grouping of the variables.
A +(B +C) =( A +B) +C
For multiplication, the associative law states

When ANDing more than two variables, the result is
the same regardless of the grouping of the variables.
A(BC) = (AB)C
Summary
Distributive Law
The distributive law is the factoring law. A common
variable can be factored from an expression just as in
ordinary algebra. That is
AB +AC =A(B+ C)
The distributive law can be illustrated with equivalent
circuits:
A
B AB
B
B+ C
C X
X A
A AC
C
A(B+ C) AB+AC
Summary
Rules of Boolean Algebra
1. A + 0 = A 7. A . A =A
2. A + 1 = 1 8. A . 𝐴 = 0
3. A . 0 = 0 9. 𝐴 = A
4. A . 1 = A 10. A +AB =A
5. A + A = A 11. A +𝐴B =A +B
6. A +𝐴 = 1 12. (A +B)(A +C) =A +BC
Summary
Rules of Boolean algebra can be illustrated with Venn
diagrams. The variable A is shown as an area.
The rule A +AB =A can be illustrated easily with a diagram.Add
an overlapping area to represent the variable B.
The overlap region between A and B represents AB .
A A
B
AB =
The diagram visually shows that A + AB = A. Other rules can be

illustrated with the diagrams as well.
Summary
Illustrate the rule A +AB = A+B with a Venn
diagram.
This time, A is represented by the blue area and B

again by the red circle. The intersection represents
AB . Notice that A + AB = A +B
A
B A AB
Summary
Rule 12, which states that ( A + B)(A +C) = A +BC, can
be proven by applying earlier rules as follows:
( A + B)(A +C) = AA +AC +AB +BC
=A +AC +AB +BC
=A(1 +C +B) +BC
=A . 1 +BC
=A +BC
This rule is a little more complicated, but it can also be

shown with a Venn diagram, as given on the following
slide…
Summary
DeMorgan’s Theorem
DeMorgan’s 1st Theorem
The complement of a product of variables is
equal to the sum of the complemented variables.
AB =A +B
Applying DeMorgan’s first theorem to gates:
A A
AB A +B Inputs Output
B B
A B 𝐴𝐵 𝐴 + 𝐵
NAND Negative-OR 0 0 1 1
0 1 1 1
1 0 1 1
1 1 0 0
Summary
DeMorgan’s 2nd Theorem
The complement of a sum of variables is equal to
the product of the complemented variables.
A + B =A . B
Applying DeMorgan’s second theorem to gates:
A A Inputs Output
B A +B AB
NOR Negative-AND A B 𝐴 + 𝐵 𝐴𝐵
0 0 1 1
0 1 0 0
1 0 0 0
1 1 0 0
Summary
Apply DeMorgan’s theorem to remove the

overbar covering both terms from the
expression X =𝐶 + 𝐷.
To apply DeMorgan’s theorem to the expression,

you can break the overbar covering both terms and
change the sign between the terms. This results in
X =𝐶. 𝐷 .Deleting the double bar gives X = C. 𝐷
Summary
Boolean Analysis of Logic Circuits
Combinational logic circuits can be analyzed by writing

the expression for each gate and combining the
expressions according to the rules for Boolean algebra.
Apply Boolean algebra to derive the expression for X .
Write the expression for each gate:

A (A + B )
C (A + B )
B
C X = C (A + B )+D
D
Applying DeMorgan’s theorem and the distribution law:

X = C (A B) + D = A B C + D

Digital Fundamentals Ch4

Uploaded by

Copyright:

Available Formats

Digital Fundamentals Ch4

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

Digital Fundamentals Ch4

Uploaded by

Copyright:

Available Formats

Generated by Foxit PDF Creator © Foxit Software

http://www.foxitsoftware.com For evaluation only.

Each literal must = 0; therefore A = 1, B = 0 and C = 1.

What are the values of the A , B and C if the

For multiplication, the commutative law states

For multiplication, the associative law states

The diagram visually shows that A + AB = A. Other rules can be

This time, A is represented by the blue area and B

This rule is a little more complicated, but it can also be

Apply DeMorgan’s theorem to remove the

To apply DeMorgan’s theorem to the expression,

Combinational logic circuits can be analyzed by writing

Write the expression for each gate:

Applying DeMorgan’s theorem and the distribution law:

You might also like