Digital Design

Review of Boolean
Algebra
Outline Claude Shannon
(1916 - 2001)

Representation of
Boolean Algebra
Boolean Expressions Boolean Operators
Defined
and Functions

Proving &
Basic
Simplification of
Logic Gates Postulates/Axioms,
Boolean expressions
Theorems
and functions
Boolean Algebra Defined

What is Boolean
algebra?

 Itwas named after

George Boole
(1815 – 1864) and
was adapted in
1938 by Claude
Shannon
 What is Boolean algebra?
 It is described as an algebra of logic or an
algebra of two values
 It is a form of algebra that consists of:
 set of elements: A = {true, false} or A Boolean

= {on, off}, {1, 0}, {high, low}
set of operators: O = {NOT {'}, AND
Algebra
{•}, OR {+}} Defined
 … following some theorems, postulates
and axioms that hold for binary logic
Boolean Algebra Defined

Boolean expression
 An algebraic statement of Boolean variables
or literals and operators
A+B
A • B (AB)
A’ or A
Boolean function
 Maps inputs from the set {0,1} to the set
{0,1}
 A function from B to Bn is called a Boolean
function of degree n
F(A,B) = AB + (A’B + B’)
Basic forms in which a Boolean
algebraic expression can be written
 1. Sum of Product( SOP) form
 2. Product of Sum (POS form)

Representation of Boolean
Expression and Function
 Sum of Products (SOP) form
It is an expression that results from two or
more product terms, which are summed by
Boolean addition
Example: AB + BC
F(A,B) = AB’ + A’B’

Representation of Boolean
Expression and Function
 Product of Sums (POS) form
It is an expression that results from two or
more sum terms, which are multiplied by
Boolean multiplication.
Example: (A+B)(A+C)
F(A,B,C) = (A+C’) (A’+B’+ C)

Representation of Boolean
Expression and Function
Exercises: Inspect each of these Boolean expressions,
and determine whether each one is a sum of
products, or a product of sums:
 (B+C’+D)(A’+B)

 AB’C’+A’BC

 (X+Y’+Z’)(Y’+Z)(X’+Y)

 M’N’O’+MNO’+MN’O

Representation of Boolean
Expression and Function
 Truth table is a table that contains all possible values
of logical variables/statements in a Boolean
expression.

No. of possible combination = 2n

where n=number of variables used in a Boolean
expression.

Truth Table
Boolean Operators

 Truth
table for the Boolean NOT
operator

A A’
0 1
1 0
Boolean Operators

 Truth
table for the Boolean AND
operator

A B A⋅B = AB
0 0 0
0 1 0
1 0 0
1 1 1
Boolean Operators

 Truth
table for the Boolean OR
operator

A B A+B
0 0 0
0 1 1
1 0 1
1 1 1
Boolean Operators
 The truth table for AB + C is as follows:

A B C AB AB + C
0 0 0 0 0
0 0 1 0 1
0 1 0 0 0
0 1 1 0 1
1 0 0 0 0
1 0 1 0 1
1 1 0 1 1
1 1 1 1 1
Exercise

1. Given A = 0, B = 0, C = 1, D = 1, evaluate the

following boolean functions.
a. F = D (BC’A + (AB’ + C)’ + C)
b. F = A’C’ + (B’ + C’) + AB + D’(BC’ + A’B’)

2. Evaluate the following Boolean expression using

Truth Table.
(a) X’Y’+ X’Y
(b) F = (X’+Y +Z’) + XY’
(c) F = XY’ (Z+YZ’)+ Z’
  A computer, or electronic devices, is
made up of a number of circuits

 Each circuit can be designed using the

Logic rules of Boolean algebra

Gates
 The basic element of circuits are called
gates

 Each type of gates implements a

Boolean Operation
  All circuits covered in this
chapter provides output that
depends only on the input, and
not on the current state of the
circuit

Logic
These circuits that have no
Gates 
memory capabilities are called
(cont.) combinational circuits or gating
networks

 Combinatorial circuits are built

using the different logic gates
like NOT gate or Inverter, AND
gate, OR gate, etc.
17
Logic Gates (cont.)

Role of each type of elements:

NOT gate or Inverter: it accepts the

value of one Boolean variable as input
and produces the complement of this
value as its output.

X'
X
 Logic Gates
(cont.)
X

Y
X+Y OR Gate: it accepts
as input values of 2
or more Boolean
variables.
The output is the
Boolean sum of their
values
The output is always
1 if one of the inputs
is 1.
 Logic Gates
(cont.)
X
AND gate: The inputs to this XY
gate are the values of two or Y
more Boolean variables.

The output is the Boolean

product of their values.

Output is always 0 if one of

the inputs is 0.
Logic Gates (cont.)

 We can have multiple inputs to AND and OR:

X1
X2
x1x2…xn
…
Xn

x1
x2 x1 + x2 + …+ xn
…
xn

Gates with n inputs

21
 Combinations of Gates

 Combinational circuits can be constructed

using a combination of inverters, OR gates,
and AND gates

 When combinations of circuits are formed,

some gates may share input using branching

Logic Gates (cont.)

X
XY
Y
XY + X’Y

X’
X
Y X’Y

X XY

Y
XY + X’Y

X’

X’Y

Two ways to draw the same circuit

 Exercise:
Construct circuits that produce the following
outputs using 2-input logic gates.

1. (XY + Y’) X’
2. X’ ( Y + Z’)’ + YZ
3. (XZ’ + Y + Y’Z) (X’Y’ + Z)

Logic Gates (cont.)

24
  Postulates (or axioms)
Basic  These are given facts that are
Postulates or accepted as true without a proof

Axioms,  It is also known as the

Huntington’s Postulate, which
Theorems in refers to a set of rules defined on
how a set of numbers can be
Boolean manipulated and is used to derive
certain theorems applicable
Algebra assuming certain conditions
Basic
Postulates or  Theorems
Axioms,
Theorems in  These are practical applications
of postulates
Boolean
Algebra
  Identity Law
Basic ▪ A+0=A
Postulates or ▪ A•1= A

Axioms,  Domination Law

Theorems in • A+1 = 1
• A•0 = 0
Boolean  Idempotency Law
Algebra • A+A = A
• A•A= A
  Complement Law
Basic • A + A’ = 1
A • A’ = 0
Postulates or
•

Axioms,  Involution/Double
Complementation
Theorems in
• (A’)’ = A
Boolean
Algebra  Commutative Law
• A+B=B+A
• A • B = B • A or AB = BA
  Associate Law
• (A + B) + C = A + (B + C)

Basic • (A B) C = A (B C)

Postulates or  Distributive Law

Axioms, • A + (B C) = (A + B) (A + C)
Theorems in • A (B + C) = AB + AC

Boolean
Absorption (Redundance) Law
Algebra 

• A+AB=A
• A (A + B) = A
Basic
Postulates
 De Morgan's Theorem
or Axioms,
• (A + B)’ = A’B’
Theorems • (AB)’= A’+ B’
in Boolean
Algebra
Summary
1) A+0 =A
2) A+1= 1 11) A•B=B•A
3) A+A=A 12) (A + B) + C = A + (B + C)
4) A +A’ = 1 13) (A B) C = A (B C)
5) A•1=A 14) A + B C = (A + B) (A + C)
6) A•0= 0 15) A (B + C) = AB + AC
7) A•A=A 16) A+AB=A
8) A • A’ = 0 17) A (A + B) = A
9) (A’)’ = A 18) (A + B)’ = A’B’
10) A+B=B+A 19) (AB)’= A’+ B’

