Boolean Algebra

Definition
• Digital circuits are hardware components (based on
transistors) that manipulate binary information
• Mathematical system, defined with set of elements, set of
operators and number of axioms or Postulates
History of Boolean Algebra
• George Boole
• 2nd Nov 1815 Lincoln Lincolnshire, England – 8th Dec 1864
Ballintemple, Ireland
• Professor at Queens College, Cork, Ireland
• “Spring of 1847 that he put his ideas into the pamphlet
called Mathematical Analysis of Logic.”
• Developed systematic mathematics of binary logic
• Employ the Postulates
 Binary logic / Boolean logic
• High and Low voltages are interpreted as True or False
values
• Binary variables take one of the two values, either 1 or 0.
• Logical operators operate on binary values and binary
variables.
• Basic logical operators AND, OR and NOT are Boolean
operators.
• Logic gates implement logic functions.
• Boolean Algebra: a useful mathematical system for
specifying and transforming logic functions.
• Boolean algebra  foundation for designing and analyzing
digital systems.
 Binary Variables
• The two binary values have different names:
● True/False ● On/Off ● Yes/No ● 1/0

• Variable identifier examples:

• A, B, x, y, z, or X1

• Boolean Functions can be either expression or truth table

Eg : X+YZ

• Every Boolean expression can be converted to logic circuit

• Boolean Algebra minimize/Simplify Boolean expression

which lead to reduction of complexity and cost of the circuit
 Truth Table and Logic Circuit
• Boolean Expression:

Truth Table Logic Circuit

A B C Y
0 0 0 0
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 1
 Boolean Operator Precedence
The order of Evaluation
1. Parenthesis
2. NOT
3. AND
4. OR

Parenthesis around the OR operation.

Example: A(B+D)(E+F)
X+YZ
 Boolean Algebra Postulates
• Identity element

• Complement

• Commutative Law

• Distributive law
 Boolean Algebra Theorems

1. Involution Theorem

6. Associative Theorem
 Theorems Continued…
DeMorgan Theorem
(.
(+

In another notation
.

Absorption Theorem
 Verification of Theorems

• x+1=1
Using Postulate
x + 1 = 1.(x+1)
= (x+ x’).(x+1) = (x.x) + (x.1) + (x’.x) + (x’.1)
= x + x + 0 + x’ = (x+x) + x’
= x + x’
=1

Using Truth table

0+1=1
1+1=1
Verification of absorption Theorem
• x + xy = x x + xy = x.1 + xy
Using Boolean Algebra = x.(1+y)
= x.(y+1)
= x.1
= x

Using Truth table

x y xy x+xy
0 0 0 0
0 1 0 0
1 0 0 1
1 1 1 1
Verification of DeMorgan Theorem
DeMorgan Theorem
(. (+

x y ( .
Using Truth table
0 0 0 1 1 1 1
0 1 1 0 1 0 0
(.
1 0 1 0 0 1 0
1 1 1 0 0 0 0

x y ( +
0 0 0 1 1 1 1
(+ 0 1 0 1 1 0 1
1 0 0 1 0 1 1
1 1 1 0 0 0 0
Example
Example
Example
C