CSC 119:Digital Logic Design

Digital Systems and Binary

Numbers
Ms. Arooma Amir
Beaconhouse National University, Lahore
Lecture 7+8
 Boolean Algebra and Logic
Simplification
Boolean Algebra: Set of rules used to simplify
the give logic expressions without changing its
functionality.
Boolean Algebra is used for less variables. If more
variables, K maps are used.
By using Boolean Algebra, a few number of gates
are used, operation will be faster, less power will
be used, and the system will be efficient.
 Boolean Addition
VARIABLE: 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.
For example: A+BC +AC (number of variable= 3 A,B and C).

COMPLEMENT: The complement represents the inverse of a variable

and is indicated with an overbar.

LITERAL: A literal is a variable or its complement.

Addition is equivalent to the OR operation. The sum term is 1 if one or
more of 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

 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.

Floyd, Digital Fundamentals, 10th ed

 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.
A.B = B.A

Floyd, Digital Fundamentals, 10th ed

 Associative Laws
The associative laws are also applied to addition and
multiplication. For addition, the associative law states
A + (B +C) = (A + B) + C

For multiplication, the associative law states

A.(B.C) = (A.B).C

Floyd, Digital Fundamentals, 10th ed

 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
A.(B+ C) =A.B + A.C
The distributive law can be illustrated with equivalent
circuits:
A
AB
B B
B+ C
C X
X A
A AC
C
A.(B+ C) A.B + A.C

Floyd, Digital Fundamentals, 10th ed

 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
A+(B. C) =(A+B) .( A+C)
Compare both the distributive law ( RHS and LHS )
1) A.(B+ C) =A.B + A.C
2) A+(B. C) =(A+B) .( A+C)
1) And 2) Duality
Duality: ANDOR, ORAND, 01, 10
Floyd, Digital Fundamentals, 10th ed
 Postulates and Theorem/ Rules of Boolean
Algebra
1. A + 0 = A 7. A . A = A
2. A + 1 = 1 8. A . A = 0
=
3. A 0 = 0
.
9. A = A
4. A . 1 = A 10. A + AB = A
5. A + A = A 11. A + AB = A + B
6. A + A = 1 12. (A + B)(A + C) = A + BC

Floyd, Digital Fundamentals, 10th ed

 Boolean
Algebra
 Invented by George Boole in 1854
 An algebraic structure defined by a set B = {0, 1}, together with two binary
operators (+ and ·) and a unary operator ( )

1. X+0= X 2. X .1 =X
3. X+1 =1 4. X .0 =0
5. X+X =X 6. X .X = X
7. X+X =1 8. X .X = 0
9. X=X

10. X + Y =Y + X 11. XY = YX
12. (X + Y)+ Z = X + (Y + Z) 13. (XY)Z = X(YZ)
14. X(Y +Z) = XY+XZ 15. X + YZ = (X + Y)(X + Z)
16. X + Y =X . Y 17. X . Y = X + Y

Floyd, Digital Fundamentals, 10th ed © 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
 Boolean Operator
Precedence
 The order of evaluation is:
1. Parentheses
2. NOT
3. AND
4. OR
 Consequence: Parentheses appear
around OR expressions
 Example: F = A(B + C)(C + D)
Floyd, Digital Fundamentals, 10th ed © 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
 Rules of Boolean Algebra
Rule 10, which states that A + AB = A, can be proven by
applying earlier rules as follows:
A +AB = A.1 + AB
= A.(1 + B)
=A.1
=A

This rule can also be shown with a Venn diagram, as

given on the following slide…

Floyd, Digital Fundamentals, 10th ed

 Rules of Boolean Algebra
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.

AA BB AA
AB
AB =

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

illustrated with the diagrams as well.
Floyd, Digital Fundamentals, 10th ed
 Rules of Boolean Algebra
Rule 11, which states that A + ᾹB = A+B, can be proven
by applying earlier rules as follows :
A +ᾹB = (A + Ᾱ) (A+B) distributive law
= (1) (A+B)
=A+B

This rule can also be shown with a Venn diagram, as

given on the following slide…

Floyd, Digital Fundamentals, 10th ed

 Rules of Boolean Algebra
Illustrate the rule A + AB = A + B with a Venn
diagram.

This
Thistime,
time,AAisisrepresented
representedby bythe
theblue
bluearea
areaand
andBB
again
againby
bythe
thered circle. The intersection represents
redcircle.
AB. Notice that A + AB = A + B

A
A BA
AB