Basic Postulates or Axioms,

Theorems in Boolean Algebra
 Minimization of Boolean
expression is needed to simplify
the Boolean expression and thus Minimization
reduce the circuitry complexity of Boolean
as it uses less number of gates Expression
to produce same output that can
be taken by standard/ canonical
expression.
 Example 1: Prove that the expression
XY+XY'=X
Solution:
XY + XY' = X
X (Y+Y') = X # 15 Distributive
X ( 1) = X #4 Complement
X = X #5 Identity

Proving theorems
 Example 2:
Prove the absorption theorem X + XY = X

Solution:
X + XY = X
X(1+Y) =X #5 #15
X (1) = X #2
X = X #5

Proving theorems
 Example 3:
Prove that the expression
XY+ X’Y + Y’Z = Y + Z

Solution:
XY+ X’Y + Y’Z = Y + Z
Y (X + X’) + Y’Z = Y + Z #15
Y ( 1) + Y’Z = Y + Z #4
Y + Y’Z = Y + Z #5
(Y + Y’) (Y + Z) = Y + Z #14
1 ( Y + Z) = Y + Z #4
Y+Z = Y+Z #5 #15

Proving theorems
Exercise:
A. Prove algebraically the following Boolean
expressions.
1. AB’CD’ + AB’CD + ABCD’ + ABCD = AC
2. A'BC + AB'C' + AB'C + ABC' + ABC = A + BC
3. (X+Y’+Z’)(X’+Y’+Z’) = Y’ + Z’

Proving Theorems and Simplification

of Boolean Expressions/Functions
Exercise
B. Minimize or simplify the following functions
and draw the equivalent logic diagram.
1. F(X,Y,Z) = X’Y’Z’ + X’YZ + XY’Z’ + XYZ
2. F(A,B,C) = A’B’C’ + A’C + AB’C’ + AB’C
3. F(A,B,C) = (A+C) (B + B’C)A
4. F(X,Y,Z) = X’Y’+X’YZ+X’YZ’+YZ’+XY’Z’
5. F(A,B,C,D) = (B+CD)(C+BD)

Proving Theorems and Simplification of

Boolean Expressions/Functions
Canonical form of Boolean
Expression (Standard form)
 In Standard SOP and Standard POS each term
of Boolean expression must contain all the
literals (with and without bar or prime) that
has been used in Boolean expression.
 If this condition is satisfied by the Boolean
expression, that expression is called
Canonical form of Boolean expression.
 Sum of Products and Product
of Sums Form
 Standard or Canonical Form of Boolean Expression
 Standard SOP Form (Minterm Canonical Form)
 It is a special case of a product term where
all n variables of the function, either in true
or complement form, are ANDed together
 Sum of Products and Product
of Sums Form
 Standard or Canonical Form of Boolean
Expression

 Standard POS Form (Maxterm Canonical Form)

 Itis a special case of a sum term where all n
variables of the function, either in the true
or complement form, are ORed together
 Canonical form of Boolean
Expression (Standard form)
Minterm and Maxterm
 Individual term of Canonical Sum of Products
(SOP) is called Minterm. Minterm is a product of
all the literals (with or without prime (‘) )
within the Boolean expression.

 Individual term of Canonical Products of Sum

(POS) is called Maxterm. Maxterm is a sum of all
the literals (with or without prime (‘)) within
the Boolean expression.
Minterms and Maxterms for 2 variables
(Derivation of Boolean function from Truth
Table)

Index X Y Minterm Maxterm

0 0 0 m0 = X’Y’ M0 = X + Y
1 0 1 m1 = X’Y M1 = X + Y’
2 1 0 m2 = XY’ M2 = X’ + Y
3 1 1 m3 = XY M3 = X’ + Y’

The minterm mi should evaluate to 1 for each

combination of X and Y.
The maxterm is the complement of the minterm
Minterms and Maxterms
for 2 variables
(Derivation of Boolean
function from Truth
Table)

The minterm mi should

evaluate to 1 for each
combination of X and Y.

The maxterm M0 is the

complement of the minterm
Minterms and Maxterms for 3 variables

Index X Y Z Minterm Maxterm

0 0 0 0 m0 = X’Y’Z’ M0 = X+Y+Z
1 0 0 1 m1 = X’Y’Z M1 = X+Y+Z’
2 0 1 0 m2 = X’YZ’ M2 = X+Y’+Z
3 0 1 1 m3 = X’YZ M3 = X+Y’+Z’
4 1 0 0 m4= XY’Z’ M4 = X’+Y+Z
5 1 0 1 m5 = XY’Z M5 = X’+Y+Z’
6 1 1 0 m6 = XYZ’ M6 = X’+Y’+Z
7 1 1 1 m7 = XYZ M7= X’+Y’+Z’

Maxterm Mi is the complement of minterm mi

Mi = (mi )’and mi = (Mi)’
 Minterms and Maxterms are designated with an index
 The index number corresponds the decimal equivalent of the binary
pattern
 The index for the minterm or maxterm, expressed as a binary number,
is used to determine whether the variable is shown in the true or
complemented form
 For Minterms:
❖ ‘1’ means the variable is “Not Complemented” and
❖ ‘0’ means the variable is “Complemented”.
 For Maxterms:
❖ ‘0’ means the variable is “Not Complemented” and
❖ ‘1’ means the variable is “Complemented”.

Purpose of the Index

X Y Z F Minterms & Maxterms
0 0 0 0 Example 1.
0 0 1 1 Derive the SOP form of a
Boolean Function F, which is
0 1 0 0
represented by the
0 1 1 0 following truth table.
1 0 0 0 Express F in:
1 0 1 0 a) Standard SOP
1 1 0 1 b) Sum of minterms
1 1 1 1
Minterms and Maxterms
Solution :
X Y Z F Minterm
0 0 0 0
0 0 1 1 m1 = X’Y’Z Focus on the
0 1 0 0
0 1 1 0
‘1’ entries
1 0 0 0
1 0 1 0
1 1 0 1 m6 = XYZ’
1 1 1 1 m7 = XYZ

