Education

Andhra Pradesh
Name : K.Radhika
Designation : Lecturer in
ECE.
Branch : Electronics&
Commn Engg
Institute : Govt
Polytechnic, Hyderabad
Year/Semester : III Semester
EC304.12 1
Subject : Digital
Objectives
On completion of this period, you
would be able to

• Understand Canonical forms.

• Writing SOP,POS expressions

EC304.12
2
Canonical
Forms
Standard forms of Boolean
expression

• Sum of products form.

• Product of sums form.

3
EC304.12
Sum of products
form
• SOP form.
• Minterm expansion form.
• Sum of minterms.
• AND-OR logic
implementation.
4
• NAND- NAND realisation
EC304.12
 Minterms for 3
variables
A B C Minterms
0 0 0 ABC = m0
0 0 1 ABC = m1
0 1 0 ABC = m2
0 1 1 ABC = m3
1 0 0 ABC = m4
1 0 1 ABC = m5
1 1 0 ABC = m6
1 1 1 ABC = m7

• Find truth table rows where F is 1.

• 1 in input column implies true
literal.
EC304.12 5

• 0 in input column implies

 Sum of products
example
For the given truth table

• Identify minterms ?

• write the boolean expression for

the given truthtable ?
6
EC304.12
 F = A' B C + A B' C' + A B' C + A B C' + A B C

011 100 101 110 111

A B C F F
0 0 0 0 1
0 0 1 0 1
0 1 0 0 1
0 1 1 1 0
1 0 0 1 0
1 0 1 1 0
1 1 0 1 0
1 1 1 1 0

F' = A' B' C' + A' B' C + A' B C'

7
EC304.12
Therefore F in canonical form is
• F(A,B,C) = Σm(3,4,5,6,7)

• = m3 + m4 + m5 + m6 + m7
• = A' B C + A B' C' + A B' C + A B
C' + A B C
• F = A B' (C + C') + A' B C + A B (C'
+ C)
8
EC304.12
• F(A,B,C) = A' B C + A B' C' + A B'
C + A B C' + A B C

Reduce Canonical form using

boolean laws

F = A B' (C + C') + A' B C + A B (C'

+ C)

• = A B' + A' B C + A B
9
EC304.12
AND - OR realization
B

C F

F= A + B C

NAND- NAND realization

B
C F
A’

10
EC304.12
Inverse function
Inverse function in canonical form is
F' = Σ (m0, m1, m2)
F' = A' B' C' + A' B' C + A' B C'

Inverse function in minimal form

F = A'B '( C+C') + A'BC'

= A' B' + A' B C'

= A' (B' + BC')

= A' (B' + C')

= A' B' + A'C'

F' = (A + B C)' = A' (B' + C') = A' B' + A' C'
11
EC304.12
AND - OR realization

A'
B'
F'
A'
C'

F' = A' B' + A' C'

NAND- NAND realization

A'
B'
F'
A'
C'

12
EC304.12
Product of sums
form
• POS form

• Maxterm expansion form

• Product of maxterms

• OR - AND logic implementation

• NOR - NOR logic implementation

13
EC304.12
Maxterms for 3 variables

A B C Maxterms
0 0 0 A + B + C = M0
0 0 1 A + B + C = M1
0 1 0 A + B + C = M2
0 1 1 A + B + C = M3
1 0 0 A + B + C = M4
1 0 1 A + B + C = M5
1 1 0 A + B + C = M6
1 1 1 A + B + C = M7

• Find truth table rows where F is 0.

• 0 in input column implies true literal.

•1 in input column implies complemented literal.

14
EC304.12
 Product of sums
example
• Identify maxterms ?

• Write the boolean expression for the

given truth table?

• Write expression for its inverse? 15

EC304.12
A B C F F
0 0 0 0 1
0 0 1 0 1
0 1 0 0 1
0 1 1 1 0
1 0 0 1 0
1 0 1 1 0
1 1 0 1 0
1 1 1 1 0 010 001 000

F(A,B,C) = Π M(0,1,2)

F = (A + B + C) (A + B + C') (A + B' + C)

16
EC304.12
OR - AND realization

A
B
C
A F
B
C'
A
B'
C

F = (A + B + C) (A + B + C') (A + B' + C)

17
EC304.12
NOR- NOR realization

A
B
C
A F
B
C'
A
B'
C

F=(A+B+C).(A+B+C).(A+B+C)

18
EC304.12
 Example inverse function

A B C F F
0 0 0 0 1
0 0 1 0 1
0 1 0 0 1
0 1 1 1 0
1 0 0 1 0
1 0 1 1 0
1 1 0 1 0
1 1 1 1 0

F’(A,B,C) = ΠM(3,4,5,6,7)

= (A + B' + C') (A' + B + C) (A' + B + C') (A' + B' + C) (A' + B' + C')

19
EC304.12
Frequently Asked Questions
1. Realise the inverse function using

OR-AND,NOR-NOR logic?

F'(A,B,C) = Π M(3,4,5,6,7)

= (A + B' + C') (A' + B + C) (A' + B + C')

(A' + B' + C) (A' + B' + C')

20
EC304.12
 Frequently Asked Questions(contd.)
2. Write boolean expressions of minterms ,max terms
in canonical form from the following table?

A B C F
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 0
1 0 0 0
1 0 1
EC304.12
1 21
Frequently Asked Questions(Contd.)
2. Write boolean expressions of minterms ,max terms in
canonical form from the following table?

A B C F
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1
EC304.12
1 22
3. Write boolean expressions for the function (F) in SOP,
POS Forms ?

A B C D F
0 0 0 0 1
0 0 0 1 0
0 0 1 0 1
0 0 1 1 0
0 1 0 0 1
0 1 0 1 0
0 1 1 0 1
0 1 1 1 0
1 0 0 0 1
1 0 0 1 0
1 0 1 0 1
1 0 1 1 1 23
EC304.12
1 1 0 0 0
 Frequently Asked
Questions(Contd.)
4. Implement the logic gates for
the following
expressions?
• (A+B)(C+D)
• AB + CD
• (A+B+C')(D+E+F)
EC304.12 24
Summary

• We discussed about writing the

expression of the
function from the truth table using.

• SOP Form

• POS Form EC304.12

25
 QUIZ

26
EC304.12
1. The minterm designation for ABCD
is

a) m8
• b) m10
• c) m14

• d) m15 EC304.12
27
• 2. The expression y = π M(1,3,5)
is in
a) SOP

b) POS

• c) hybrid
28
EC304.12
• 3. The expression y =
AB+CD+EF is in
•
• a) SOP

• b) POS

• c) hybrid
• EC304.12
29
• 4. The maxterm designation for
A+B+C is

a) M0

• b) M1

• c) M3
30
EC304.12