CvL8vlLW

O CONVOLUTION
O FAST CONVOLUTION
O COOK-TOOM ALGORITHM
O EXAMPLE
O ALGORITHM
O MODIFIED COOK-TOOM ALGORITHM
O IMPLEMENTATION OF FILTERBANK
O ADVANTAGES
O REFERENCES
CnvCLu1lCn
O Mailemaiical opeiaiion on iwo funciions io pioduce a iliid
vaiiable, iypically viewed as a modified veision of ile
oiiginal funciion.
O Tle convoluiion ileoiem allows one io mailemaiically
convolve in ile iime domain by simply muliiplying in ile
fiequency domain.
O Two iypes: lineai and cyclic
O Lineai-(M-i)(N-i) addiiions and MN muliiplicaiions
O Cyclic-N(N-i) addiiions and NN muliiplicaiions
O Foi speeding up ile calculaiion-FFT
O Commonly used foi fasi compuiaiion of convoluiions
O Disadvaniage-complex aiiilmeiic
O Anoilei meilod is io conveii iD convoluiion inio
muliidimensional convoluiion
O By using efficieni sloii lengil algoiiilms
1 CnvCLu1lCn
O Convoluiion using fewei numbei of opeiaiions
O Algoiiilmic siiengil ieduciion: Numbei of siiong
opeiaiions is ieduced ai ile expense of an inciease in
ile numbei of weal opeiaiions.
O Besi suiied foi implemeniaiion using piogiammable
oi dedicaied laidwaie.
O Assume (a+ib)(c+id) = e+if ,
wleie (a+ib) is ile signal sample
(c+id) is a coefficieni
implemenied using muliiplicaiions and : addiiions
O Using fasi convoluiion algoiiilm aiiilmeiic complexiiy
is ieduced io muliiplicaiions and addiiions
CCk1CCM LCC8l1PM
O Minimum numbei of muliiplicaiions
O Foi non cyclic convoluiion
( i)
O Tlis iequiies :N-i muliiplicaiions
O Define ile geneiaiing polynomial of a sequence x
i
, by
(:)
O Tlen W(z)=X(z)H(z), ()
wleie H(z) and W(z) aie geneiaiing polynomials of l
i
and w
i
.
O W(z) is a :N-: degiee polynomial
O To deieimine ile :N- i w
i
's, seleci :N- i disiinci
numbeis o
i
, i = o, i, . . , :N - :, and subsiiiuie ilem
foi z in () io obiain ile :N - i pioducis
m
i
=W(o
i
)=H(o
i
)X(o
i
), i=o,i,...:N-: ()
O Using Lagiange inieipolaiion foimula
O ()
O Cosi is :N-i muliiplicaiions
O () can be wiiiien in maiiix foim os, m = ( Al)x(Ax)
wleie
O Fiom () ile coefficienis of W(z) will be ile lineai
combinaiions of ile m
i
's and can be wiiiien as
w=Cm
wleie C is a :N-i by :N-i maiiix
O To calculaie cyclic convoluiion, compuie
Y(z)=W(z)mod(z
N
-i)
wlicl leads io y=Cm, wleie C is an N by :N-i maiiix
obiained fiom C by peifoiming iow opeiaiions.
O Geneial foim is m=(Al)x(Bx)
O Value of (Al) is piecompuied.
O B and C will lave no muliiplicaiions
O Only muliiplicaiions aie ile elemeni by elemeni
muliiplicaiionof Al by Bx.
O Cool-Toom algoiiilm yields laige iniegei coefficienis
in A,B,C maiiices wlicl is cosily as muliiplicaiion.
Lxample
O (Qn). Calculaie ile non cyclic : poini convoluiion
Using (i)
w
o
=l
o
x
o
w
i
=l
o
x
i
+l
i
x
o
w
:
=l
i
x
i
O In ieims of z iiansfoims, ilis is equivaleni io
w
o
+w
i
z+w
:
z
:
=l
o
x
o
+(l
o
x
i
+l
i
x
o
)z+l
i
x
i
z
:
= l
o
(x
o
+x
i
z)+l
i
z(x
o
+x
i
z)
= (l
o
+l
i
z)(x
o
+x
i
z)
O Lei o
i
=-i,o,i foi i=o,i,: in ()
m
o
=(l
o
-l
i
)(x
o
-x
i
)
m
i
=l
o
x
o
m
:
=(l
o
+l
i
)(x
o
+x
i
)
pui z=-i,o,i in ile above eqn. io obiain m
o
,m
i
,m
:
)
O Fiom ()
So ilai
w
o
=m
i
w
i
=(m
:
-m
o
)]:
w
:
=(m
o
+m
:
)]:]-m
i
O Tiansfeiiing denominaiois fiom C io A maiiix,
combine ile facioi wiil l
i
's and sioie ile
piecompuied consianis
a
o
=(l
o
-l
i
)]:
a
i
=l
o
a
:
=(l
o
+l
i
)]:
O Hence
m
o
=a
o
(x
o
-x
i
)
m
i
=a
i
x
o
m
:
=a
:
(x
o
-x
i
)
w
o
= m
i
w
i
=m
:
-m
o
w
:
=m
o
+m
:
-m
i
O Only muliiplicaiions and addiiions aie iequiied
insiead of muliiplicaiions and addiiion
laorlLhm
i. Cloose L+N-i diffeieni ieal numbeis 8o, 8i,.. 8
L+N-:
:. Compuie l(8i) and x(8i), foi i=o,i,..L+N-:
. Compuie s(8i)=l(8i)x(8i), foi i=o,i,..L+N-:
. Compuie s(p) using ile equaiion
O Reduciion of opeiaiion couni occuis if ile numbeis
8o, 8i,.. Bn aie caiefully closen
O A beiiei algoiiilm using Clinese iemaindei ileoiem
io compuie ile convoluiion as:
S(x)=D(x)G(x)mod
Modlfled ook1oom laorlLhm
O Cloose L+N-: diffeieni ieal numbeis 8i,. 8o, 8
L+N-:
O Compuie l(8i) and x(8i),foi i=o,i,.L+N-
O Compuie s(8i)=l(8i)x(8i), foi i=o,i,.L+N-
O Compuie s'(8i)= s(8i)-s
L+N-:
8i
L+N-:
, foi i=o,i,.L+N-
O Compuie s'(p) using ile equaiion
O Compuie s(p)= s'(p)+s
L+N-:
p
L+N-:
lMLLMLn11lCn C lL1L8 8nk
O Considei iwo polynomials, g(z
-i
)=g
o
+g
i
z
-i
+..+g
L-i
z
-L+i
and
u(z
-i
)=u
o
+u
i
z
-i
+.u
N-i
z
-N+i
O By compuiing in noimal foim ii's pioduci y(z
-i
) iequiies
NL muliiplicaiions
O Cool-ioomalgoiiilm will ieduce ii io M>=N+L-i
O Fiisi, cloose a sei of inieipolaiion poinis
i
i=o:M-i ilai
aie ile ioois of i(z
-i
) =
O Evaluaie y(
i
)=g(
i
)u(
i
)
O Peifoim Lagiange inieipolaiion io iesioie
y(z
-i
)= wiil
Li(z
-i
)=
O Eg: Considei g(z
-i
)=g
o
+g
i
z
-i
(L=:), and u(z
-i
)=u
o
+u
i
z
-i
(N=:)
O Cloose inieipolaiion poiniso,i,-i
O Tlen y(o)=u
o
g
o
y(i)=(u
o
+u
i
)(g
o
+g
i
)
y(-i)=(u
o
-u
i
)(g
o
-g
i
)
O Lagiange polynomials aie calculaied as
L
o
(z
-i
)=(i-z
-:
)
L
i
(z
-i
)=(z
-i
+z
-:
)]:
L
-i
(z
-i
)=(-z
-i
+z
-:
)]:
ie, y(z
-i
)=y(o)L
o
(z
-i
)+y(i)L
i
(z
-i
)+y(-i)L
-i
(z
-i
) is
ieconsiiucied
O Muliiplicaiion can be wiiiien as y=Gu, ilen algoiiilm can be
iepiesenied as ile maiiix decomposiiion G=CDA, wiil
D=diag(Bg)
O G is ile (N+L-i) x N Toepliiz maiiix defining ile filiei g(z
-i
)
O A is ile Vandeimonde maiiix wiil A
m,n
= (n=o:N-i)
O B is also ile MxL Vandeimonde maiiix wiil B
m,l
= (l=o:L-i)
O C is ile (N+L-i) x M maiiix wlose iil column coniains ile fiisi
N+L-i coefficienis of L
i
(z
-i
)
vn1CL
O Tle numbei of muliiplicaiions lave been ieduced io
L+N-i ai ile expense of an inciease in ile numbei of
addiiions
O Addei las mucl smallei aiea and compuiaiion iime
ilan muliipliei
O Low laidwaie complexiiy
O Pie addiiion and posi addiiion maiiices aie noi simple
8LL8LnL
i]. Zdenla Babic,Danilo P.Mandic, A Fost Alqoritbm for
lineor Convolution of Discrete Time siqnols" , TELSIKS,
pp.no--,Sepiembei :ooi.
:]. Yule Wang,Keslab Paili, Explicit Cook-Toom Alqoritbm
for lineor convolution" ,IEEE,:ooo.
]. Geeii Van Meeibeigen, Maic Moonen, Hugo De Man,
Criticolly SubsompleJ filterbonks implementinq ReeJ-
Solomon coJes" ,vol :, pp.no--:,IEEE,:oo
].Keslab K. Paili, VlSl Jiqitol siqnol Processinq Systems,
Desiqn onJ lmplementotion", pp.no:::-:,New
Delli,i.
].Ivan W.Selesnicl,C. Sidney Buiius, Fost Convolution onJ
Filterinq" , Digiial Signal Piocessing Handbool, CRC Piess
LLC, i.
]. R. Meyei, R. Reng and K. Sclwaiz, Convoluiion
Algoiiilms On DSP Piocessois, IEEE,ii.
].R.E.Blalui, Fost Convolution Alqoritbms for Diqitol
Siqnol Processinq" , Addison-Wesley,i.
]. H.I.Nussbaumei, Fost Fourier Tronsform onJ
Convolution Alqoritbms" , Spiingei-Veilag, Beilin,
Heidelbeig, and NewYoil,ii
]. Ramesl C Agaiwal,Iames W. Cooley, "New Alqoritbms for
Diqitol Convolution", IEEE Tiansaciions on Accousiics,
Speecl and Signal Piocessing, Vol. ASSP-:, No.,Ociobei
i.
io]. Albeiio Zanoni, Toom-"Cook -woy For lonq lnteqers
Multiplicotion", iiil Inieinaiional Symposium on Symbolic
and Numeiic Algoiiilms foi Scieniific Compuiing,:oo