1. F(X,Y,Z) = X’Y’Z + XYZ’ + XYZ

2. F(X,Y,Z) = m1 + m6 + m7
= ∑m (1, 6, 7)
Minterms
. and Maxterms
Example 2.
Derive the POS form of a Boolean Function F, which is
represented by the following truth table. Express F in:
1. Standard POS form
2. Product of maxterms
X Y Z F
0 0 0 1
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 1
 Minterms and Maxterms
Solution :

X Y Z F Maxterm Focus
0 0 0 1 on the
0 0 1 0 M1 = X+Y+Z’ ‘0’
0 1 0 0 M2 = X+Y’+Z entries
0 1 1 1
1 0 0 1
1 0 1 0 M5 = X’+Y+Z’
1 1 0 1
1 1 1 1

1. F(X,Y,Z) = (X+Y+Z’ ) (X+Y’+Z) (X’+Y+Z’)

2. F(X,Y,Z) = (M1 ) ( M2 ) ( M5 )
= M (1, 2, 5)
Minterms and Maxterms
1. Write the equivalent canonical Sum of Product
expression for the given product of maxterms.
F(W,X,Y,Z) = ΠM(0,1,2,3,5,9,11,13,15)
2. Given F(A,B,C) = A’BC + AC’ + B’C express F in
a) sum of minterms
b) product of maxterms
3. Given F(A,B,C,D) = A’BC’D + AB’C’D’ + A’B’CD +
ABC’ + AD’. Express F in
a) sum of minterms
b) product of maxterms
 Minterms and Maxterms
4. A given Boolean function F(A,B,C,D) has an output
of 1 if and only if an odd number of A,B,C,D have a
value of 1. Derive the following:
a. Truth table of the given function
b. Express F in sum of minterms
c. Express F in product of maxterms
d. Express F in standard SOP.
e. Express F in standard POS.
Thank
You