Boolean Algebra

Unit 3.2
Outline

Definition of Boolean Algebra

Fundamental theorems of Boolean Algebra
Boolean functions: Analysis of simple logic
circuits
Definition of Boolean Algebra
In 1860 George Boole established the mathematical foundation of the
digital electronic through a particular Algebra which used two values.

Elements: {0,1} Binary variables

Operations: Boolean function
- Boolean sum (or logic sum):
X=A + B
denoted by ‘+’ is the function OR

- Boolean product (or logic product): X=A.B

denoted by ‘*’ or ‘.’ is the function AND
 Boolean Axioms
1) Commutative property
A+B = B+A
AB = BA

2) Associative property
A + (B + C) = (A + B) + C

A (B C) = (A B) C

3) Distributive property
A(B + C) = AB + AC
A+BC = (A+B)(A+C) !!
 Boolean Axioms
4) Neutral elements (0 & 1)
A+0=A (0 for ‘+’)
A·1=A (1 for ‘.’)

5) Complementary elements
A+A = 1

A·A=0
 Theorems of Boolean Algebra
1) Duality theorem
Every Boolean theorem has its dual theorem, which can be obtained by
replacing 0 by 1 and ‘+’ by ‘.’ and vice versa

2) Annihilation theorem
A+1=1 A.0=0

3) Idempotence theorem
A+A=A A.A=A

4) Involution theorem
A=A
 Theorems of Boolean Algebra
5) Absorption theorem (I)
A+AB=A A(A+B)=A

6) Absorption theorem (II)

A+AB=A+B A(A+B)=AB

7) De Morgan theorems (I)

A•B=A+B Negation of a product term

A+B=A•B Negation of a sum term

 Boolean functions
Analyzing simple logic circuits

- Purpose: obtain a simplified Boolean function from a

complex logic circuit
- Method: Two steps
1. Obtain the output functions of each gate of the circuit,
from left to right. This is a reiterative process.
2. Simplify the final output function using the Boolean
postulates and theorems
Example 1.
1. Obtain the output functions
Output function
 2. Simplify the final output function
De Morgan Involution

X=(A + B) (CD) = (A + B) + (CD) = A + B + CD

Example 2.
1. Obtain the output functions
Example 2.
2. Simplify the final output function

X = (A+B) C + CD + B
De Morgan
= (A+B) C · CD + B
Involution
= (A+B) C · (CD + B)
De Morgan
= A B C · (C +D +B)
Distributive
= A B C C + A B C D +A B C B
Complementary

=AB C D
Example 2.
2. Simplify the final output function

X = (A+B) C + CD + B
De Morgan
= (A+B) C · CD + B
Involution
= (A+B) C · (CD + B)
De Morgan
= A B C · (C +D +B)
Distributive
= A B C C + A B C D +A B C B
Complementary

=AB C D
Example 2.
2. Simplify the final output function

X = (A+B) C + CD + B
De Morgan
= (A+B) C · CD + B
Involution
= (A+B) C · (CD + B)
De Morgan
= A B C · (C +D +B)
Distributive
= A B C C + A B C D +A B C B
Complementary

=AB C D
Example 2.
2. Simplify the final output function

X = (A+B) C + CD + B
De Morgan
= (A+B) C · CD + B
Involution
= (A+B) C · (CD + B)
De Morgan
= A B C · (C +D +B)
Distributive
= A B C C + A B C D +A B C B
Complementary

=AB C D
Example 2.
2. Simplify the final output function

X = (A+B) C + CD + B
De Morgan
= (A+B) C · CD + B
Involution
= (A+B) C · (CD + B)
De Morgan
= A B C · (C +D +B)
Distributive
= A B C C + A B C D +A B C B
Complementary

=AB C D
Example 2.
2. Simplify the final output function

X = (A+B) C + CD + B
De Morgan
= (A+B) C · CD + B
Involution
= (A+B) C · (CD + B)
De Morgan
= A B C · (C +D +B)
Distributive
= A B C C + A B C D +A B C B
Complementary

=AB C D