Chapter 4 Logic Circuits &

Boolean Algebra
Laws and Rules
Theorem
Universal Gates
Combinational Logic Circuits
 Objectives

At the end of this chapter, students should be able

to:-
Apply the basic laws and rules of Boolean algebra.

Evaluate Boolean expressions.

Simplify expressions by using the laws and rules of Boolean
algebra.
Draw the logic circuit using universal gates only.
Derive the Sum-of-Products (SOP) and Product-of-Sums
(POS) from a truth table.
Design a combinational logic circuits.

10/9/2012 RA/Sept2013-Jan2014 2
 Boolean Algebra

Boolean Algebra is the mathematics of digital systems.

A variable is a symbol used to represent a logical
quantity that have a value of 1 or 0.
Example A, B
The complement is the inverse of a variable and is
indicated by a bar over the variable.
Example A, B

Three laws of Boolean Algebra are:

Commutative Distributive Associative

10/9/2012 RA/Sept2012-Jan2013 3
 Commutative Laws

This law states that the order in which the variables

Description are ORed/ANDed makes no difference.

A+B=B+A
Example AB = BA

10/9/2012 RA/Sept2012-Jan2013 4
 Associative Laws

This law states that when ORing/ANDing more than

Description two variables, the result is the same regardless of the
grouping of the variables.

A + (B + C) = (A + B) + C
Example A (BC) = (AB) C

10/9/2012 RA/Sept2012-Jan2013 5
 Distributive Laws

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 each of
the two or more variables and then ORing the
Description products.
It also expresses the process of factoring in which the
common variable A is factored out of the product
terms.

A (B + C) = AB + AC
Example AB + AC = A(B + C)

10/9/2012 RA/Sept2012-Jan2013 6
 Rules of Boolean Algebra

A.0 = 0
Rule 1 Examples: AB.0 = 0
(A+B)(C+D).0 = 0

A.1 = A
Rule 2 Examples: AB.1 = AB
(A+B)(C+D).1 = (A+B)(C+D)

A + 0 = A
Rule 3 Examples: AB + 0 = AB
A + B + 0 = A + B

A + 1 = 1
Examples: AB + 1 = 1
Rule 4 A+B+C +1 = 1
(A+B)(C+D) + 1 = 1
10/9/2012 RA/Sept2012-Jan2013 7
 Rules of Boolean Algebra

A.A=A
Examples: (AB).(AB) = AB
Rule 5 (A+B)(A+B) = A+B
A.B.A = A.B

A+A=A
Rule 6 Examples: AB + AB = AB
A+A+B+C = A+B+C

Rule 7 Examples:

Rule 8 Examples:

10/9/2012 RA/Sept2012-Jan2013 8
 Rules of Boolean Algebra

Examples:
Rule 9

Rule 10 Examples:

Examples:
Rule 11

10/9/2012 RA/Sept2012-Jan2013 9
 Simplifying Expressions using Boolean
Algebra
Example 1

Simplify
Solution:
Rule 10

Example 2
Simplify Y A A.B A.B.C
Solution: Y A A.B A.B.C
A A.B(1 C) Rule 11

A A.B
A B Rule 10

10/9/2012 RA/Sept2012-Jan2013 10
 Simplifying Expressions using Boolean
Algebra
Example 3

Prove that
Solution:
Distributive Law

Rule 10

10/9/2012 RA/Sept2012-Jan2013 11
 SOP = POS
Example

Prove that the SOP and POS expressions for an OR gate are equivalent.

SOP,
POS, Y = A + B

Solution:
Distributive Law

Rule 10

10/9/2012 RA/Sept2012-Jan2013 12
 Theorem

The complement of two or more variables ANDed is

Theorem 1 equivalent to the OR of the complements of the individual
variables.
AB = A + B

The complement of two or more variables ORed is equivalent

to the AND of the complements of the individual variables.
Theorem 2 A+B=A B

10/9/2012 RA/Sept2012-Jan2013 13
 Theorem
Example 1 Example 2

Prove that Prove that

Solution: Solution:

Example 3

Prove that
Solution

10/9/2012 RA/Sept2012-Jan2013 14
 Universality of NAND and NOR gates

NAND and NOR gates are universal gates.

It can represent basic gates which are NOT, AND and OR.

The expression is equivalent to a NOT gate.

=

The expression is equivalent to an AND gate.

The expression is equivalent to the OR gate.

10/9/2012 RA/Sept2012-Jan2013 15
10/9/2012 RA/Sept2012-Jan2013 16
 Universality of NAND and NOR gates
Example 1

Draw using only NAND gates.

1 Double invert the expression .

2 Keep the top inversion bar. Apply

bar to eliminate the OR operation.
Theorem 2 to the bottom inversion

3 Draw the circuit using only NAND gates.

10/9/2012 RA/Sept2012-Jan2013 17
10/9/2012 RA/Sept2012-Jan2013 18
10/9/2012 RA/Sept2012-Jan2013 19
 Universality of NAND and NOR gates
Example 2

Draw using only NOR gates.

1 Double invert the expression .

2 Keep the top inversion bar. Apply

bar to eliminate the AND operation.
Theorem 1 to the bottom inversion

3 Draw the circuit using only NOR gates.

10/9/2012 RA/Sept2012-Jan2013 20
10/9/2012 RA/Sept2012-Jan2013 21
10/9/2012 RA/Sept2012-Jan2013 22
 Universality of NAND and NOR gates

NAND NOR

10/9/2012 RA/Sept2012-Jan2013 23
 Sum-of-Product (SOP)
SOP expression is the sum of all product terms when
the output is a logic 1.
Description Product Term is formed by ANDing the complemented
or uncomplemented input variables.

Given the OR gate truth table with 2 inputs. Derive

Example the SOP expression.

A B Y SOP
0 0 0
0 1 1 AB
1 0 1 AB Product term

1 1 1 AB

Therefore, Y = A B + A B + A B

10/9/2012 RA/Sept2012-Jan2013 24
 Product-of-Sum (POS)
POS expression is the product of all sum terms when
the output is a logic 0.
Description Sum term is formed by ORing the complemented or
uncomplemented input variables.

Given an AND gate truth table with 2 inputs. Derive

Example the POS expression.

A B Y POS
0 0 0 A+B
0 1 0 A+B Sum terms
1 0 0 A+B
1 1 1

Therefore, Y = (A+B) ( A+B) (A+B)

10/9/2012 RA/Sept2012-Jan2013 25
 Combinational Logic Circuits

Combinational logic circuits are constructed by

connecting together logic gates.
Four steps involve in designing combinational logic
circuits are:-

Identify Simplify
Derive Draw the
1 the truth
table
2 the
Boolean 3 the
Boolean 4 logic
circuit
expression expression

10/9/2012 RA/Sept2012-Jan2013 26
 Designing Combinational Logic Circuits
Example
The diagram shown below is a water filtering system. A water quality sensing
detector will generate a quality scale from 0 7. From this scale, selected filter
will function as follows to produce clean water.
Clean Water Scale Filters
Water flow Filter
water
A B C Condition needed
The cleanest 0 No filters are
activated
Water Logic 1 A
quality circuit
sensing 2 A, B and C
detector
3 B
4 A
Scale 0 - 7 5 A and B
6 A and C
The dirtiest 7 A, B and C
Design the logic circuit. Your solution should include:
a) Truth table.
b) Simplified expression.
c) Based on the simplified expression in (b), draw the logic
circuit.
10/9/2012 RA/Sept2012-Jan2013 27