Analog & Digital Electronics 203143: DMT, SOP and POS Expressions

Analog & Digital Electronics
203143
UNIT 1: DESIGN OF COMBINATIONAL CIRCUITS
Module 3:
DMT, SOP and POS Expressions
REFERENCE: Presented by
Digital Electronics, Principles & Applications R V S Ram Krishna
Anil K Maini Department of Electrical Engineering
John Wiley Publications R H S College of Engg, Mgt Studies
Nasik
MODULE CONTENTS
De Morgan Theorem
Sum of Product Expression
Product of Sum Expression
SOP to POS Conversion
Canonical SOP Form
Canonical POS Form
 And  Nomenclature
OBJECTIVE
To be able to write boolean expressions in SOP and POS forms

DE MORGAN THEOREM
According to the first theorem the complement of a sum equals the product of
complements, while according to the second theorem the complement of a product
equals the sum of complements.
A multi-input NOR gate can be implemented as a multi-input bubbled AND gate, while a
multi-input NAND gate can be implemented as a multi-input bubbled OR gate.
DE MORGAN THEOREM: PROOF
Let us assume that all variables are in a logic ‘0’ state. In that case
Now, let us assume that any one of the n variables, say X1, is in a logic HIGH state:
The same holds good when more than one or all variables are in the logic ‘1’ state.
Therefore, theorem stands proved.
SUM OF PRODUCTS EXPRESSION
A sum-of-products expression contains the

sum of different terms, with each term being
either a single literal or a product of more
than one literal.
It can be obtained from the truth table

directly by considering those input
combinations that produce a logic ‘1’ at the
output.
Each such input combination produces a

term.
Different terms are given by the product of

the corresponding literals.
The sum of all terms gives the expression.
A sum-of-products expression is also known

as a minterm expression.
PRODUCT OF SUMS EXPRESSION
A product-of-sums expression contains the

product of different terms, with each term
being either a single literal or a sum of more
than one literal.
It can be obtained from the truth table by

considering those input combinations that
produce a logic ‘0’ at the output.
Here, ‘0’ and ‘1’ respectively mean the un-

complemented and complemented variables
Each such input combination gives a

term, and the product of all such terms gives
the expression.
Different terms are obtained by taking

the sum of the corresponding literals.
SOP TO POS CONVERSION
A given sum-of-products expression can

be transformed into an equivalent
product-of-sums expression by
Its dual is
(a) taking the dual of the given
expression,
(b) multiplying out different terms to get

the sum-of-products form,
(c) removing redundancy and
(d) taking a dual to get the equivalent Its dual is

product-of-sums
expression.
Therefore,
CANONICAL FORM OF SOP
Consider the following Sum-of-Product Expression
It is a three-variable expression. Expanded versions of different minterms can be

written as follows
The expanded (canonical) form of SOP is therefore given by

CANONICAL FORM OF POS
Consider the following Sum-of-Product Expression
It is four-variable expression with A, B, C and D being the four variables.
Therefore,
 AND  NOMENCLATURE
åand  notations are respectively used to represent sum-of-products and product-of-sums
Boolean expressions. Consider the following Boolean function.
Let us first convert it into the canonical form
Different terms are then represented by binary equivalents, with true variables showing
as ‘1’ and a complemented variable showing as ‘0’.
The five terms in the SOP are therefore 1001, 1000, 1111, 0101 and 0001
The decimal equivalents of these terms (9, 8, 15, 3 and 1) enclosed in the  in
ascending order will then give the  notation of the given SOP
The complement of f(A, B, C, D), that is, f’(A, B, C, D) can be directly
determined from the  notation by including the left-out entries from the list of
all possible numbers for a four-variable function.
Consider now the case of a product-of-sums Boolean function and its representation in
 nomenclature.
The expanded (canonical) form of the POS is
The binary numbers represented by the different sum terms are 0011, 1011, 1100 and
0111 (true and complemented variables here represent 0 and 1 respectively). Their
decimal equivalents are 3, 11, 12 and 7.
An interesting corollary is that, if a given Boolean function

f(A,B,C) is given by f(A,B,C) =  0,1,4,7, then
RECAP QUESTIONS
The Sum-Of-Product expression is also known as?
A) Minterm Expression
B) Maxterm Expression
C) Zeroterm Expression
Which of the following expression is in the canonical SOP form?

D) A + A B
E) ( A + B ) ( B + C )
F) A B + A B
 M ( 0, 1, 2, 3) is equivalent to
G)  m ( 4, 5, 6, 7)
H)  M ( 4, 5, 6, 7)
I)  M ( 0, 1, 2, 3)
RECAP QUESTIONS
The Sum-Of-Product expression is also known as?
A) Minterm Expression
B) Maxterm Expression
C) Zeroterm Expression
Which of the following expression is in the canonical SOP form?

D) A + A B
E) ( A + B ) ( B + C )
F) A B + A B
 M ( 0, 1, 2, 3) is equivalent to
G)  m ( 4, 5, 6, 7)
H)  M ( 4, 5, 6, 7)
I)  M ( 0, 1, 2, 3)
THANK YOU

Analog & Digital Electronics 203143: DMT, SOP and POS Expressions

Uploaded by

Analog & Digital Electronics 203143: DMT, SOP and POS Expressions

Uploaded by

Analog & Digital Electronics

To be able to write boolean expressions in SOP and POS forms

A sum-of-products expression contains the

It can be obtained from the truth table

Each such input combination produces a

Different terms are given by the product of

The sum of all terms gives the expression.

A sum-of-products expression is also known

A product-of-sums expression contains the

It can be obtained from the truth table by

Here, ‘0’ and ‘1’ respectively mean the un-

Each such input combination gives a

Different terms are obtained by taking

A given sum-of-products expression can

(b) multiplying out different terms to get

(c) removing redundancy and

(d) taking a dual to get the equivalent Its dual is

Consider the following Sum-of-Product Expression

It is a three-variable expression. Expanded versions of different minterms can be

The expanded (canonical) form of SOP is therefore given by

Consider the following Sum-of-Product Expression

It is four-variable expression with A, B, C and D being the four variables.

Let us first convert it into the canonical form

The expanded (canonical) form of the POS is

An interesting corollary is that, if a given Boolean function

Which of the following expression is in the canonical SOP form?

Which of the following expression is in the canonical SOP form?

You might also like