Scribd
Upload
2 views

boolean (2)

The document discusses types of boolean expressions, specifically Sum of Products (SOP) and Product of Sums (POS), and their standard forms. It explains how to convert boolean expressions into canonical forms and introduces the concepts of minterms and maxterms, including their designations and how to obtain them from truth tables. Additionally, it provides examples and short questions related to these concepts.

Uploaded by

bhavani.bollepally
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
2 views

boolean (2)

The document discusses types of boolean expressions, specifically Sum of Products (SOP) and Product of Sums (POS), and their standard forms. It explains how to convert boolean expressions into canonical forms and introduces the concepts of minterms and maxterms, including their designations and how to obtain them from truth tables. Additionally, it provides examples and short questions related to these concepts.

Uploaded by

bhavani.bollepally
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 19

TYPES OF EXPRESSIONS

1.SOP
SUM OF PRODUCTS

2. POS
PRODUCT OF SUMS
SOP and POS

So when you are able to write a boolean


expression in terms of sum of product or
product of sum form ,then you are said to
write SOP or POS form of boolean expression
SOP example: AB+BC+CA
The whole expression above is sum of few
products

POS example: (A+B)(B+C)(C+A)


STANDARD SOP AND POS FORM.

A standard SOP or POS format is that format


in which every term has all the variables of
the boolean expression.
For example we have F(A,B,C)=AB+BC
The above expression is an SOP, but it is not a
standard SOP.
Since C is missing in AB and A is missing in
BC
Now using the boolean postulates A.A’=0
and A+A’=1 the expressions can be converted
into standard SOP and POS forms
Converting boolean expressions to
standard SOP
AB+BC
AB(C+C’) + BC(A+A’)
=ABC+ABC’+ABC+A’BC
=ABC+ABC’+A’BC
=hence the above expression is in standard
SOP form
Converting boolean expressions to standard
POS forms

F(A,B,C)=(A+B)(B+C)
The above expression is POS , but it is not a
standard POS.
Using the boolean laws the above expression
can be converted as
F(A,B,C)=(A+B)(B+C)
We know that A.A’=0
The above expression can be written as
(A+B+0)(B+C+0)
=(A+B+(C.C’)) (B+C+(A.A’))
CONVERT THE EXPRESSIONS INTO
ITS EQUIVALENT CANONICAL SOP
AND POS FORM
SOP
1) A+B
2) A+BC

POS
1) A.B
2) A(B+C)
CONVERSION

 SOP
 1) A+B=A(B+B’)+B(A+A’)
 =AB+AB’+A’B+AB
 =AB+AB’+A’B (Canonical SOP)
 2) A(B+B’)(C+C’)+(A+A’)BC
 =ABC+ABC’+AB’C+AB’C’+ABC+A’BC
 =ABC+ABC’+AB’C+AB’C’+A’BC

 POS
 1) A.B= (A+B.B’)(A.A’+B)
 =(A+B)(A+B’)(A+B)(A’+B)
 =(A+B)(A+B’)(A’+B)

 2) A(B+C)
 =(A+BB’+CC’)(AA’+B+C)
 (A+B+C)(A+B+C’)(A+B’+C)(A+B’+C’)(A+B+C)(A’+B+C)
 =(A+B+C)(A+B+C’)(A+B’+C)(A+B’+C’)(A’+B+C)
MINTERMS AND MAXTERMS

X (NORMAL FORM)

B INARY VARIABLE X
X’ (Complement form)
A binary variable X can exist in normal form and in its complement form.

Suppose if we have two binary variables X and Y then they can be combined by an AND operator to form four different terms.
Such as X’Y’, X’Y, XY’, XY

 All these terms are called as minterms.

 Therefore n variables can form 2N minterms

 for example three binary variables X,Y,Z will form 2 3


=8 minterms

 Therefore Minterm can be defined as a product term that contains each of the n
variables in either complemented or normal form .
 Hence minterm can also be defined as mj where j is the value of binary number
associated with minterm
Example of minterm designation

Minterm designation is denoted with letter m along with the subscript


obtaine using the following steps
A. Find binary pattern by writing 1 for the variable and 0 for the
complement of the variable
B. Find decimal eqivalent of the binary pattern
C. Use decimal number as the subscript of letter m

Example:
To find minterm designation of ABC’
1. Binary pattern of input values of ABC’ : 110
2. Decimal eqivalent of bianry value 110 : 6
3. Hence min term designation of ABC’ is : m6
Min term designation

1. Find minterm designation of A’B’C


2. Find min term designation of ABC
obtaining min term expression from
truth table
To obtain min term expresssion from the truth
table use the steps given below
1) See the input bit pattern of the variables
which results in 1.
2) If the input bit is 0,use complement of the
variable
3) If input bit is 1 then use the variable in the
same form.
4) Find their product to obtain min term
5) Finally add all the min terms to get min
term expression or canonical SOP
expression.
Obtaining minterm expression from
truth table
Consider the truth table given below

A B Y MIN TERMS MIN TERM


DESIGNTION
0 0 0
0 1 1 A’B (A’ for 0 and B for
1)
1 0 1 AB’(A for 1 and b’ for
0)
1 1 1 AB(A for 1 and B for
1
OBTAINING MIN TERM EXPRESSION

Hence min term expression(Y)=A’B+AB’+AB


Min term designation: m1+m2+m3
The Boolean expression obtained can also
represented as F(A.B)=∑(1,2,3), where 1,2
and 3 are the subscripts of the min term
designation and ∑stands for summation.
MIN TERM EXPRESSIONS

Obtain min term expression from the truth


table given below
A B C Y Min Min term
term designatio
n

0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 0
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 1
MIN TERM EXPRESSION

1. OBTAIN MIN TERM EXPRESSION FROM THE BOOLEAN


FUNCTION AS GIVEN BELOW.
 F(A,B,C)=∑(5,1,3,6)
 2. Write the SOP expression corresponding to the following
truth
A table.B C D(OUTPU
T)
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
MAX TERM DESIGNATION

 Max term designation is denoted with the letter M along with


a subscript obtained by using the following steps:
1) find binary pattern by writing 0 for the variable and 1 for
the complement of the variable.
2) Find the decimal equivalent of the pattern
3) Use the decimal equivalent as the sub script of the letter M.

Example to find max term designation of (A+B+C’)


. Binary pattern of the input value of(A+B+C’) : 001
Decimal equivalent of binary value 001 is : 1
Hence maxterm designation of (A+B+C) is : M1
Max term designation

Find maxterm designation of


A’+B’+C
A+B+C
SHORT QUESTIONS (2 MARKS)

1) Convert the following expression into its


canonical POS form F(A,B)=(A+B).A’
2) Find the complement of XY’Z+XY+YZ’
3) convert A.B
4) minimize the expression using boolean
laws.
F=(A+B’).(B+CD)’
5) if A=1 and B=0,then find
a)(A’+1).B b) (A+B’)’
6) Write the function in canonical product of
sum form. F(X,Y,Z)=(X’+Y’).(Y+Z’).
7) Find the complement of the following
expression.
F=x’+xy’
• 8) State the two absorption laws.verify any
one of them using truth table
• 9)If A=1,B=0,C=1 and D=1, then find its
• a) minterm b) maxterm

You might also like