0% found this document useful (0 votes)
23 views18 pages

Deco

The document discusses the concepts of Sum of Products (SOP) and Product of Sums (POS) forms in digital logic design, including methods for minimizing expressions and creating truth tables. It outlines the canonical and minimal forms, along with examples of how to derive these forms from given truth tables. Additionally, it covers the use of Karnaugh Maps for simplifying logical expressions.

Uploaded by

iron pump
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
23 views18 pages

Deco

The document discusses the concepts of Sum of Products (SOP) and Product of Sums (POS) forms in digital logic design, including methods for minimizing expressions and creating truth tables. It outlines the canonical and minimal forms, along with examples of how to derive these forms from given truth tables. Additionally, it covers the use of Karnaugh Maps for simplifying logical expressions.

Uploaded by

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

Page No

Date

Product (sop Form)

qiv en Iruth table.

A B F

2m
3

5 ms!
b mal

we will hk cquahon ohen fi8 .

A. B. + A,8.Cc + A 8 . c t A.B.C

SOP Forms.

OR op ehator.

ANO operator.
it is wrter dity hom truh
toble
bcoz Page Na
standand or Canonical soP
SOP fom.? Date

F A8.( + A-8.

ELA,6,c)
FCA, BaL) F m(2,445,6t)
henc. each term is coaled
S repread enkd ow
as
miotcrm and it
writen this teme when tunchon is
high ()

minimizahon e
A.B.C t A8. t A:8-C
= A.BC+

= A.6. t AB+ BÊ

we have, one lauw whee. becomed


A+B

A. 6: + A ets BC =X
Ä-X +A
A+ AX

IPE A+8.C
F= A + B. -(minimal s0P Forms)
Paye No.
Date

La
henetore have laek 040(e.

-(sop torm)

A+ R..
-(sOP Form)
Poth torms
cqual andwell qive us
trutth table

H+
Canonical /standard soP form Each mintc
is having. all Hhe yariable in n
normal Or
Lomplimeot form.
egF= A.B + A.8 + A-8

SOP form 3 Each minterm doed not


Mioimal
have all he Variables in 0ormal ar ampli
mented form.
A + B.c
Page No.
Date

For giveo ttuh table minimi2e the


Cxpression

F=A.B + A.8 (we have, to write


Y=AB + A-B
his terms only
lcanonicalsoP orm
Newill mínimize this sop fotm

Y= A.B+ A.B
(A+A ). B
( minimna
B sOP Porm)

Simplf he expression on.


m(o,23)

-( it means autput is highl) 4or ma,mg


-(let's draw teuth tabl )
Prge Ne
Dafe

writ sOP «peregdi on )


-C canonícal sop form)
= A.B + A.1.
(lets
B= X.
Xt A AX+A = X+A

wniten (mioimal sOP Form)


directy
trom
Truth A-Rt AB+ R.A +R.A

A.8 + 4.8+ .A

(B+A)(B +
Pos SOP
A
Page No.
|A Date

Produtct ot SUm
sum torm
(POs)
tgiven ttuhtable).
A 8
0

Hpos form is used uhen th


auBpu is lou)

Y=
(AtR+L)-(AtR+T).( At8+) pos

Maxtcns form
(Denotd 4s M)
Hwe can reduce canonical pOS toro
minimal pOs ormn
Page No.
Date

We chould kno
Y= (A+&+c)-(A+B+T): (A+R+2) I(A+B).(Atc)=A+BC
(x+ ).th+).(A+ +Z)
= (x+).( AtE
X. (A+B+T)
+Z) Here
Lcts A+8=x
(A+B). (A +ß+T)
A + B. (B+)
A t B.8 + 8.T

Y = A+ &.Z
-(minimal pos ferm).
Y= (A+8).(A+T)

for qiven thutth table minim/ze the Pos


expereddion.
bb
Mo
M, 0)
al
Mz 0)

H pos form cis written uhcn outut is louw (o)


