Concepts of Boolean algebra

1
Faculty of Engineering & Technology ©M. S. Ramaiah University of Applied Sciences
 Lecture 16
Simplification Using Boolean Algebra

Lecture delivered by:

Kiran Kumar B M

2
Faculty of Engineering & Technology ©M. S. Ramaiah University of Applied Sciences
 Topics

• Simplification Using Boolean Algebra

• Constructing a Logic Circuit

3
Faculty of Engineering & Technology ©M. S. Ramaiah University of Applied Sciences
 Objectives

At the end of this lecture, student will be able to:

• Acquire the knowledge Boolean Analysis of Logic Circuits
• Construct a Logic Circuit

4
Faculty of Engineering & Technology ©M. S. Ramaiah University of Applied Sciences
 Simplification Using Boolean Algebra
A simplified Boolean expression uses the fewest gates possible to implement
a given expression

Example

Using Boolean algebra techniques, simplify this expression:

AB + A(B + C) + B(B + C)

5
Faculty
©M. S. of
Ramaiah
Engineering
University
& Technology
of Applied Sciences ©M. S. Ramaiah University of Applied Sciences
 Simplification Using Boolean Algebra
Solution
Step 1: Apply the distributive law to the second and third terms in the
expression, as follows:
AB + AB + AC + BB + BC
Step 2: Apply rule 7 (BB = B) to the fourth term.
AB + AB + AC + B + BC
Step 3: Apply rule 5 (AB + AB = AB) to the first two terms.
AB + AC + B + BC
Step 4: Apply rule 10 (B + BC = B) to the last two terms.
AB + AC + B
6
Faculty
©M. S. of
Ramaiah
Engineering
University
& Technology
of Applied Sciences ©M. S. Ramaiah University of Applied Sciences
 Simplification Using Boolean Algebra
Step 5: Apply rule 10 (AB + B = B) to the first and third terms.
B+AC
At this point the expression is simplified as much as possible.

Figure: Gate circuits for example above.

7
Faculty
©M. S. of
Ramaiah
Engineering
University
& Technology
of Applied Sciences ©M. S. Ramaiah University of Applied Sciences
 Simplification Using Boolean Algebra

Y  AB  AB C
factoring out the common term AB
Y  AB (1  C )
applying theorem 11 : (1  x  1)
Y  AB  1
applying theorem 10 : ( x  1  x )
Y  AB

8
Faculty
©M. S. of
Ramaiah
Engineering
University
& Technology
of Applied Sciences ©M. S. Ramaiah University of Applied Sciences
 Simplification Using Boolean Algebra
Y  AB  (C  A)
applying DeMorgan's theorem 20
Y  AB  (C  A)
applying DeMorgan's theorem 20
Y  A B C  A
factoring out A
Y  A (1  B  C  1)
applying theorem 11 : x  1  1
Y  A (1)
Y A
9
Faculty
©M. S. of
Ramaiah
Engineering
University
& Technology
of Applied Sciences ©M. S. Ramaiah University of Applied Sciences
 Simplification Using Boolean Algebra
Example

(x + y’)z + x’

10
Faculty
©M. S. of
Ramaiah
Engineering
University
& Technology
of Applied Sciences ©M. S. Ramaiah University of Applied Sciences
 Simplification Using Boolean Algebra
The expression and circuit on the previous page are actually equivalent to the
simplified ones below:

x’ + z

11
Faculty
©M. S. of
Ramaiah
Engineering
University
& Technology
of Applied Sciences ©M. S. Ramaiah University of Applied Sciences
 Simplification Using Boolean Algebra

12
Faculty
©M. S. of
Ramaiah
Engineering
University
& Technology
of Applied Sciences ©M. S. Ramaiah University of Applied Sciences
 Simpler expressions yield simpler hardware
• Here are the circuits resulting from the original and simplified
expressions on the previous page

13
Faculty
©M. S. of
Ramaiah
Engineering
University
& Technology
of Applied Sciences ©M. S. Ramaiah University of Applied Sciences
 Summary
• A simplified Boolean expression uses the fewest gates possible to
implement a given expression
• The logic circuit can be minimised by using simplification methods

14
Faculty
©M. S. of
Ramaiah
Engineering
University
& Technology
of Applied Sciences ©M. S. Ramaiah University of Applied Sciences