0% found this document useful (0 votes)
80 views19 pages

Boolean Algebra: Digital Electronics

The document discusses Boolean algebra and its applications in digital electronics. It defines Boolean algebra as a mathematical technique that can simplify logic expressions and reduce the number of gates needed in a logic circuit. It then provides examples of using Boolean theorems like consensus, distribution, association and commutation to simplify expressions into sum of products form.

Uploaded by

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

Boolean Algebra: Digital Electronics

The document discusses Boolean algebra and its applications in digital electronics. It defines Boolean algebra as a mathematical technique that can simplify logic expressions and reduce the number of gates needed in a logic circuit. It then provides examples of using Boolean theorems like consensus, distribution, association and commutation to simplify expressions into sum of products form.

Uploaded by

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

Boolean Algebra

Digital Electronics
What is Boolean Algebra ?
Boolean Algebra is a mathematical technique that provides
the ability to algebraically simplify logic expressions. These
simplified expressions will result in a logic circuit that is
equivalent to the original circuit, yet requires fewer gates.

BC A Z
C A B A BC Z
Simplification
With Boolean
Algebra
2
George Boole
My name is George Boole and I lived in
England in the 19th century. My work
on mathematical logic, algebra, and the
binary number system has had a
unique influence upon the
development of computers. Boolean
Algebra is named after me.
3
X
0
0
0 0 X
X Y Z
0 0 0
0 1 0
1 0 0
1 1 1
X 1 X
X
1
X
X X X
X
X
X
X
0
X
0 X X
Boolean Theorems (1 of 7)
X Y Z
0 0 0
0 1 0
1 0 0
1 1 1
X Y Z
0 0 0
0 1 0
1 0 0
1 1 1
X Y Z
0 0 0
0 1 0
1 0 0
1 1 1
Single Variable - AND Function
Theorem #1 Theorem #2 Theorem #3 Theorem #4
4
X
0
X
X 0 X 1 1 X
X Y Z
0 0 0
0 1 1
1 0 1
1 1 1
X X X
1 X X
Boolean Theorems (2 of 7)
X Y Z
0 0 0
0 1 1
1 0 1
1 1 1
X Y Z
0 0 0
0 1 1
1 0 1
1 1 1
X Y Z
0 0 0
0 1 1
1 0 1
1 1 1
X
1
1
X
X
X
X
1
X
Single Variable - OR Function
Theorem #5 Theorem #6 Theorem #7 Theorem #8
5
X X
0 1 0
1 0 1
Single Variable - Invert Function
Boolean Theorems (3 of 7)
X
X
X
X X X
Theorem #9
6
Example #1: Boolean Algebra
Example
Simplify the following Boolean expression and note the
Boolean theorem used at each step. Put the answer in
SOP form.
D C C B A A F
1
7
Example #1: Boolean Algebra
Solution
B A F
B A F
0 B A F
D 0 B A F
D C C B A F
D C C B A A F





1
1
1
1
1
1
; Theorem #3
; Theorem #4
; Theorem #1
; Theorem #5
Example
Simplify the following Boolean expression and note the
Boolean theorem used at each step. Put the answer in
SOP form.
D C C B A A F
1
8
Example #2: Boolean Algebra
Example
Simplify the following Boolean expression and note the
Boolean theorem used at each step. Put the answer in
SOP form.
0 B A 1 B A C C B C B B F
2
9
Example #2: Boolean Algebra
Example
Simplify the following Boolean expression and note the Boolean
theorem used at each step. Put the answer in SOP form.
Solution
B A C B F
B A C B F
0 B A C B F
0 B A B A C B F
0 B A 1 B A C B F
0 B A 1 B A C B C B F
0 B A 1 B A C C B C B B F







2
2
2
2
2
2
2
; Theorem #3 (twice)
; Theorem #7
; Theorem #2
; Theorem #1
; Theorem #5
0 B A 1 B A C C B C B B F
2
10
Boolean Theorems (4 of 7)
X Y Y X
X Y Y X
Commutative Law
Theorem #10A AND Function
Theorem #10B OR Function
11
Boolean Theorems (5 of 7)
Z Y) (X Z) (Y X
Z Y) (X Z) (Y X
Associative Law
Theorem #11A AND Function
Theorem #11B OR Function
12
Boolean Theorems (6 of 7)
YZ YW XZ XW Z) Y)(W X (
Z X Y X Z) (Y X
Distributive Law
Theorem #12A AND Function
Theorem #12B OR Function
13
Example #3: Boolean Algebra
Example
Simplify the following Boolean expression and note the
Boolean theorem used at each step. Put the answer in
SOP form.
T) R )( S (R T R F
3

14
Example #3: Boolean Algebra
Example
Simplify the following Boolean expression and note the Boolean
theorem used at each step. Put the answer in SOP form.
T) R )( S (R T R F
3

Solution




R S T F
R S 1 T F
R S S 1 T F
R S S R R T F
T S R S T R T R F
T S R S T R 0 T R F
T S R S T R R R T R F
T R S R T R F
3
3
3
3
3
3
3
3








; Theorem #12B
; Theorem #4
; Theorem #5
; Theorem #12A
; Theorem #8
; Theorem #6
; Theorem #2
15
Boolean Theorems (7 of 7)
Y X Y X X
Y X Y X X
Y X Y X X
Y X Y X X
Consensus Theorem
Theorem #13A
Theorem #13B
Theorem #13C
Theorem #13D
16
Example #4: Boolean Algebra
Example
Simplify the following Boolean expression and note the
Boolean theorem used at each step. Put the answer in
SOP form.
S Q P S Q P S P F
4

17
Example #4: Boolean Algebra
Example
Simplify the following Boolean expression and note the Boolean
theorem used at each step. Put the answer in SOP form.
S Q P S Q P S P F
4





Q P PS F
Q P 1 PS F
Q P Q 1 PS F
S Q P Q P S P F
S Q P Q S P F
S Q P S Q S P F
S Q P S Q P S P F
4
4
4
4
4
4
4







; Theorem #12A
; Theorem #13C
; Theorem #12A
; Theorem #12A
; Theorem #6
; Theorem #2
Solution
18
Summary
X X 9)
1 X X 8)
X X X 7)
1 1 X 6)
X 0 X 5)
0 X X 4)
X X X 3)
X 1 X 2)
0 0 X 1)













Y X Y X X 13D)
Y X Y X X 13C)
Y X XY X 13B)
Y X Y X X 13A)
YZ YW XZ XW Z W Y X 12B)
XZ XY Z Y X 12A)
Z Y X Z Y X 11B)
Z XY YZ X 11A)
X Y Y X 10B)
X Y Y X 10A)










Commutative
Law
Associative
Law
Distributive
Law
Consensus
Theorem
Boolean Theorems
19

You might also like