Y = (A+8).(A+8) canonicalstandaxd
Y T(M M,) POS form.

lt now e have to minimize Iredue Pom).


B+A.A -=(A+8J(A+c) = A+84
Ato
B
Page No
Date

simplity the cxpredaion fo


Y(A,B) E IM(O,2,3)
y(A,6) = T(Mo, M M)

Hit mcans Gutput is 1ow o)


or Mo,M,M,
B

Moll
M
M

R+A. J.(A+R)

B-A
Page No
Date

glven trvh table

I We will olye for


+we wwrite sop torm uhen output is higau).

-(anonical
cop torm)

E A 3 . +(Ã+A .B
Y = A.8.T t B Pictrbutye la
Y=Á. +B
Page No.
Date

T sdlye tor POs


H we write Pos form when aukput
ylA,6,) =
(A+B+2).( (A +B+T)

= (A+B+7).(A +8)

B+ A.T

-lminimal
POS form
str aL, ancr -(
tem). repatd EtemNe
+8.cA A-B. A&.c+ A.Bt-T A.8-C+
8.C +
B.A A.8)C+C)
+ (A-Bt =
CA+ A.(B+B).(c+z)
6-c. +
fort forc for
missing B
uritc
1 term tor
missinge AX twe ttrm
missing
missing X
B
8nG term 2:step
vaiables. 3stpl
nversion form calL oni (an Minimal
Date
No. Page
Date

Minimal te Canonical form conversion (p


PFE (A+8+0)(A+)

no- ofvariabl. 4 wha are they.


step :
I: Fnd
A,8,4 c

Step 22: Find Yarigbles those gte missing


Term 1 A

Term_ 2
B
BXX

BX.

g= A+8).(A+ )

F= (A+8+Z). (A +L)
(A +8+7).(Ã+c +o)
(A+B+Z)-(A +C+ 6.Z)
(A+B47). (x+g.)
(A+B+T)(K+8). kt+R)
;AtB4T) (Atc+8). (Ã+CtB)
can oni calfstandard
POS form
Page No.
Date

K-Map ( KAMnaugh Map).


tcduce. lan onical. form).
(ARC) Sml 2, 4,5, 4,)

See
we will tebe normal conyersion to
miaimafom.
Y= A.8-C + A.B.Zt A.B-C t A.8-C + A-B.c.
=ABT t A-8(+c) + AB (tc)
A-B + A B
AB.T t AB+8)

will by K-map
repreotahon K-map)
A.\BC
Page No.
Date

tnaw paixingp sf one in K<map).


Priority_ wise
l6 one iome
3 once
4. Once
hme
ime

we have 5 once.
irst we wil)_pair uone
and theo Once

A + B.2
Page No.
Date

) A, 8,c) Imll35,).
3 Vasuabled ie A, B,L

m5
m

HTo draw K-map we ncd ta tind no-of. celld

K-map
Put
whu ctpt

pauxing
F= C
Page No.
Date

).
Emlo, 247)
FCA,6,c) mot m,t m, +mu +Mg.
A

ms

A
Be

B.L +A.B. + A.t + A. B.C.


(Paga No.
Date

E(A6, ) = ~mCo.1.5,6,) .

A &C

1 + 2 t3* - lt 2+ 4.

NOte he tedult is minímum but may not be


oam

fmplícants - the qreup 1s is called aa


imphants.
Prime implicantd Iip the loest p09dibl
group

eøDen bal prime im pi cants ? t uas there 3


dingle ik ahich cannot. be
Combined in any sthe as
Page
Date

4 vaniable Ehap 8

13, 14, s)
Emlo,2, 3 my+Myt m,a I tm
F(A Bco)=
m, t
Motm, t t

m
2
m

I0

1t 2 t +y
A-B + A-8. D
Y=LD t A.8.D t

=m(023,5,9 3, 10,11,5)
ex F(A & c D)

4.

M
m M
m

You might also like