0% found this document useful (0 votes)
47 views10 pages

L4-3 Logic Simplification Using Boolean Algebra

The document discusses Boolean algebra and its application in logic simplification, covering laws, DeMorgan's Theorems, and standard forms of Boolean expressions. It includes examples of simplifying Boolean expressions and provides problems for practice. The objective is to represent logic circuits accurately and simplify expressions to use the fewest gates possible.

Uploaded by

nan susu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
47 views10 pages

L4-3 Logic Simplification Using Boolean Algebra

The document discusses Boolean algebra and its application in logic simplification, covering laws, DeMorgan's Theorems, and standard forms of Boolean expressions. It includes examples of simplifying Boolean expressions and provides problems for practice. The objective is to represent logic circuits accurately and simplify expressions to use the fewest gates possible.

Uploaded by

nan susu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

4.

Boolean Algebra and Logic Simplification

• Laws and Rules of Boolean Algebra


• DeMorgan’s Theorems
• Logic Simplification Using Boolean Algebra
• Standard Forms of Boolean Expressions
• Boolean Expressions and Truth Tables
Logic Simplification Using Boolean Algebra

Lesson Outlines
1. Boolean Analysis of Logic Circuits
2. Logic Simplification Using Boolean Algebra

Lesson Objectives

▪ To know how to represent a logic circuit with Boolean expression and Truth Table
▪ To understand a simplify Boolean expression which uses the fewest gates possible
to implement a given expression

2

Faculty of Computer Systems and Technologies 8
Logic Simplification Using Boolean Algebra

1. Boolean Analysis of Logic Circuits

Boolean Expression for a Logic Circuit

X = A(B + CD)

3

Faculty of Computer Systems and Technologies 8
Logic Simplification Using Boolean Algebra
Truth Table for a Logic Circuit

4

Faculty of Computer Systems and Technologies 8
Logic Simplification Using Boolean Algebra
2. Logic Simplification Using Boolean Algebra
EXAMPLE 4 ̶ 3.1 Using Boolean algebra techniques, simply this expressions:
( AB + A(B + C ) + B( B+C )
Solution:
( AB + A(B + C ) + B( B+C )
= AB + AB + AC + BB + BC
= AB + AC + B + BC
= A B+ AC + B.1
= AB + AC + B
= B ( A + 1 ) + AC
= B (1 ) + AC
= B + AC 5

Faculty of Computer Systems and Technologies 8
Logic Simplification Using Boolean Algebra
EXAMPLE 4 ̶ 3.2
Simplify the following Boolean expression:
[A ഥB( C+ BD) + ഥABഥ ] C

Solution:
[A ഥB( C+ BD) + ഥABഥ ] C
= [(A ഥBC + A ഥB BD) + ഥABഥ ] C
= [A ഥBC + ഥABഥ ] C
ഥBഥ C
= A ഥBCC + A
ഥBഥ C
= A ഥBC + A
ഥ)
= ഥBC (A + A
= ഥBC . 1
= ഥBC 6

Faculty of Computer Systems and Technologies 8
Logic Simplification Using Boolean Algebra
EXAMPLE 4 ̶ 3.3
Simplify the following Boolean expression:
Aഥ BC + A ഥBCഥ + ഥABഥ Cഥ + A B C + ABC
Solution:
Aഥ BC + A ഥBCഥ + ഥABഥ Cഥ + A B C + ABC
= BC (Aഥ + A)+ A ഥBCഥ + ഥABഥ Cഥ + A B C
= BC( 1 ) +A ഥB ( ഥC+ C) + ഥABഥ Cഥ
= BC + A ഥB ( 1 ) + ഥABഥ Cഥ
= BC + A ഥB + ഥABഥ Cഥ
= BC + ഥB (A + ഥACഥ )
= BC + ഥB (A + Cഥ )
ഥCത
= BC+A ഥB + B 7

Faculty of Computer Systems and Technologies 8
Logic Simplification Using Boolean Algebra
EXAMPLE 4 ̶ 3.4
Simplify the following Boolean expression:
AB + AC + ഥA ഥBC

Solution:
AB + AC + ഥA ഥBC
ഥ ഥBC
= AB . AC + A
= (Aഥ + Bഥ )(Aഥ + Cഥ ) + A
ഥ ഥBC
=( Aഥ Aഥ + Aഥ Cഥ + Aഥ Bഥ + Bഥ Cഥ ) + A
ഥ ഥBC = Aഥ + Bഥ Cഥ + A
ഥ ഥBC
ഥ ( 1 + Cത ) + Aഥ Bഥ + Bഥ Cഥ ) + A
=(A ഥ ഥBC ഥ ( 1+ ഥBC) + Bഥ Cഥ
=A
ഥ(1+B
=( A ഥ ) + Bഥ Cഥ ) + A
ഥ ഥBC ഥ + ഥBCത
=A

8

8
Faculty of Computer Systems and Technologies
Logic Simplification Using Boolean Algebra

Problems

1. Simplify the Boolean expression AB + A(B + C) + B(B + C).


2. Simplify the Boolean expression ABC + A B C + ABC + A B C .
3. Simplify the Boolean expression AB + AC + A B C.
4. Using Boolean algebra, simplify the following expressions:
(a) CE + C(E + F) + E(E + G) (b) B C D + (B + C + D) + B C D E
(c) (C + CD)(C + CD)(C + E) (d) BCDE + BC(DE) + (BC)DE
(e) BCD[BC + D(CD + BD)]

9

Faculty of Computer Systems and Technologies 8
Thank You
For Your aTTenTion

10

Faculty of Computer Systems and Technologies 10

You might also like