Introduction to POS

BY
Dr. Daggubati Sirisha
 Introduction to POS
  Given: TT ; 3 input variables =

A B C Y Y=Boolean Function . QUES: Represent in POS Form

0 0 0 0
POS Form is used when output is 0 or Low
0 0 1 0
From TT Express Boolean Function Y in SOP
0 1 0 1 SOP(Y= POS(Y=
1) 0)
Form=sum of products
0 1 1 0
1.Search for output is high
1 0 0 1 0 A’ 0 A
2.Y=A’BC’+AB’C’+AB’C+ABC’+ABC
1 0 1 1 1 A 1 A’
MINTERMS:5=m
1 1 0 1
From TT Express Boolean Function Y in POS
1 1 1 1
Form= products OF SUM
1.Search for output is LOW
2.Y=(A+B+C)(A+B+C’)(A+B’+C’)
3.MAXTERMS:3=M
 Introduction to POS
  Given: TT ; 3 input variables =

A B C Y Y=Boolean Function . QUES: Represent in POS Form

0 0 0 0
POS Form is used when output is 0 or Low
0 0 1 0
0 1 0 1 SOP POS Standard or Canonical POS Form
0 1 1 0 0 A’ 0 A Y=(A+B+C)(A+B+C’)(A+B’+C’)+(A’+B+C’)(A’+B’+C’)
1 A 1 A’
1 0 0 1 Maxterms(5)= (A+B+C)(A+B+C’)(A+B’+C’)+
1 0 1 0 (A’+B+C’)(A’+B’+C’)
1 1 0 1 A+B+C= MAXTERM(Size is big)
1 1 1 0 A.B.C=MINTERM(size is small)

In Standard or Canonical POS each maxterm will have all

variables in normal or complementing form)
We can obtain POS Form from SOP Form
A B C Y SOP POS
Y’=(A’B’C’+A’B’C+A’BC)
0 0 0 0 0 A’ 0 A
0 0 1 0 1 A 1 A’
Complement of both sides
0 1 0 1
0 1 1 0
(Y’)’=(A’B’C’+A’B’C+A’BC)’
1 0 0 1
1 0 1 1
Y=(A’B’C’)’.(A’B’C)’.(A’BC)’
1 1 0 1
1 1 1 1
Y=(A+B+C).(A+B+C’).(A+B’+C’)

(A+B)’=A’.B’
 Introduction to POS
