Scribd
Upload
199 views19 pages

Boolean Algebra

Boolean algebra is a mathematical technique used to simplify logic expressions through theorems. It allows logic circuits to be represented with fewer gates while maintaining equivalence to the original circuit. Some key theorems include: 1) X∙0 = 0; 2) X∙1 = X; 3) X∙X = X. Boolean algebra is named after George Boole who developed the foundations of mathematical logic and binary systems in the 19th century.

Uploaded by

Zeferinix
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
199 views19 pages

Boolean Algebra

Boolean algebra is a mathematical technique used to simplify logic expressions through theorems. It allows logic circuits to be represented with fewer gates while maintaining equivalence to the original circuit. Some key theorems include: 1) X∙0 = 0; 2) X∙1 = X; 3) X∙X = X. Boolean algebra is named after George Boole who developed the foundations of mathematical logic and binary systems in the 19th century.

Uploaded by

Zeferinix
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.

Z BC AB A C

Z A BC

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.

Boolean Theorems (1 of 7)
Single Variable - AND Function
Theorem #1

Theorem #2

Theorem #3

Theorem #4

X 0 0

X 1 X

XX X

XX0

X
0

X
1

X
X

1
4

Boolean Theorems (2 of 7)
Single Variable - OR Function
Theorem #5

Theorem #6

Theorem #7

Theorem #8

X0 X

X 1 1

XXX

X X 1

X
0

X
1

X
X

1
5

Boolean Theorems (3 of 7)
Single Variable - Invert Function
Theorem #9

XX
X

X X X
0

1
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.
F1 A A B C C D

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.
F1 A A B C C D

Solution
F1 A A B C C D
F1 A B C C D

; Theorem #3

F1 A B 0 D

; Theorem #4

F1 A B 0

; Theorem #1

F1 A B

; Theorem #5

F1 A B

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.
F2 B B C B C C A B 1 A B 0

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.

F2 B B C B C C A B 1 A B 0
Solution

F2 B B C B C C A B 1 A B 0
F2 B C B C A B 1 A B 0

; Theorem #3 (twice)

F2

BC

A B 1 A B 0

; Theorem #7

F2

BC

AB AB0

; Theorem #2

F2

BC

AB

; Theorem #1

F2

BC

AB

F2 B C A B

; Theorem #5
10

Boolean Theorems (4 of 7)
Commutative Law
Theorem #10A AND Function

XY Y X
Theorem #10B OR Function

XY Y X

11

Boolean Theorems (5 of 7)
Associative Law
Theorem #11A AND Function

X (Y Z) (X Y) Z
Theorem #11B OR Function

X (Y Z) (X Y) Z

12

Boolean Theorems (6 of 7)
Distributive Law
Theorem #12A AND Function

X (Y Z) X Y X Z
Theorem #12B OR Function

( X Y)(W Z) XW XZ YW YZ

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.
F3 R T (R S)(R T)

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.

F3 R T (R S)(R T)

Solution
F3 R T R S R T

F3 R T R R R T S R S T ; Theorem #12B
F3 R T 0 R T S R S T

; Theorem #4

F3 R T R T S R S T

; Theorem #5

F3 T R R S S R

; Theorem #12A

F3

; Theorem #8

T 1 S S R

F3 T1 S R

; Theorem #6

F3 T S R

; Theorem #2

15

Boolean Theorems (7 of 7)
Consensus Theorem
Theorem #13A

XXYXY
Theorem #13B

XXYXY

Theorem #13C

XXYXY
Theorem #13D

XXYXY

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.
F4 P S P Q S P Q S

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.

F4 P S P Q S P Q S
Solution
F4 P S P Q S P Q S

P S Q P Q S

; Theorem #13C

F4 P S PQ P Q S

; Theorem #12A

F4 PS 1 Q P Q

; Theorem #12A

F4 P S Q S P Q S ; Theorem #12A
F4

F4 PS 1 P Q

; Theorem #6

F4 PS P Q

; Theorem #2

18

Summary
Boolean Theorems
1)

X0 0

10A)

XY Y X

2)

X 1 X

10B)

XY Y X

3)

XX X

11A)

X YZ XY Z

4)

X X0

11B)

X Y Z X Y Z

5)

X0 X

12A)

X Y Z XY XZ

6)

X 1 1

12B)

X Y W Z XW XZ YW YZ

7)

XXX

13A)

X XY X Y

8)

X X 1

13B)

X XY X Y

9)

XX

13C)

X XY X Y

13D)

X XY X Y

Commutative
Law
Associative
Law
Distributive
Law

Consensus
Theorem

19

You might also like