Floyd, Digital Fundamentals, 10th ed

 Rules of Boolean Algebra
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…

Floyd, Digital Fundamentals, 10th ed

 Three areas represent the variables A, B, and C.
The area representing A + B is shown in yellow.
The area representing A + C is shown in red.
The overlap of red and yellow is shown in orange.

The overlapping area between B and C represents BC.

ORing with A gives the same area as before.

A B A B
A+B
A+C = BC
C C
(A + B)(A + C) A + BC
Floyd, Digital Fundamentals, 10th ed
 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 Inputs Output
AB A+B
B B
A B AB A + B
NAND Negative-OR 0 0 1 1
0 1 1 1
1 0 1 1
1 1 0 0

Floyd, Digital Fundamentals, 10th ed

 DeMorgan’s Theorem
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
A+B AB
B B
A B A + B AB
NOR Negative-AND 0 0 1 1
0 1 0 0
1 0 0 0
1 1 0 0

Floyd, Digital Fundamentals, 10th ed

 DeMorgan’s Theorem

Apply DeMorgan’s theorem to remove the

overbar covering both terms from the
expression X = C + D.

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 = C . D. Deleting the double bar gives X = C . D.

Floyd, Digital Fundamentals, 10th ed

 Logic Simplification Using Boolean Algebra

Floyd, Digital Fundamentals, 10th ed

 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 :

X = C (AB) + D = A B C + D
Floyd, Digital Fundamentals, 10th ed
 Example
Implement the logic circuit that has the
expression
x  AB C  D   using only NOR and NAND gates

Floyd, Digital Fundamentals, 10th ed © 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
 Example
Determine the output level in last example
for A=B=C=1 and D=0

Floyd, Digital Fundamentals, 10th ed © 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
 Example
Determine the output expression for the
below circuit and simplify it using
DeMorgan’s Theorem

Floyd, Digital Fundamentals, 10th ed © 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
 Boolean
Functions
Boolean Expression
x y z F
Example: F = x + y’ z
0 0 0 0
Truth Table
0 0 1 1
All possible combinations
of input variables 0 1 0 0
Logic Circuit 0 1 1 0
1 0 0 1
1 0 1 1
x F 1 1 0 1
y
z 1 1 1 1

Floyd, Digital Fundamentals, 10th ed © 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
 Logic Simplification Using Boolean Algebra
Simplify the following Boolean functions to a minimum
number of literals.
x(x’ + y)
= xx’ + xy = 0 + xy = xy.
xy + x’z + yz
= xy + x’z + yz(x + x’)
= xy + x’z + xyz + x’yz
= xy(1 + z) + x’z(1 + y)
= xy + x’z.

Floyd, Digital Fundamentals, 10th ed

 Consider the boolean function
F2 = x’y’z + x’yz + xy’
Simplify
= x’z(y’ + y) + xy’ = x’z + xy’
Logic circuit

Floyd, Digital Fundamentals, 10th ed © 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
 Logic Simplification using Boolean Algebra

Floyd, Digital Fundamentals, 10th ed

Floyd, Digital Fundamentals, 10th ed
Floyd, Digital Fundamentals, 10th ed
 Minimization
XY+XY=Y
XY+XY
Y(X +X)
Y.1
Y

Minimization (dual)
(X+Y)(X+Y)
XX + XY+YX+YY
0 + XY +YX +Y
Y(X +X) +Y
Y.(1)+Y
Y

Floyd, Digital Fundamentals, 10th ed © 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
 Absorption
X+XY=X

X·1+X·Y
X ·(I+Y)
X·1
X
Absorption (dual)
X · (X + Y) = X
(X + X) · (X+ Y)
XX + XY + XX + XY
XX + XX + XY + XY
XX + XY
X +XY
X(I+Y)
X
Floyd, Digital Fundamentals, 10th ed © 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
 Simplification
X+XY=X+Y

(X+X ). (X+ Y)
1 · (X+ Y)
X+Y

Simplification (dual)
X · (X + Y) = X · Y
(X · X) + (X · Y)
0+ X·Y
X·Y

Floyd, Digital Fundamentals, 10th ed © 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved
 Complement of a
Function
DeMorgan’s Theorm F A  B  C
F A  B  C
F A  B  C
Duality & Literal Complement

F A  B  C
F A B  C
F A  B  C
Floyd, Digital Fundamentals, 10th ed © 2009 Pearson Education, Upper Saddle River, NJ 07458. All Rights Reserved