1. From the given truthtable Find the Canonical POS Form and Minimal POS Form
Y=Boolean Function . QUES: 1.Represent in POS Form
A B C Y 2. Reduce Standard POS FormMinimal POS Form
0 0 0 0 POS Form is used when output is 0 or Low
0 0 1 0 1. Standard or Canonical POS Form
0 1 0 1 SOP POS Y=(A+B+C).(A+B+C’).(A+B’+C’)
0 1 1 0 0 A’ 0 A A+B=Common in two terms
1 0 0 1 1 A 1 A’ A+B=X
1 0 1 1 Y=(X+C).(X+C’).(A+B’+C’)
1 1 0 1 Y=X+(C.C’).(A+B’+C’)
1 1 1 1 Y=X.(A+B’+C’)
Y=(A+B) .(A+B’+C’) [B’+C’=C]
Y=A+(B.(B’+C’))
Y=A+B.B’+B.C’
Y=A+BC’=(A+B).(A+C’)-Minimal POS.(A+B’+C
 Introduction to POS
1. From the given truthtable Find the Canonical POS Form and Minimal POS Form
Y=Boolean Function . QUES: 1.Represent in POS Form
A B F 2. Reduce Standard POS FormMinimal POS Form
0 0 1 POS Form is used when output is 0 or Low
SOP POS
0 1 0 1. Standard or Canonical POS Form
0 A’ 0 A
1 0 1 Y=(A+B’).(A’+B’)
1 A 1 A’
1 1 0 2. Minimal POS Form
Y=(B’+A).(B’+A’)
Y=B’+(AA’)
Y=B’-Minimal POS

Every time they will not give the Truth table in the question , they will give only the maxterm
 Introduction to POS
1. From the given truthtable Find the Canonical POS Form and Minimal POS Form
Y=Boolean Function . QUES: 1.Represent in POS Form
2. Reduce Standard POS FormMinimal POS Form
POS Form is used when output is 0 or Low

A B Y
1. Standard or Canonical POS Form
0 0 1
Y=(A+B’).(A’+B’)
0 1 0
2. Minimal POS Form
1 0 1
Y=(B’+A).(B’+A’)
1 1 0 Y=B’+(AA’)
Y=B’-Minimal
  Every time they will not give the Truth table in the questionPOS
, they will give only the Maxte

Y(A,B)=,

Y= ; Y=; SOPY=
From the given truth-table Find the Canonical POS and Minimal POS /
Canonical SOP and Minimal SOP Form
A B C Y 1.Canonical SOP / 2.Minimal SOP Form- SOP form is written only when function is HIGH
0 0 0 0 1   Y(A,B,C)=
1 0 0 1 0 Canonical SOP- Y(A,B,C)=A’B’C’+A’BC’+A’BC+ABC’+ABC
2 0 1 0 1
3 0 1 1 1
2.Canonical POS / 2.Minimal POS Form- POS form is written only when function is LOW
4 1 0 0 0
  Y(A,B,C)=
5 1 0 1 0
6 1 1 0 1 Canonical POS- Y(A,B,C)=(A+B+C’)(A’+B+C)(A’+B+C’)
7 1 1 1 1

SOP POS
0 A’ 0 A
1 A 1 A’
From the given truth-table Find the Canonical POS and Minimal POS /
Canonical SOP and Minimal SOP Form
A B C Y 1.Canonical SOP / 2.Minimal SOP Form- SOP form is written only when function is HIGH
0 0 0 0 1   Y(A,B,C)=
1 0 0 1 0
Canonical SOP to Minimal SOP
2 0 1 0 1
Y(A,B,C)=A’B’C’+A’BC’+A’BC+ABC’+ABC
3 0 1 1 1
=A’B’C’+A’B(C’+C)+AB(C’+C)
4 1 0 0 0
5 1 0 1 0
=A’B’C’+A’B+AB
6 1 1 0 1
=A’B’C’+B(A’+A)
7 1 1 1 1
=A’B’C’+B
If X=A’C’
SOP POS =XB’+B
0 A’ 0 A =B+B’ X=>B+X
1 A 1 A’ =B+A’C’
From the given truth-table Find the Canonical POS and Minimal POS /
Canonical SOP and Minimal SOP Form
A B C Y
2.Canonical POS / 2.Minimal POS Form- POS form is written only when function is LOW
0 0 0 0 1
  Y(A,B,C)=
1 0 0 1 0
2 0 1 0 1
Canonical POS- Y(A,B,C)=(A+B+C’)(A’+B+C)(A’+B+C’)
3 0 1 1 1
If A’+B=X
4 1 0 0 0 =(A+B+C’)(X+C)(X+C’)
5 1 0 1 0 =(A+B+C’)(X+CC’)
6 1 1 0 1 =(A+B+C’)(A’+B)
7 1 1 1 1 =(B+A+C’)(B+A’)A+C’=X
=(B+X)(B+A’)
=B+XA’
=B+(A+C’)A’
=B+AA’+C’A’
=B+C’A’=>>>>>(B+C’)(B+A’)-Minimal POS
Convert minimal POS expression to
Standard POS
• Y=(A+B)(B’+C)(A’+C)=minimal POSStandard POS
=(A+B+CC’)(B’+C+AA’)(A’+C+BB’)
=(A+B+C)(A+B+C’)(B’+C+A)(B’+C+A’)(A’+C+B)(A’+C+B’)
• Y=(A+B)(A+C)(B+C)=MINIMAL POS
• (A+B+CC’)(A+C+BB’)(B+C+AA’)
• (A+B+C)(A+B+C’)(A+C+B)(A+C+B’)(B+C+A)(B+C+A’)STANDARD POS
Problems in SOP and POS
• Write the minterm designation for Y=ABC+A’B’C+AB’C+ABC’
• Y=ABC+A’B’C+AB’C+ABC’ SOP(mi POS(M
nterm) axterm
• =111+001+101+110 )
0 A’ 0 A
A B C Y
1 A 1 A’
0 0 0 0
1 0 0 1 • Y=ABC+A’B’C+AB’C+ABC’
2 0 1 0   F(A,B,C)=
3 0 1 1
  F(A,B,C)=
4 1 0 0
5 1 0 1
6 1 1 0
7 1 1 1
Problems in SOP and POS
• Write the minterm designation for Y=A’B’C’+A’B’C+A’BC’+AB’C’
SOP POS
0 A’ 0 A
1 A 1 A’
A B C Y
0 0 0 0
1 0 0 1
• Y=A’B’C’+A’B’C+A’BC’+AB’C’
2 0 1 0   F(A,B,C)=
3 0 1 1
  F(A,B,C)=
4 1 0 0
5 1 0 1
6 1 1 0
7 1 1 1
Problems in SOP and POS
• Express Y=(A+B+C)(A+B+C’)(A+B’+C’) in maxterm designation
• Y=(A+B+C)(A+B+C’)(A+B’+C’) SOP POS

• = (000)(001)(011) 0 A’ 0 A
1 A 1 A’
• =0,1,3
A B C Y
0 0 0 0
1 0 0 1
2 0 1 0 • Y=(A+B+C)(A+B+C’)(A+B’+C’)
  Y(A,B,C)=
3 0 1 1
4 1 0 0
5 1 0 1
6 1 1 0
7 1 1 1
 Note
SOP and POS forms of Boolean expression are complementary forms.
Minterm and Maxterm designation are also complementary forms

Eg1. Convert the following into other economical form   F(A,B,C)=

  F(A,B,C)=
Let the minterm designation is

  F(A,B,C)=
The equvivalent Maxterm designation is
 Note
SOP and POS forms of Boolean expression are complementary forms.
Minterm and Maxterm designation are also complementary forms

Eg1. Convert the following into other economical form   F(A,B,C)=

  F(A,B,C)=
Let the minterm designation is

  F(A,B,C)=
The equvivalent Maxterm designation is
Assignment-2(Solutions)
SOP POS
0 A’ 0 A
1 A 1 A’