Digital Design

Basic Identities of Boolean Algebra

M. Morris Mano
Edition 5
BASIC IDENTITIES OF BOOLEAN ALGEBRA
The dual of an algebraic
The following table lists the most basic identities of Boolean algebra expression is obtained by

1a. X + 0 = X • interchanging OR and

AND operation
2a. X + 1 = 1
• replacing 1s by 0s and
3a. X + X = X
0s by 1s.
4a. X + X’ = 1
5a. (X’)’ = X

6a. X + Y = Y + X Commutative
The other 10 identities
7a. X + ( Y + Z ) = ( X + Y ) + Z can be obtained by: Associative
8a. X . ( Y + Z ) = X . Y + X . Z taking the dual of the Distributive
expressions on both
9a. ( X + Y )’ = ( X’ . Y’ ) sides of the equal sign. DeMorgan
10a. X + X . Y = X Absorption
BASIC IDENTITIES OF BOOLEAN ALGEBRA
The dual of an algebraic
The following table lists the most basic identities of Boolean algebra expression is obtained by

1a. X + 0 = X DUAL : 1b. X . 1 = X The duality principle of • interchanging OR and

Boolean algebra states that AND operation
2a. X + 1 = 1 2b. X . 0 = 0 a Boolean equation remains
valid if we take the dual of • replacing 1s by 0s and
3a. X + X = X 3b. X . X = X
the expressions on both 0s by 1s.
4a. X + X’ = 1 4b. X . X’ = 0 sides of the equal sign.
5a. (X’)’ = X

6a. X + Y = Y + X 6b. X . Y = Y . X Commutative

7a. X + ( Y + Z ) = ( X + Y ) + Z 7b. X . ( Y . Z ) = ( X . Y ) . Z Associative
8a. X . ( Y + Z ) = X . Y + X . Z 8b. X + ( Y . Z ) = (X + Y) . (X + Z) Distributive
9a. ( X + Y )’ = ( X’ . Y’ ) 9b. ( X . Y )’ = ( X’ + Y’ ) DeMorgan
10a. X + X . Y = X 10b. X . (X + Y) = X Absorption
SIMPLIFICATION OF BOOLEAN FUNCTION
Algebraic Manipulation
Boolean algebra is a useful tool for simplifying digital circuits. Consider the Function
F = X’ Y’ Z + X’ Y Z + X Y Z’ + X Y Z
This function is implemented with four AND gates and one OR gate. This can be reduced or
simplified by applying Identities.

Simplification of the function F by applying identities:

F = X’ Y’ Z + X’ Y Z + X Y Z’ + X Y Z

F = X’ Z (Y+ Y’) + X Y (Z’ + Z) Y + Y’ = 1 Z + Z’ = 1 ( Using Identity: X + X’ = 1 )

F = (X’ Z) . 1 + (X Y) . 1 (X’ Z) . 1 = X’ Z (X Y) . 1 = X Y ( Using Identity: X . 1 = X )

F = X’ Z + X Y
Simplified Boolean Function
SIMPLIFICATION OF BOOLEAN FUNCTION
Algebraic Manipulation
Boolean algebra is a useful tool for simplifying digital circuits. Consider the Function
F = X’ Y’ Z + X’ Y Z + X Y Z’ + X Y Z : Original Boolean Function

F = X’ Z + X Y : Simplified Boolean Function Truth Table:

X Y Z
F
Both are Same : Defining same Truth Table (Same Behavior) 0 0
0
0 0
0
But Simplified Form has minimum number of gates: 1
0 1
1 0
0 0
1
2 AND and 1 OR logic gate 1
1 1
0
0
1 0
0
0
: Minimum Number of Logic Gates 1 1
1
Minimum Gate Logic 1
: Minimum Number of Literals 1 0
1
1
1
SIMPLIFICATION OF BOOLEAN FUNCTION
Algebraic Manipulation
Boolean algebra is a useful tool for simplifying digital circuits. Consider the Function
F = X’ Y’ Z + X’ Y Z + X Y Z’ + X Y Z
x’
y’
z
x’
y
z F
x
y
z’
x
y
z Economica
l?
F = X’ Z + X Y
x’
z F
x
y
SIMPLIFICATION OF BOOLEAN FUNCTION
Simplify the following Boolean functions to a minimum
number of literals .

1. x (x’ +
y)
2. x + x’ y

3. (x + y) (x +
y’)
SIMPLIFICATION OF BOOLEAN FUNCTION
Simplify the following Boolean functions to a minimum
number of literals .
x’ (x’ +
x (x’ +
y y)
1. x (x’ + y)
y) x
x (x’ + = x x’ +
y) xy
= 0 +x
y x xy
= x
y y

Both have same

As x x’ =
functionality
0
As 0 + A Economica
=A l?
SIMPLIFICATION OF BOOLEAN FUNCTION
Simplify the following Boolean functions to a minimum
number of literals .
2. x + x’ y x’ x’ y
x + x’
y y
x
x + x’ y= (x + x’) . (x
+ y)
= 1 .
(x + y) x x+
= (x + y
y) y

Both have same

As x + x’
functionality
=1
As 1 . A Economica
=A l?
SIMPLIFICATION OF BOOLEAN FUNCTION
Simplify the following Boolean functions to a minimum
number of literals .
3. (x + y) (x x (x +
y y)
+ y’) (x+y)
(x+y’)
(x + y) (x = x x + x y’ + x y x (x +
y y’)
+ y’) + y y’
= x + x y’ + x y + ’
=0 x + x y’ +
x
= y x ( 1 + y’
As x x = +
= y)x .
x 1
= x
As y y’ =
0 x
As 0 + A OR (x + y) (x = x + y
=A + y’) =x+0
y’
As 1 + y’ + y =
=1 x