EASWARI ENGINEERING COLLEGE

DEPARTMENT OF ECE QUESTION BANK Sub Code: EC1302 Subject : D ! t"# $ !%"# P&oce$$ %! F"cu#t' :S(S& d)"&"% De!&ee*B&"%c):B(E * ECE +e"&*$e,e$te&*Sect o%: III * - * A. B PART/A 1( UNIT I I0 1234 $ t)e N/5o %t DFT o0 " $e6ue%ce )2%47P&o8 t)"t 1234 "%d 12N/ K4 "&e co,#e9 co%ju!"te$( 2No8200:4 Complex conjugate property of DFT ;)"t "&e t)e d 00e&e%ce$ "%d $ , #"& t e$ bet<ee% DIF "%d DIT "#!o& t),$= 2No8200:4 Sl.No DIT FFT DIF FFT 1 The time domain sequence is The DFT x !" is decimated decimated # Input sequence is to $e gi%en The DFT at the output is in $it in $it re%ersed order. re%ersed order. & First calculate #'point DFTs Decimates the sequence step $y and com$ines them step to #'point sequence and calculate DFT. ( Suita$le for calculating in%erse Suita$le for calculating DFT. DFT. De0 %e t)e 5&o5e&t e$ o0 co%8o#ut o%( 2A5& # 200:7 No8 200>4 Commutati%e )a* x n"+h n", h n"+x n" -ssociati%e )a* . x n"+h1 n"/+h# n", x n"+.h1 n"+h# n"/ Distri$uti%e )a* x n"+.h1 n"/0h# n"/, x n"+h1 n"0x n"+h# n" D&"< t)e b"$ c butte&0#' d "!&", o0 &"d 9/2 FFT( 2A5& # 200>7 M"' 200@ . A5& # 200:4 a -,a01n$

2(

3(

?(

1n b /1 B,a'1n$

>( B( 7.

St"te "%d 5&o8e 5"&$e8"#A$ &e#"t o% 0o& DFT(2No8 200@4 2efer $oo!3 Digital signal processing 4roa!is pgno3(#(" ;)"t do 'ou ,e"% b' t)e te&, Cb t &e8e&$"#D "$ "55# ed to FFT 2efer $oo!3 Digital signal processing $y 2amesh 5a$u. pgno3(.6" Dete&, %e t)e DTFT o0 " $e6ue%ce 92%4 E "% u2%4 2No8 200B4 8 9" , x n" ej#:!n;N The gi%en sequence x n" , an u n" DTFT<x n"= , x n" ej#:!n;N , a ej#:!;N"n n n 1here a , 1'a ; 1'a" 8 9" , 1 > aNej#:!"; 1'aej#:!;N" ;)"t "&e t)e "d8"%t"!e$ o0 FFT "#!o& t), o8e& d &ect co,5ut"t o% o0 DFT= 2M"' 200@4 The complex multiplication in the FFT algorithm is reduced $y N;#" log#N times. 4rocessing speed is %ery high compared to the direct computation of DFT. t)e 0 &$t 0 8e DFT coe00 c e%t$ o0 " $e6ue%ce 92%4 "&e 9204 E 207 9214 E >Gj27 9224 E 07 9234E0(2Gj0(?7 H2?4 E 0( Dete&, %e t)e &e," % %! DFT coe00 c e%t$( 2M"' 200@4 5y complex conjugate property x @",A.#'jA.(Bx C",ABx 7",@'j# De0 %e $',,et& c "%d A%t $',,et& c $ !%"#$( 1o< do 'ou 5&e8e%t "# "$ %! <) #e $",5# %! " CT $ !%"#= 2M"' 200@4 - real %alued signal x n" is called symmetric if 8 n" , 8 'n" Dn the other handB a signal x n" is called antisymmetric 8 'n" , '8 n" <)"t $ t)e %ece$$"&' "%d $u00 c e%t co%d t o% o% t)e ,5u#$e &e$5o%$e 0o& $t"b # t'= 2M"' 200@4 The necessary and sufficient condition for the impulse response is gi%en $y 0E F Gh n"GH E n,'E De0 %e Co,5#e9 Co%ju!"te o0 DFT 5&o5e&t'(
DFT

?.

F(

10(

11(

12( If

2M"' 200@4

x n"I8 !" then

N

8+ n"I 8+ '!""N , 8+ N'9" 13( ;)"t $ FFT= 2No8 200B4 The fast Fourier transform is an algorithm is used to calculate the DFT. It is $ased on fundamental principal of decomposing the computation of DFT of a sequence of the length N in to successi%ely smaller discrete Fourier Transforms. The FFT algorithm pro%ides speed increase factor *hen compared *ith direct computation of the DFT.

1?(

St"te $",5# %! t)eo&e,= 2No8 200B4 Sampling is the process to con%ert analog time domain continuous signal into discrete time domain signal. 5ut it is the process of con%erting only time domain not in amplitude domain. Nyquist criteria3 1e sample the signal $ased on the follo*ing condition i.e.B fs J#fm 1here fx , Sampling frequency Fm , maximum signal frequency If these a$o%e conditions are not satisfied *e *ill meet the follo*ing demerits after the sampling process. 1. Kuard $and #. -liasing Lffect ;)"t $ BIBO St"b # t'= ;)"t $ %ece$$"&' "%d $u00 c e%t co%d t o% 0o& BIBO $t"b # t'= 2M"' 200B7 No8 200?4 -ny system is said to $e 5I5D sta$le of and only if e%ery $ounded input gi%es a $ounded output. The 5I5D sta$ility depends on the impulse response of the system. The necessary and sufficient condition for 5I5D sta$ility 1o< < ## 'ou 5e&0o&, # %e"& co%8o#ut o% 8 " c &cu#"& co%8o#ut o%= 2M"' 200B4 )et the length of x n" $e )B length of h n" $e M. then linear con%olution of x n" and h n" can $e o$tained through follo*ing steps. i. -ppend x n" *ith M'1 Neros. Oence its length *ill $e )0M'1 ii. -ppend h n" *ith )'1 Neros. Oence its length *ill $e )0M'1 iii. 4erform circular con%olution of a$o%e sequences. The result is linear con%olution of length )0M'1 1o< ,"%' ,u#t 5# c"t o%$ "%d "dd t o%$ "&e &e6u &ed to co,5ute N/ 5o %t DFT u$ %! &"d 9/2 FFT= In computing N'point DFT $y this method the num$er of stages of computation *ill $e m'times. The num$er PrQ is called the radix of the FFT algorithms. In radix'#'FFTB the total num$er of complex additions are reduced to N log#N and total num$er of complex multiplications are reduced too N;R"log#N(

1@.

1B(

1@(

1:(

;)"t $ dec ,"t o%/ %/t ,e "#!o& t),= The computation of ?'point DFT using radix '# DIT > FFTB in%ol%es three stages of computation. Oere N, , #& therefore r,# and m,&. The gi%en ? point sequence is decimated to # point sequences. For each # point sequenceB the # point DFT is computed. From the result of #'point DFT the ('point DFT can $e computed. From the result of ('point DFTB the ?'point DFT can $e computed. )et the gi%en sequence $e 86o"B8 1"B8 #"B 8 &"B 8 ("B 8 @"B 8 C"B 8 7" *hich consists of ? samples( ;)"t $ dec ,"t o%/ %/0&e6ue%c' "#!o& t),= In decimation in frequency algorithm the frequency domain sequence 8 !" is decimated. In this methodB the output DFT sequence 8 !" is di%ided into smaller sequence. De& 8e t)e %ece$$"&' "%d $u00 c e%t co%d t o% 0o& "% ITI $'$te, to be BIBO $t"b#e( 2A5& # 200>4 - system is 5I5D sta$leB if for e%ery $ounded inputB the output is finite. Mathematically if Gx t"GE H E -nd GGy t"GG H E then the system is sta$le. The necessary and sufficient condition for Continuous time signal is sta$le if and only if 'E GG h t" GG1 , SGh n"G dt H E E In discrete time system E GGhGG1 , F Gh n"G n,'E De0 %e DTFT 5" &= The DTFT pairs are 8 !" , x n"e'j#:!n;N 8 n" , x !"ej#:!n;N 2A5& # 200? . M"' 200@4

1F(

#A.

21(

22(

;)"t $ "# "$ %!= 2No8 20034 If *e operate the sampler at fx H fmB the frequency components of the frequency spectrum *ill o%erlap *ith each other i.e.B the lo*er frequency of the second frequency component *ill o%erlap *ith higher frequency of the first frequency component. This o%erlapping effect is called as -liasing effect.

For a%oiding o%erlapping of high and lo* frequency componentsB *e ha%e to use lo*'pass filter to cut the un*anted high frequency components. 23( Te$t t)e 0o##o< %! $'$te,$ 0o& t ,e 8"& "%ce a. y n" , nx# n" Time %ariance $. y n" , ax n" Time in%ariance J 8e "%' t<o 5&o5e&t e$ o0 DFT a"4eriodicity x !0n",x !" $")inearity DFT<a1x1 n"0a#x# n"=,a1x1 !"0a#x# !". E95#" % I %e"& t' 5&o5e&t' o0 DFT DFT<x n"=,x !"TDFT<x n"=,x !" For any real %alued constant a Ta . DFT<a x n"0a x n",a 8 !"0a 8 !" F %d t)e DFT o0 t)e $e6ue%ce( 8 n",<1B1BABA= DFT<x n"=,8 !" , x n"eU'j#n !;N 8 !", x n"eUj#n!;( ,10eU'j!;#0A0A ,# cos 9;("eU'j!;( 8 !",'!;( UNIT /II 1( S)o< t)"t t)e 0 #te& < t) ) 2%4 E K/17 07 1L $ " # %e"& 5)"$e 0 #te&( 2No8 200:7M"' 200@4 2efer 5oo!3 Digital signal processing 2amesh 5a$u. pgno3MV17" ;)"t $ 5&e<"&5 %!= 2No8 20037200:4 1hen $ilinear transformation is appliedB the discrete time frequency is related continuous time frequency asB W , #tan'1WT;# This equation sho*s that frequency relationship is highly nonlinear. It is also called frequency *arping. This effect can $e nullified $y applying pre*arping. The specifications of equi%alent analog filter are o$tained $y follo*ing relationshipB W , #;T tan X;# This is called pre*arping relationship. ;)"t "&e t)e ,e& t$ "%d de,e& t$ o0 FIR 0 #te&$= 2No8 200> . A5& # 200:4 FI2 filters that ha%e ideal linear phase characteristics can $e easily designed. FI2 filters realiNed non'recursi%ely are al*ays sta$le.

2?(

2>(

2B(

2(

3(

Lrrors arising from quantiNation of signals and finite *ord length effects are usually less critical for FI2 filter designs as these realiNation do not ha%e feed$ac! FI2 filters are implemented through FFT algorithmsB *hich greatly reduced its processing time. ?( ;)"t $ t)e &e#"t o% bet<eee% "%"#o! "%d d ! t"# 0&e6ue%c' % ,5u#$e %8"& "%t t&"%$0o&,"t o%=2A5& # 200:4 WT, X I% t)e de$ !% o0 FIR d ! t"# 0 #te&$7 )o< $ K" $e& < %do< d 00e&e%t 0&o, ot)e& < %do<$= 2No8 200@4 It pro%ides flexi$ility for the designer to select the side lo$e le%el and N. It has the attracti%e property that the side lo$e le%el can $e %aried continuously from the lo* %alue in the 5lac!man *indo* to the high %alue in the rectangular *indo*. B( F %d t)e d ! t"# t&"%$0e& 0u%ct o% 12M4 b' u$ %! ,5u#$e %8"& "%t ,et)od 0o& t)e "%"#o! t&"%$0e& 0u%ct o% 12$4 E 1* 2$G24( A$$u,e TE0(1 $ec( 2No8 200@4 'p1+T" '1 O Y",1; 1'e N " O Y",1; 1'e @(
'A.#" '1

>(

N "
2No8 200B4

Obt" % t)e b#oc3 d "!&", &e5&e$e%t"t o% o0 " FIR S'$te,(

:(

St"te t)e co%d t o% 0o& " d ! t"# 0 #te& to be c"u$"# "%d $t"b#e( 2M"' 200@4 The response of the causal system to an input does not depend on future %alues of that inputB $ut depends only on the present and;or past %alues of the input. - filter is said to $e sta$leB $ounded'input $ounded output sta$leB if e%ery $ounded input produces a $ounded output. - $ounded signal has amplitude that remains finite. ;)"t $ t)e co%d t o% $"t $0 ed b' # %e"& 5)"$e FIR 0 #te&= 2No8*Dec 2003 . M"' 200@4

F(

)inear phase is of the form () = k Oere ! is constant. Thus phase shift is linearly proportional to frequency. For linear phaseB the impulse response should satisfy follo*ing condition. h n" , Z h M'1'n" 1A. F %d t)e d ! t"# t&"%$0e& 0u%ct o% 1 2M4 b' u$ %! ,5u#$e %8"& "%t ,et)od 0o& t)e "%"#o! t&"%$0e& 0u%ct o% 12$4 E 1*2SG24( A$$u,e TE0(>$ec( O s" , 1;s0# The system function of the digital filter is o$tained $y O N" , 1; 1'e'#TN'1" Since T,o.@ sec O N" , 1; 1'.AC7Y'1"

11(

Co,5"&e FIR "%d IIR 0 #te&$( 2M"' 200@4 Sl.No II2 FI2 1 O n" is infinite duration O n" is finite duration # 4oles as *ell as Neros are These are all Nero filters. present. Sometimes all pole filters are also designed. & These filters use feed$ac! from These filters do not use output. They are recursi%e filters. feed$ac!. They are nonrecursi%e. ( Nonlinear phase response. )inear phase response for h n" )inear phase is o$tained if O N" , Z h m'1'n" '1 '1 , ZY O Y " @ These filters are to $e designed These are inherently sta$le for sta$ility filtersl C Num$er of multiplication More requirement is less. 7 More complexity of )ess complexity of implementation implementation ? )ess memory is required More memory is requied 6 Design procedure is )ess complicated complication 1A Design methods3 Design methods3 1. 5ilinear Transform 1. 1indo*ing #. Impulse in%ariance. #. Frequency sampling 11 Can $e used *here sharp cutoff [sed *here linear phase characteristics *ith minimum characteristic is essential. order are required J 8e "%' t<o 5&o5e&t e$ o0 Butte&<o&t) 0 #te& "%d c)eb'$)e8 0 #te&( 2No8*Dec 200B7 M"'*Nu%e 200B7 A5& 200> . No8 200?4

12(

a. The magnitude response of the 5utter*orth filter decreases monotonically as the frequency increases \" from A to E. $. The magnitude response of the 5utter*orth filter closely approximates the ideal response as the order N increases. c. The poles on the 5utter*orth filter lies on the circle. d. The magnitude response of the che$yshe% type'I filter exhi$its ripple in the pass $and. e. The poles of the Che$yshe% type'I filter lies on an ellipse. 13( Me%t o% "%' t<o 5&ocedu&e$ 0o& d ! t M %! t)e t&"%$0e& 0u%ct o% o0 "% "%"#o! 0 #te&( 2No8 200B4 1. Impulse In%ariant Technique #. 5ilinear Transform Technique <)"t "&e t)e 5"&",ete&$ t)"t c"% be obt" %ed 0&o, t)e c)eb'$)e8 0 #te& $5ec 0 c"t o%= 2No8 200B M"' 200@4 2o&4 J 8e t)e e6u"t o% 0o& t)e o&de& N7 ,"jo&7 , %o& "%d "9 $ o0 "% e## 5$e % c"$e o0 c)eb'$)e8 0 #te&( 2No8 200>4 '1 '1 N J cosh ];^" ; cosh \S; \4" 1here ] , _ 1AA.1`s > 1" ^ , _ 1AA.1`p > 1" ;)"t "&e t)e "d8"%t"!e$ "%d d $"d8"%t"!e$ o0 b # %e"& t&"%$0o&,"t o%= Ad8"%t"!e$: 2M"' 200B4 1. Many to one mapping. #. linear frequency relationship $et*een analog and its transformed digital frequencyB D $"d8"%t"!e: -liasing ;)"t "&e t)e de$ &"b#e "%d u%de$ &"b#e 0e"tu&e$ o0 FIR F #te&$= 2M"'200B4 The *idth of the main lo$e should $e small and it should contain as much of total energy as possi$le. The side lo$es should decease in energy rapidly as * tends to : De0 %e 1"%% %! "%d B#"c3,"% < %do< 0u%ct o%$( 2M"' 200B4 T)e < %do< 0u%ct o% o0 " c"u$"# )"%% %! < %do< $ ! 8e% b' 1Oann n" , A.@ > A.@cos#:n; M'1"B AanaM'1 AB Dther*ise The *indo* function of non'causal Oanning *indo* I s expressed $y 1Oann n" , A.@ 0 A.@cos#:n; M'1"B AaGnGa M'1";# AB Dther*ise The *idth of the main lo$e is approximately ?:;M and thee pea! of the first side lo$e is at '&#d5( The *indo* function of a causal 5lac!man *indo* is expressed $y 15 n" , A.(# > A.@ cos#:n; M'1" 0A.A? cos(:n; M'1"B AanaM'1

1?(

1>(

1B(

1@(

, AB other*ise The *indo* function of a non causal 5lac!man *indo* is expressed $y 15 n" , A.(# 0 A.@ cos#:n; M'1" 0A.A? cos(:n; M'1"B AaGnGa M'1";# , AB other*ise The *idth of the main lo$e is approximately 1#:;M and the pea! of the first side lo$e is at '@?d5. 1:( ;& te t)e ,"!% tude 0u%ct o% o0 Butte&<o&t) 0 #te&( ;)"t $ t)e e00ect o0 8"&' %! o&de& o0 N o% ,"!% tude "%d 5)"$e &e$5o%$e= 2No8 200>4 GO j\"G# , 1 ; . 1 0 \;\C"#N/ *here N, 1B#B&Bb. Me%t o% t)e %ece$$"&' "%d $u00 c e%t co%d t o% 0o& # %e"& 5)"$e c)"&"cte& $t c$ % FIR 0 #te&( 2No8 200>4 The necessary and sufficient conditions is that the phase function should $e linear function *B *hich in turn requires constant phase delay or" constant phase and group delay i.e.B V *" ` * V *" , ' ` * ':a*a : ;)"t $ ,5u#$e %8"& "%t ,"55 %!= ;)"t $ t$ # , t"t o%= 2A5&*M"' 200>4 The philosophy of this technique is to transform an analog prototype filter into an II2 discrete time filter *hose impulse response .h n"/ is a sampled %ersion of the analog filterQs impulse responseB multiplied $y T. This procedure in%ol%es choosing the response of the digital filter as an equi'spaced sampled %ersion of the analog filter. ;)"t $ # %e"& 5)"$e= ;)"t $ t)e co%d t o% to be $"t $0 ed b' t)e ,5u#$e &e$5o%$e % o&de& to )"8e " # %e"& 5)"$e= 2A5& 200> . No8 20034 For a filter to ha%e linear phase the phase response c *" ` * is the angular frequency. The linear phase filter does not alter the shape of the signal. The necessary and sufficient condition for a filter to ha%e linear phase. h n" , Z h N'1'n"d A a n a N'1 ;)"t $ 0&e6ue%c' <"&5 %!= 2No8200? . M"' 200@4 The $ilinear transform is a method of compressing the infiniteB straight analog frequency axis to a finite one long enough to *rap around the unit circle only once. This is also sometimes called frequency *arping. This introduces a distortion in the frequency. This is undone $y pre'*arping the critical frequencies of the analog filter cutoff frequencyB center frequency" such that *hen the analog filter is transformed into the digital filterB the designed digital filter *ill meet the desired specifications( I $t t)e c)"&"cte& $t c$ o0 FIR 0 #te&$ de$ !%ed u$ %! < %do< 0u%ct o%$( 2No8 200?4

1F(

20(

21(

##.

23(

the Fourier transform of the *indo* function 1 ej*" should ha%e a small *idth of main lo$e containing as much of the total energy as possi$le the fourier transform of the *indo* function 1 ej*" should ha%e side lo$es that decrease in energy rapidly as * to :. Some of the most frequently used *indo* functions are descri$ed in the follo*ing sections.

2?(

;)"t "&e t)e # , t"t o%$ o0 ,5u#$e %8"& "%t ,"55 %! tec)% 6ue= 2A5&200?4 The impulse in%ariance technique is appropriate only for $and limited filter li!e lo* pass filter. Impulse in%ariance design for high pass or $and stop continuous'time filtersB require additional $and limiting to a%oid se%ere aliasing distortionB if impulse designed is used. Thus this method is not preferred in the design of II2 filters other than lo*'pass filters. J 8e t)e t&"%$0o&, &e#"t o% 0o& co%8e&t %! #o< 5"$$ to b"%d 5"$$ % d ! t"# do," %( 2A5& 200?4 )o* pass *ith cut > off frequency \C to $and >pass *ith lo*er cut'off frequency \1 and higher cut'off frequency \#3 S ''''''''''''' \C s# 0 \1 \#" ; s \# ' \1" The system function of the high pass filter is then O s" , Op < \C s# 0 \1 \#" ; s \# ' \1"= J 8e t)e K" $e& ; %do< 0u%ct o%( 2A5& 200?4 The 9aiser 1indo* function is gi%en $y 19 n" , IA e" ; IA `" B for GnG a M'1";# 1here ` is an independent %aria$le determined $y 9aiser. f , `. 1 > #n;M'1"#/ J 8e t)e b # %e"& t&"%$0o&,"t o%( 2No820034 The $ilinear transformation method o%ercomes the effect of aliasing that is caused due to the analog frequency response containing components at or $eyond the nyquist frequency. The $ilinear transform is a method of compressing the infiniteB straight analog frequency axis to a finite one long enough to *rap around the unit circle only once. S , #;T" Y'1" Y01" UNIT O III

2>(

2B(

#7.

1( E95&e$$ t)e 0&"ct o% 2/F*324 % $ !% ,"!% tude7 2A$ co,5#e,e%t %ot"t o%$ u$ %! B b t$ ( 2No8 200:4 Sign magnitude 3 1.A1AA1 #Qs complement 3 1.1A111

2( ;)"t "&e t)e 8"& ou$ 0"cto&$ <) c) de!&"de t)e 5e&0o&,"%ce o0 d ! t"# 0 #te& ,5#e,e%t"t o% <)e% 0 % te <o&d #e%!t) $ u$ed= 2No8 200:4 3( ;)"t "&e t)e t)&ee t'5e$ o0 6u"%t M"t o% e&&o& occu&&ed % d ! t"# $'$te,$= 2 No8 200B . A5& 200:4 Input quantiNation error coefficient quantiNation error product quantiNation error ?( ;)"t $ ,e"%t b' # , t c'c#e o$c ##"t o%$= 22M"' 200B7A5& 200> M"' 200@7 No8 200@ . A5& 200:4 In fixed point additionB o%erflo* occurs due to excess of results $itB *hich are stored at the registers. Due to this o%erflo*B oscillation *ill occur in the system. Thus oscillation is called as an o%erflo* limit cycle oscillation. >( E95&e$$ t)e 0&"ct o%2/@*324 % $ !%ed ,"!% tude "%d t<oA$ co,5#e,e%t %ot"t o%$ u$ %! B b t$( 2No8 200@4 Sign magnitude 3 1.AA111 #Qs complement 3 1.11AA1 B( E95&e$$ t)e 0&"ct o% @*: "%d /@*: % $ !% co,5#e,e%t( 2No8 200B4 @*: Sign magnitude 3 A.111 1Qs complement 3 A.AAA #Qs complement 3 A.AA1 ,"!% tude7 2A$ co,5#e,e%t "%d 1A$ /@*: 1.111 1.AAA 1.AA1

@( De0 %e S",5# %! &"te co%8e&$ o%( 2M"' 200@4 Sampling rate con%ersion is the process of con%erting a signal from one sampling rate to anotherB *hile changing the information carried $y the signal as little as possi$le. Sample rate con%ersion needed $ecause different systems use different sampling rates( :( Co%8e&t t)e %u,be& 0(21 %to e6u 8"#e%t B/b t 0 9ed 5o %t %u,be&( 2M"' 200@4 A.AA11A1 F( ;)' &ou%d %! $ 5&e0e&&ed to t&u%c"t o% % &e"# M %! d ! t"# 0 #te&=2M"'200@4 Lrror introduced due to rounding operation is less compared to truncation. Similarly quantiNation error due to rounding is independent of arithmetic operation. -nd mean of rounding error is Nero. Oence rounding is preferred o%er truncation in realiNing digital filter. 10( ;)"t "&e t)e d 00e&e%t 6u"%t M"t o% ,et)od$= amplitude quantiNation %ector quantiNation 2No8 200B4

scalar quantiNation

11( ;)"t $ Me&o 5"dd %!= Doe$ Me&o 5"dd %! ,5&o8e t)e 0&e6ue%c' &e$o#ut o% % t)e $5ect&"# e$t ,"te= 2No8 200B4 The process of lengthening a sequence $y adding Nerog%alued samples is called appending *ith Neros or Nero padding. 12( I $t t)e "d8"%t"!e$ o0 0#o"t %! 5o %t "& t),et c( )arge dynamic range Dccurrence of o%erflo* is %ery rare Oigher accuracy 2No8 200B4

13( J 8e t)e e95&e$$ o% 0o& $ !%"# to 6u"%t M"t o% %o $e &"t o "%d c"#cu#"te t)e ,5&o8e,e%t < t) "% %c&e"$e o0 2 b t$ to t)e e9 $t %! b t(2No8200B7No8200>4 SN2- ; D , 1C.?10C.A#$'#Alog1A 2FS ;hx" d5. 1ith $, # $its increaseB the signal to noise ratio *ill increase $y C.A# 8 # , 1#d5. 1?( D&"< t)e 5&ob"b # t' de%$ t' 0u%ct o% 0o& &ou%d %!( 2No8 200>4 Sho*s the pro$a$ility density function of error in rounding operation. 1@. Co,5"&e 0 9ed 5o %t "%d 0#o"t %! 5o %t &e5&e$e%t"t o%$( 2M"'*Nu% 200B4 Fixed 4oint -rithmetic It co%ers only the dynamic range. Compared to F4-B accuracy is poor Compared to F4- it is lo* cost and easy to design It is preferred for real time operation system Lrrors occurs only for multiplication 4rocessing speed is high D%erflo* is phenomenon rare Floating 4oint -rithmetic It co%ers a large range of num$ers It attains its higher accuracy Oard*are implementation is costlier and difficult to design It is not preferred for real time operations. Truncation and rounding errors occur $oth for multiplication and addition 4rocessing speed is lo* D%erflo* is a range phenomenon

1B( ;)"t $ de"d b"%d=

2No8 200?4

In a limit cycle the amplitude of the output are confined to a range of %alueB *hich is called dead $and. 1@( 1o< c"% o8e&0#o< # , t c'c#e$ be e# , %"ted= Saturation -rithmetic Scaling 2No8 200?4

1:( ;)"t $ Me&o %5ut # , t c'c#e o$c ##"t o%= 2A5& 200?4 Yero Input )imit Cycles3 Yero input limit cycles are usually of lo*er amplitude in comparison *ith o%erflo* limit cycles. If the system enters to the limit cycles oscillationsB it *ill continue e%en after input attains Nero range. 1F( ;)"t $ $te"d' $t"te %o $e 5o<e& "t t)e out5ut o0 "% ITI $'$te, due to t)e 6u"%t M"t o% "t t)e %5ut to I b t$= 2No8 2003 .A5& 200?4 The steady state noise po*er is $asically the %ariance of output noise. i

h he#.1;#:S GO X"G
4,

d*

Oere h

# e

': is the %ariance of input error signal.

je# , #'#)2FS# ;(?

: h , # 2 ;(? 8 k: S GO X"G# d* ': This equation gi%es steady state noise po*er due to quantiNation.
# %
'#) # FS

20( ;)"t $ ,e"%t b' 0 % te <o&d #e%!t) e00ect$ % d ! t"# 0 #te&$= 2No8 20034 The digital implementation of the filter has finite accuracy. 1hen num$ers are represented in digital formB errors are introduced due to their finite accuracy. These errors generate finite precision effects or finite *ord length effects. 1hen multiplication or addition is performed in digital filterB the result is to $e represented $y finite *ord length $its". Therefore the result is quantiNed so that it can $e represented $y finite *ord register. This quantiNation error can create noise or oscillations in the output. These effects are called finite *ord length effects. 21( ;)"t $ &ou%d/o00 %o $e e&&o&= 2ounding operation is performed only on magnitude of the num$er. Oence round'off noise error is independent of type of fixed point representation. If the num$er is represented $y $u $its $efore quantiNation and $ $its after quantiNationB then maximum round'off error *ill $e #l$'#'$u";#. It is symmetric a$out Nero. 22( ;)"t $ ,e"%t b' 0 9ed 5o %t "& t),et c= J 8e e9",5#e=

In the fixed point arithmeticB the digits to the left of the decimal point represent the integer part of the num$er and digits to the right of the decimal point represent fractional part of the num$er. For exampleB 1(@?.@C?"1A 11A1.1A1"# are the fixed point num$ers note that $ase of the num$er system is also *ritten outside the $rac!et. 23( ;)"t $ &ou%d O o00 %o $e e&&o&= 2ounding operation is performed only on magnitude of the num$er. Oence round'off noise error is independent of type of fixed point representation. If the num$er is represented $y $u $its $efore quantiNation and $ $its after quantiNationB the maximum round'off error *ill $e # '$ > #'$u";#. It is symmetric a$out Nero. UNIT O I1( De0 o%e u%b "$ed e$t ,"te "%d co%$ $te%t e$t ,"te( 2 A5& 200@7No8 200:44 Consistency is an asymptotic property 3 defining consistency requires considering ar$itrarily large samples. In real lifeB sample siNe *ill $e limited $y time or $udget constraints. So it is natural to consider *hat quality should $e expected from an estimator $ased on samples of a fixed siNe n. Then you *ould certainly hope the central region of the distri$ution of the estimator to $e close to the true %alue A of the parameter. Dne *ay of expressing this idea is to consider estimators *hose distri$ution ,e"% is equal to A for "%' %alue of nB the true %alue of the parameter . Such an estimator is said to $e u%b "$ed.B and un$iasedness translates into 3 #. E./n , A for any n

&. ;)"t "&e t)e d $"d8"%t"!e$ o0 %o%/5"&",et& c ,et)od$ o0 5o<e& $5ect&"# e$t ,"t o%= 2M"' 200@7No8 200:4 It requires long data sequences to o$tain the necessary frequency resolution. Spectral lea!age effects $ecause of *indo*ing The assumption of the autocorrelation estimate rxx m" to $e Nero for mJN. this assumption limits the frequency resolution and quality of the po*er spectrum estimate. -ssumption that the data are periodic *ith period N. these assumption may not $e realistic( ?( ;)"t $ 5e& odo!&",= 2 A5&*M"' 200:4 4eriodogram is used to detect and measure hidden periodicity in the data let us ta!e a%erage %alue of periodogram estimate from equation >( Dete&, %e t)e 0&e6ue%c' &e$o#ut o% o0 t)e b"&t#ett ,et)od o0 5o<e& $5ect&u, e$t ,"te$ 0o& " 6u"# t' 0"cto& QE1>( A$$u,e t)"t t)e #e%!t) o0 t)e $",5#e $e6ue%ce $ 1>00( 2A5& 200:4

C. De0 %e t)e te&,$ "utoco&&e#"t o% $e6ue%ce "%d 5o<e& $5ect&"# de%$ t'2A5& 200@4If x t" is the stationary random processB then its autocorrelation function is gi%en asB m xx n" , L. x+ t" x t0 n"/ Oere L ./ denotes the statistical a%erage. @( De0 %e 5o<e& $5ect&"# de%$ t' "%d c&o$$ $5ect&"# de%$ t'( 2M"'200@4 5o<e& $5ect&"# de%$ t' 4SD"B *hich descri$es ho* the po*er of a signal or time series is distri$uted *ith frequency. The instantaneous po*er the mean or expected %alue of *hich is the a%erage po*er" is then gi%en $y3

The 4SD is the Fourier transform of the autocorrelation functionB R n"B of the signal if the signal can $e treated as a *ide'sense stationary random process.

The po*er of the signal in a gi%en frequency $and can $e calculated $y integrating o%er positi%e and negati%e frequenciesB

The po*er spectral density of a signal exists if and only if the signal is a *ide' sense stationary process. The 5o<e& $5ect&u, G f" is defined as

Cross-spectral density
opust as the 4o*er Spectral Density 4SD" is the Fourier transform of the auto' co%ariance function *e may define the Cross Spectral Density CSD" as the Fourier transform of the cross'co%ariance function. :( E95#" % dete&, % $t c "%d %o%dete&, % $t c $ !%"#$ < t) e9",5#e$( 2No8200B4 Deterministic signals are functions that are completely specified in time. The nature and amplitude of such a signal at any time can $e predicted. The pattern of the signal is regular and can $e characteriNed mathematically. Lxamples3'

8 t" , `t this is a ramp *hose amplitude increases linearly *ith time and slope is `. - non'deterministic signal is one *hose occurrence is random in nature and its pattern is quite irregular. - typical example of non deterministic signal is thermal noise in an electrical circuit. F( E95#" % t)e u$e o0 DFT % 5o<e& $5ect&u, e$t ,"te= 1e !no* that the periodogram f the signal is gi%en asB 4xx f" , 1;N G8 f"G# E , 1;N G F x n" e'j#:fnG n,'E The fourier transform on right hand side of a$o%e equation can also $e e%aluated using DFT. The DFT contains N'points. It is gi%en asB N'1 4xx !;n" , 1;N G F x n" e'j#:!n;NG# n,A Thus the periodogram *ill no* $e e%aluated at discrete frequencies f! , !;N. the resolution of the spectrum can $e increased $u increasing the length of the DFT. 10( De0 %e "utoco&&e#"t o%( If x t" is the stationary random processB then its autocorrelation function is gi%en asB m xx n" , L. x+ t" x t0 n"/ Oere L ./ denotes the statistical a%erage. 11( I $t t)e %o%/5"&",et& c ,et)od$ 0o& 5o<e& $5ect&"# e$t ,"t o%( 5arlett method 1elch method 5lac!man and Tur!ey method 12( ;)"t "&e t)e $te5$ %8o#8ed % B"&t#ett ,et)od= The N'point sequence is su$di%ided into P9Q num$er of non o%erlapping segments. Lach segment has the length M. i.e.B 8i n" , x n0I M"B i,AB 1B b.!'1 Compuite the periodogram of each segment independently i.e.B M'1 4ixx f" , 1;N G F x n" e'j#:fnG# n,A Ta!e a%erage of periodograms of all the P9Q segments to get $arlett po*er spectrum estimate. !'1

4 5xx f" , 1;9 F 4ixx f" i,A This equation gi%es the estimate of po*er spectrum using 5artlett method. 13( ;)"t "&e t)e $te5$ %8o#8ed % ;e#c) ,et)od= T) $ ,et)od ,"3e$ 0e< ,od 0 c"t o%$ to B"&t#ett ,et)od( T)e t)&ee $te5$ "&e "$ 0o##o<$ to c"#cu#"te t)e 5e& odo!&",( The N'point sequence is su$di%ided into P)Q num$er of segments. These segments o%erlap o%er each other. The data segment is passed through the *indo* and then periodogram is calculated. The po*er density spectrum is then o$tained $y a%eraging the modified periodogram. 1?( De0 %e B#"c3,"% "%d tu&3e' ,et)od= The 5lac!man and tu!ey suggested a ne* method in *hich less *eight is gi%en to end points of rxx m"B %ariance is %ery high. -s per this methodB the autocorrelation sequence is first passed through a *indo* * m". this *indo* shapes rxx m" in such a *ay that *eights of end points are reduced.

UNIT O 1( ;)"t "&e t)e 0"cto&$ t)"t ,"' be co%$ de&edd <)e% $e#ect %! " DSP 5&oce$$o& 0o& "% "55# c"t o%= 2No8 200:4 2( St"te t)e ,e& t "%d de,e& t o0 ,u#t 5o&ted ,e,o& e$=2M"' 200@7No8 200:4 3( ;)"t $ ,e"%t b' 5 5e# % %!= 2A5&200: . No8 200@4 - pipeline is the continuous and some*hat o%erlapped mo%ement of instruction to the processor or in the arithmetic steps ta!en $y the processor to perform an instruction. 1ith pipeliningB the computer architecture allo*s the next instructions to $e fetched *hile the processor is performing arithmetic operationsB holding them in a $uffer close to the processor until each instruction operation can $e performed. The staging of instruction fetching is continuous. The result is an increase in the num$er of instructions that can $e performed during a gi%en time period. ?( ;)"t $ t)e 5& %c 5"# 0e"tu&e$ o0 t)e )"&8"&d A&c) tectu&e=2A5& 200:4 The Oar%ard architecture has t*o separate memories for their instructions and data.It is capa$le of simultaneous reading an instruction code and reading or *riting a memory or peripheral.

>( D 00e&e%t "te bet<ee% 8o% Neu,"%% "%d 1"&8"&d "&c) tectu&e= 2M"' 200@4 Sl.No Oar%ard -rchitecture qon'Neumann -rchitecture 1 Separate memories for It shares same memory for program and data. program and data. # The speed of execution in The speed of execution is Oar%ard architecture is increased $y pipelining high & In this architecture ha%ing It is ha%ing a separate inter%al a common inter%al address address and data $us. and data $us. ( It is not suita$le for DS4 It is normally used for Oar%ard processors. architecture. B( J 8e t)e d ! t"# $ !%"# 5&oce$$ %! "55# c"t o% < t) t)e TMS 320 0", #'( 2No8 200B4 DS4 processors should ha%e circular $uffers to support circular shift operations. The DS4 processor should $e a$le to perform multiply and accumulate operations %ery fast. DS4 processors should ha%e multiple pointers to support multiple operands jumps and shifts. @( ;)"t 200B4 $ t)e "d8"%t"!e o0 1"&8"&d "&c) tectu&e o0 TMS 320 $e& e$= 2No8 It shares same memory for program and data The speed of execution is increased $y pipelining It is ha%ing a separate inter%al address and data $us. It is normally used for Oar%ard architecture

3>( ;)"t "&e t)e de$ &"b#e 0e"tu&e$ o0 DSP P&oce$$o&$= 2No8 200B4 o DS4 processors should ha%e multiple registers so that data exchange from register to register is fast. o DS4 operations require multiple operands simultaneously. Oence DS4 processor should ha%e multiple operand fetch capacity. o DS4 processors should ha%e circular $uffers to support circular shift operations. o The DS4 processor should $e a$le to perform multiply and accumulate operations %ery fast.

o DS4 processors should ha%e multiple pointers to support multiple operands jumps and shifts. o Multi processing a$ility.

3B( ;)"t "&e t)e d 00e&e%t t'5e$ o0 DSP A&c) tectu&e= qon'Neumann -rchitecture Oar%ard -rchitecture Modified Oar%ard -rchitecture 3@( De0 %e MAC u% t= The dedicated hard*are unit is called M-C. It is called multiplier' accumulator. It is one of the computational unit in processor. The complete M-C operation is executed in one cloc! cycle. The DS4 processors ha%e a special instruction called M-CD. This means multiply accumulate *ith data shift. 3F( Me%t o% t)e Add&e$$ %! ,ode$ % DSP 5&oce$$o&$( Short immediate addressing Short Direct -ddressing Memory'mapped -ddressing Indirect -ddressing C.@ $it re%ersed addressing mode Circular addressing ?0( St"te t)e 0e"tu&e$ 0 TMS320>C>9 $e& e$ o0 DSP 5&oce$$o&$( 4o*erful 1C $it C4[ TDM port 1C81C $it multiplies ; -dd operations can $e performed in single cycle. ##(981C $it maximum addressa$le external memory space. Full duplex synchronous serial port for coder ; decoder interface. Dn'chip scan $ased emulation logic. 5oundary scan )o* po*er dissipation ILLL standard text access ports ?1( De0 %e P"&"##e# #o! c u% t= It executes logic operations on the data *ithout affecting the contents of -CC. 4)[ pro%ides $it manipulation *hich can $e used to setB clearB test or toggle $its in data memory control or status registers. ?2( De0 %e $c"# %! $) 0te&=

The scaling shifter has a 1C $it input connected to the data $us and &# > $it output connected to the -)[. The scaling shifter produces a left shift of A to 1C $its on the input data. The other shifters perform numerical scalingB $it extractionB extended precision arithmetic and o%erflo* pre%ention. ?3( De0 %e ARAU % TMS320C>H 5&oce$$o&= -2-[ meant -uxiliary register and auxiliary register arithmetic unit. These register are used for temporary data storage. The auxiliary register file is connected to the auxiliary register arithmetic unit. The contents of the auxiliary register can $e -2-[ helps to speed up the operations of C-)[. ??( ;)"t "&e t)e I%te&&u5t$ "8" #"b#e % TMS320C>H 5&oce$$o&$= It has four general purpose interrupts. INT( INT1 2S 2eset" NMI Non > Mas!a$le interrupt" ?>( ;)"t "&e t)e "dd&e$$ %! ,ode$ "8" #"b#e % TMS320C>H 5&oce$$o&$= Direct Indirect Immediate 2egister Memory mapped Circular -ddressing ?B( ;& te t)e $'%t"9 o0 "$$e,b#' #"%!u"!e $'%t"9( The source statement can contain follo*ing four ordered fields. i.e.B .)a$el/.3/ mnemonic .operand list/ .d comment/ The source statement follo*s follo*ing guidelines -ll the statements must $egin *ith a la$elB a $lan!B an asteris! or a semicolon. )a$els may $e placed $efore the instruction mnemonic on the same line or on the proceeding line in the first column. Lach field must $e separated *ith $lan!s. If comment $egins in column 1 it must ha%e semicolon or asteris! at its $eginning. In other columnsB comments can $egin *ith semicolon. PART O B 1. UNIT O I a" T*o finite duration sequences are gi%en $y x n",cos n :;#" for n,AB1B#B& A B else*here No% #AA?"

h n", A.@" for n,AB1B#B& A B else*here i" Calculate the ( point DFT 8 !" 2efer $oo!3 Digital signal processing $y S.Sali%ahanan pgno3&((" ii" Calculate the ( point DFT O !" iii" If r !",8 !"O !"Bdetermine y n"Bthe in%erse DFT of r !" #. a" D$tain an ?'point DIT FFT flo* graph from first principles. May #AA7BNo% #AA?" 2efer $oo!3 Digital signal processing $y S.Sali%ahanan pgno3&#A" $" [sing the a$o%e flo* graph compute DFT of x n" , cosn :;( for n,AB1BbB 7 No% #AA?" a" Discuss in detail the important properties of the Discrete Fourier Transform 2efer $oo!3 Digital signal processing $y S.Sali%ahanan pgno3&A?" $" find the ( point DFT of the sequence x n" , Cos n:;( -pr #AA?"

&.

(. Compute an ? point DFT using DIF FFT radix # algorithm 8 n" , <1B#B&B(B(B&B#B1= May #AAC T -pr #AA?" 2efer $oo!3 Digital signal processing $y S.Sali%ahanan pgno3&(A" @. a" D$tain an ?'point DIF FFT flo* graph from first principles. 2efer $oo!3 Digital signal processing $y S.Sali%ahanan pgno3&&(" $" [sing the a$o%e flo* graph compute DFT of x n" , cosn :;( for n,AB1BbB 7 No% #AA7B-pril #AA?"

C. T*o finite duration sequences are gi%en $y 8 n" , sin n :;# for n,A.1.#.& and h n" ,#n for n,AB1B#B& find circular con%olution using DFT method. No% #AA7" 7. i. calculate the DFT of the sequence x n" , . 1B1B'#B'# ii. Determine the response of )TI system $y radix > # DIT FFT. iii. Oo* do you linear Filtering $y FFT using sa%e'add methods 2efer $oo!3 Digital signal processing $y S.Sali%ahanan pgno3&71" a"

?. State and pro%e parse%alQs theorem for discrete > time Fourier Transform. May #AAC" 2efer $oo!3 Digital signal processing $y S.Sali%ahanan pgno3&1A" 6. Find the ? point DFT of the sequence x n" , .1B#B&B(B(B&B#B1/ using decimation'in' time radix '# FFT algorithm. May #AAC" 2efer $oo!3 Digital signal processing $y S.Sali%ahanan pgno3&#6" 1A. i. finite duration sequence of length ) is gi%en as 8 n" , 1 for oana)'1 A for other*iseB May#AA7"

Determine the N point DFT of the sequence for N,). ii. 4erform the circular con%olution of the follo*ing t*o sequences. 81 n" , <# 1 # 1= 8# n" , <1 # & (= May #AA7" 2efer 5oo!3 Digital signal processing 2amesh 5a$u. pgno3MV&#" 11. Dra* the $utterfly diagram using ? point DIT > FFT for the follo*ing sequences. 8 n" , < 1BABABABABABABA= May#AA7" 2efer 5oo!3 Digital signal processing 2amesh 5a$u. pgno3(.&C" 1#. Compute the DFT of each of the follo*ing i" x n" , t n'nA" ii" y n" , x1 n" x# n"

May #AA7"

1&. - DFT program is a%aila$leB ho* *ill you this to compute in%erse DFT. May #AA7" 1(. T*o real signals of x n" and y n" are of length M. find the FT of x n" and y n" *ith minimum computation. May#AA7" 1@. Compute the DFT of the sequenceBx n",<1BAB1BAB1BAB1BA= and hence find 8 #". 2efer $oo!3 Digital signal processing $y 2amesh 5a$u. pgno3&.16" -42 #AA@ CS" 1C. Dra* the FLT flo*chart for radix >#BDIT algorithm. -ssume N,?. -42 #AA@ CS" 2efer $oo!3 Digital signal processing $y nagoor !ani. pgno#1&" 17. Find the ? pt DFT of the sequence -42 #AA@ IT" x n",< 1 AHnH7 < A other*ise using DIT FFT " 2efer $oo!3 Digital signal processing $y 2amesh 5a$ui. pgno3(.#C" 1?. Compute the ? pt DFT of the sequence NDq A( IT" x n",<A.@BA.@BA.@BA.@BABABABA= using DIT FFT 2efer $oo!3 Digital signal processing $y 2amesh 5a$u. pgno3(.&A" 16. Determine the ? pt DFT of the sequence -42 A( IT" x n",<ABAB1B1B1BABABA= 2efer $oo!3 Digital signal processing $y nagoor !ani. pgno3##C" #A. 1hat is DIF algorithm. 1rite the similarities and differences $et*een DIT and DIF. 2efer $oo!3 Digital signal processing $y nagoor !ani. pgno3#16" -42 A( IT" #1. Determine ?pt DFT of x n",1 for >&HnH& using DIT'FFT algorithm. -42 A( IT" 2efer $oo!3 Digital signal processing $y 2amesh 5a$u. pgno3@.(6" ##. D$tain the ?pt DIT FFT algorithm

2efer $oo!3 Digital signal processing $y nagoor !ani. pgno3#A7" #&. D$tain the ?pt DIF FFT algorithm x n",<#B#B#B#B1B1B1B1= NDq A( LC" 2efer $oo!3 Digital signal processing $y nagoor !ani. pgno3##@" #(. D$tain the ? pt DIF FFT algorithm x n",<AB1B#B&BB(B@BCB7= -42 A@ LC" 2efer$oo!3Digital signal processing $y nagoor !ani. pgno3##(" UNIT O II 1. - $and reject filter of length 7 is required. It is to ha%e lo*er and upper cutoff frequencies of & 9ON and @ 9ON resp. The sampling frequency is #A9hN. Determine the filter coefficients using Oanning *indo*. -ssume the filter to $e causal. NDq A?" 2efer $oo!3 Digital signal processing $y 2amesh 5a$u. pgno3MV#A" #. Design a digital 5utter*orth filter that satisfies the follo*ing constraint using $ilinear transformation. -ssume T,A.1 sec. NDq A?" jX A.? H GO e "GH 1 B A H GXG H A.# jX GO e "G H A.# B A.C H GXG H 2efer $oo!3 Digital signal processing $y S.Sali%ahanan pgno3(&7" &. Determine the magnitude response of an FI2 filter M,11" and sho* the phase and group delays are constant O N" , h n" N'n -pr #AA?" (. If the desired response of a lo*'pass filter is Od ejX", e'j&XB '&:;( a * a &:;( AB &:;( H GXG H : Determine O ejX",for M,7 using a Oamming 1indo*. -pr #AA?"

@. For the analog transfer function O s" , 1; S01" S0#" determine O N" using impulse in%ariant technique. -ssume T,1sec. -pr #AA?" 2efer $oo!3 Digital signal processing $y S.Sali%ahanan pgno3(#C" C. Design a digital $utter*orth filter that satisfies the follo*ing constraint using $ilinear transformation T , 1 Sec" A.6aGO ejX"G a1 for AaXa:;# GO ejX"G aA.# for &:;(a Xa : -pr #AA?" 2efer $oo!3 Digital signal processing $y S.Sali%ahanan pgno3(&7" 7. Descri$e the design of FI2 filters using frequency sampling technique. 2efer $oo!3 Digital signal processing $y 2amesh 5a$u. pgno3C.?A ?. The desired frequency response of a lo* pass filter is gi%en $y Od ejX", e'j#XB ':;( a * a :;(

AB :;( H GXG H : determine the filter coefficients hd n". o$tain the coefficients h n" of FI2 filter using a rectangular *indo* defined $y * n" , 1B A a n a ( AB other*ise No% #AA7" 2efer $oo!3 Digital signal processing $y S.Sali%ahanan pgno3&6?" 6. Design a digital $utter*orth filter satisfying the follo*ing specifications A.7aGO ejX"G a1 for AaXaA.#: GO ejX"G aA.AA(B for A.C:a Xa : -ssume T,1 sec. -pply impulse in%ariant transformation No% #AA7"

1A. Design an FI2 filter using rectangular *indo*. The magnitude specification is gi%en Fig.1 . first 1A coefficients only/ May #AA7"

Figure Oere 11. design a digital 5utter*orth filter satisfying the constraints A.7A7aGO ejX"G a1 for AaXa:;# GO ejX"G aA.# for &:;(a Xa : *ith T,1 sec using 1. 5ilinear Transformation. #. Impulse in%ariance. 2ealiNe the filter in each case using the most con%enient realiNation form. May #AA7" 2efer $oo!3 Digital signal processing $y 2amesh 5a$u. pgno3@.76" 1#. Design a Che$yshe% filter *ith a maximum pass $and attenuation of #.@ d5d at \ p , #A rad;sec and the stop $and attenuation of &A d5 at \ S , @A rad;sec. May #AA7" 2efer $oo!3 Digital signal processing $y 2amesh 5a$u. pgno3@.#7" 1&. Design an ideal Oil$ert transformer ha%ing frequency response May #AA7" O ejX" , j for ': aX aA , 'j for A aX a: using i" rectangular *indo* ii" $lac! man *indo* For N,11 plot the frequency response in $oth cases. 2efer $oo!3 Digital signal processing $y 2amesh 5a$u. pgno3C.7@" 1(. 2ealiNe the system gi%en $y difference equation May #AA7" y n" , 'A.1 y n'1" 0 A.7#y n'#" 0 A.7x n" > A.#@ #x n'#" in parallel form 2efer $oo!3 Digital signal processing $y 2amesh 5a$u. pgno3@.C1" 1@. -n FI2 filter is gi%en $y the difference equation y n" , #x n" 0 (;@x n'1"0&;#x n'#"0#;&x n'&" determine its lattice form. May #AA7" 2efer $oo!3 Digital signal processing $y 2amesh 5a$u. pgno3C.11("

1C. [sing a rectangular *indo* technique design a lo* pass filter *ith pass $and gain of unityB cut off frequency of 1AAA ON and *or!ing at a sampling frequency of @ 9ON. The length of the impulse response should $e 7. May #AA7" 2efer $oo!3 Digital signal processing $y 2amesh 5a$u. pgno3C.67" 17. Deri%e the frequency response of a linear phase FI2 filter *ith symmetric impulse response. NDq A(LC" 2efer $oo!3 Digital signal processing $y nagoor !ani. pgno3&C" 6. Lxplain in detail a$out frequency sampling method of designing an FI2 filter. NDq A( IT" 2efer $oo!3 Digital signal processing $y 2amesh 5a$u. pgno3@.&7'@.(A" 1A. 1hat are the issues in designing FI2 filter using *indo* method. -42 A( IT" 2efer $oo!3 Digital signal processing $y nagoor !ani. pgno3&7A" 11. i" Mention the ad%antages and disad%antages of FI2 and II2 filters. -42 A(IT" 2efer $oo!3 Digital signal processing $y 2amesh 5a$u. pgno3@.@6" ii".State the merits and demerits of FI2 filter. NDqA&IT" 2efer $oo!3 Digital signal processing $y 2amesh 5a$u. pgno3@.@#" 1#. [sing the 5ilinear transform design a high pass filterB monotonic in NDqA@LC" 4ass $and *ith cutt off frequency of 1AAAON and do*n 1Ad5 at &@AON.The sampling frequency is @AAAON 2efer $oo!3 Digital signal processing 2amesh 5a$u. pgno3 @.C#" 1&. i" -n analog filter has a transfer function. [sing impulse in%ariant method con%erts to digital filter. NDqA(IT" O s" , 1A ''''''''''''''' s#07s01A ii" 2efer $oo!3 Digital signal processing Nagoor !ani. pgno3#16" [sing $ilinear transformation con%ert to N domain at T,1sec. NDqA&IT" O s", 1 ''''''''''''' s01" s0#" 2efer 5oo!3 Digital signal processing 2amesh 5a$u. pgno3@.(6" 1(. [sing impulse in%ariant mapping technique con%erts the follo*ing -nalog transfer function to digital assume T,A.1sec NDq A( LC" O s" , # ''''''''''''' s01" s0#" 2efer $oo!3 Digital signal processing 2amesh 5a$u. pgno3(.#C"

UNIT O III 1. i"Consider $01"'$it including sign $it" $iplar -DC. D$tain an expression for signal to quantiNation noise ratio.State the assumptions made. No% #AA?" 2efer $oo!3 Digital signal processing 4roa!is pgno37@&" ii"Consider the truncation of negati%e fraction num$ers represented in e01" > $it fixed point $inary form including sign $it. )et e'$" $its $e truncated. D$tain the range of truncation errors for signed magnitude. #Qs complement and 1Qs complement representations of the negati%e num$ers. No% #AA7BNo% #AA?" 2efer $oo!3 Digital signal processing $y 2amesh 5a$u. pgno3MV.#1" #. i"The coefficients fo a system defined $y O N" , 1 1'A.&N '1" 1'A.C@N'1" are represented in a num$er system *ith a sign $it and & data $its using signed magnitude representation and truncation. Determine the ne* pole locations for direct realiNation and for cascade realiNation of first order systems. No% #AA?" 2efer $oo!3 Digital signal processing $y 2amesh 5a$u. pgno3MV.##" ii"-n III2 causal filter is defined $y the difference equation y n" , x n"' A.6Cy n".The unit sample response h n" is computed such that the computed %alues are rounded to one decimal place. Sho* that under these stated conditionsB the filter output exhi$its dead $and effect. 1hat is the dead $and ranges No% #AA?" 2efer $oo!3 Digital signal processing $y 2amesh 5a$u. pgno3MV.##" &. Discuss in detail the truncation error and 2ound'off error for sign magnitude and t*oQs complement representation. -pr #AA?" 2efer $oo!3 Digital signal processing $y 2amesh 5a$u. pgno37.6" (. Lxplain the quantiNation effects in con%erting analog signal into digital signal. -pr #AA?" 2efer $oo!3 Digital signal processing 4roa!is pgno37@A" @. a" - digital system is characteriNed $y the difference equation r n" , A.6y n' 1"0x n" *ith x n" , A and initial condition r '1" , 1#. Determine the dead $and of the system. 2efer $oo!3 Digital signal processing $y 2amesh 5a$u. pgno3MV.1C" $" *hat is meant $y the co'eefficient quantiNations Lxplain. -pr #AA?" 2efer $oo!3 Digital signal processing $y 2amesh 5a$u. pgno37.#6"

C. -n ?'$it -DC feeds a DS4 system characteriNed $y the follo*ing trnafer function O N" , 1; N0A.@" estimate the steady state quantiNation noise po*er at the output of the system. No% #AA7" 7. The coefficients fo a system defined $y

1 1'A.(N " 1'A.@@N'1" are represented in a num$er system *ith a sign $it and & data $its using signed magnitude representation and truncation. Determine the ne* pole locations for direct realiNation and for cascade realiNation of first order systems. No% #AA7" 2efer $oo!3 Digital signal processing $y 2amesh 5a$u. pgno3MV.##"
'1

O N" ,

?. -n III2 causal filter has the system function O N" , N ; N'A.67" assume that the input signal is Nero'%alued and the computed oputput signal %alues are rounded to one decimal place. Sho* that under these stated conditionsB the filter output exhi$its dead $and effect. 1hat is the dead $and ranges No% #AA7" 6. i"The input to the system y n" , A.666y n'1"0x n" is applied to an -DC. 1hat is the po*er produced $y the quantiNation noise at the output of the filter if the input is quantiNed to i" ? $its ii" 1C $its May #AA7" 2efer $oo!3 Digital signal processing $y 2amesh 5a$u. pgno3MV.#7" ii"con%ert the follo*ing decimal num$er into $inary3 May #AA7" a. #A.C7@"1A $. 1#A.7@"1A 2efer $oo!3 Digital signal processing $y 2amesh 5a$u. pgno3MV.#7"

1A. consider the transfer function O N",O1 N"O# N" *here O1 N" , 1; 1'a1N'1" and O# N" , 1; 1'a#N'1" . find the output round off noise po*er. -ssume a 1 , A.@ and a# , A.C and find output round off noise po*er. May #AA7BNo% #AAC" 2efer $oo!3 Digital signal processing $y 2amesh 5a$u. pgno3MV.#7" 11. explain the characteristics of a limit cycle oscillation *ith respect to the system descri$ed $y the difference equation y n" ,A.6@y n'1"0x n". determine the dead $and of the filter. No%#AAC" 1#. Dra* the product quantiNation noise model of second order II2 system. No% #AAC" 1&. Lxpain the effect of finite *ord length effects. -42 A@ LC" 2efer $oo!3 Digital Signal 4rocessing $y Nagoor !ani pg no #C(" 1(. Deri%e the steady state noise po*er at the output if an )TI system due to quantiNation at the input. NDq A( LC" 2efer $oo!3 Digital Signal 4rocessing $y Nagoor !ani pg no #7@T#6(" 1@. Lxplain a$out fixed point and foating point representation. NDq A( LC" 2efer $oo!3 Digital Signal 4rocessing $y 2amesh 5a$u. pg noC.&?TC.&6" 1C. Discuss limit cycles in digital filters. NDq A& LC" 2efer $oo!3 Digital Signal 4rocessing $y Nagoor !ani pg no &A7" 17. Dra* the quantiNation noise model for a second order

system *ith system function. O N" , 1 '''''''''''''''''''''''''''''' 1 ' #rcosA N'1 0 r# N'#

-42 A@ LC"

1?. Determine the steady state noise. 2efer $oo!3Digital Signal 4rocessing $y Nagoor !ani pg no #7C" 16. Lxpain coefficint quantiNation effects in direct form realiNation of II2 filter. -42 A( LC" 2efer $oo!3 Digital Signal 4rocessing $y Nagoor !ani pg no C.1&ATC.1&1" #A. - digital sytem is characteriNed $y the difference equation. -42 A( LC" y n",A.6y n'1"0x n" 2efer $oo!3 Digital Signal 4rocessing $y Nagoor !ani pg no C.1&A" #1. For the gi%en transfer function O N", O1 N " O# N" *here O1 N" , 1 ; 1'A.@N'1" T O# N" , 1 ; 1'A.(N'1". Find the output round off noise 4o*er. Calculate the %alue if $,& NDqA@LC" 2efer $oo!3 Digital Signal 4rocessing $y Nagoor !ani pg no 7.@6" ##. Lxplain the characteristics of a limit cycle oscillation *ith respect to the system descri$ed $y the difference equation y n" ,A.6@y n'1" 0x n" Determine the dead $and of the filter. NDqA@LC" 2efer $oo!3 Digital Signal 4rocessing $y Nagoor !ani pg no 7.C&" #&. Find the effect of co'efficient quantiNation on pole location of the Ki%en second order II2 system *hen it is realiNed in direct form I and in cascade form. -ssume a *ord length of ( $its through truncation O N" , 1 NDqA@LC" '''''''''''''''''''''''' 1 ' A.6 N'10 A.# N'1 2efer $oo!3 Digital Signal 4rocessing $y Nagoor !ani pg no 7.CC" 1. UNIT O Ii" 1ith suita$le relationsB descri$e $riefly the periodogram method of po*er spectral estimation. Lxamine the consistency and $ias of periodogram. No% #AA?BMay #AA7" 2efer $oo!3 Digital signal processing 4roa!is pgno36A#" ii"Compare the $asic principles used in 5arlett and 1elch method in spectrum estimation No% #AA?" #. i"Lxplain ho* the 5lac!man method is used in smoothing the periodogram. Deri%e the mean and %ariance of the po*er spectral estimate No% #AA?" 2efer $oo!3 Digital signal processing 4roa!is pgno361&"

ii"Determine the frequency resolution of the 5artlettB 1elch and 5lac!man ' Tu!ey methods of po*er spectral estimation for a quality factor V,#@. -ssume that o%erlap in 1elchQs method is @Au and the length of the sample is #@AA. No% #AA?" 2efer 5oo!3 Digital signal processing 2amesh 5a$u. pgno36.&6" &. Lxplain the 5artlett method fo a%eraging periodograms. No% #AA7B-pr #AA?" 2efer $oo!3 Digital signal processing 4roa!is pgno361A" (. 1hat is the relationship $et*een autocorrelation and po*er spectrums 4ro%e it. -pr;May #AA?" 2efer $oo!3 Digital signal processing 4roa!is pgno36A#" @. Deri%e the mean and %ariance of the po*er spectral estimate of the 5lac!man and Tu!ey method. -pr #AA?" 2efer $oo!3 Digital signal processing 4roa!is pgno361&" C. D$tain the expression for mean and %ariance of the autocorrelation function of random signals. -pr #AA?" 7. Lxplain ho* the $lac!man and tu!ey method is used in smoothing the periodograms deri%e the mean and %ariance of the po*er spectral estimate of the $lac!man and tu!ey method. No%#AA7" 2efer $oo!3 Digital signal processing 4roa!is pgno361&" ?. Determine the frequency resolution of the 5artlettB 1elch and $lac!man'tu!ey methods fo po*er spectral estimation for a quality factor V,1@. -ssume that o%erlap in *elcchQs method is @Au and the length of the sample is 1@AA. No%#AA7" 2efer 5oo!3 Digital signal processing 2amesh 5a$u. pgno36.&6" 6. Determine the performance characteristics of non'parametric po*er spectrum estimators 1elchB 5artlett and 5lac!man and Tu!ey. No% #AAC T May #AA7" 2efer $oo!3 Digital signal processing 4roa!is pgno361C" 1A. Determine the frequency resolution of the 5artlettB 1elch and 5lac!mann'Tu!ey methods of po*er spectral estimation for a quality factor V,#A. assume that o%erlap in *elchQs method is @Au and the length of the sample is #AAA. May #AA7" 2efer 5oo!3 Digital signal processing 2amesh 5a$u. pgno36.&6"

11. compute the autocorrelation and po*er spectral denity for the signal 8 t" , -cos #:fAt0v" *hen - and fA are constants. w is a random %aria$le *hich is uniformly distri$uted o%er the inter%al random %aria$le *hich is uniformly distri$uted o%er the inter%al ':B :". May #AA7" 1#. Compute the autocorrelation and po*er spectral density for the signal. 8 t",- cos #ft 0 " *here - and fc are constantBA is a random %aria$le *hich is uniformly distri$uted o%er the inter%al 'B" 2efer $oo! 3 Digital signal processing $y Si%anandham . 4g no 1A.#? T 1A.#6" 1&. D$tain the Lstimation of of autocorrelation 2efer $oo! 3 Digital signal processing $y Si%anandham . 4g no 1A.#CT1A.#7" 1(. Lxplain the t*o methods of smoothing the 4eriodogram 2efer $oo! 3 Digital signal processing $y pohn K.4roa!is . 4g no 6A#'6AC" 1@. D$tain the %ariance of of *elch po*er spectrum estimation. 2efer $oo! 3 Digital signal processing $y pohn K.4roa!is . 4g no 6A#'6AC" 1C. Compute the energy density spectrum of a signal. 2efer $oo! 3 Digital signal processing $y pohn K.4roa!is . 4g no 6A#'6AC" 17. - signal *ith %oltage spectrum o. 8 f",< 1B fHA.1 AB other*ise is con%ol%ed *ith the rectangular *indo* of length N,C1. determine the spectrum of 8 f" gi%en $y 8 f", 8 "1 f'"d 2efer $oo! 3 Digital signal processing $y pohn K.4roa!is . 4g no 6A#'6AC" 1?. D$tain the 4eriodogram estimate of the sequence x n",<AB1B#B&= using DFT. $" Lxplain the use of DFT in 4o*er Spectrum estimation. 2efer $oo! 3 Digital signal processing $y Si%anandham 4g no 1A.&A'1A.#6" UNIT O 1. i"Lxplain *hat is meant $y instruction pipelining. Lxplain *ith an exampleB ho* pipelining increases the throughput efficiency. May #AA7BNo% #AA?" 2eference $oo!3 Digital signal processing $y %en!atramani p.no.(@ ii"- multiplier > -ccumulatorB *ith three pipe stagesB is required for a digital signal processor. S!etch a $loc! diagram of a suita$le configuration for the M-C. 1ith the aid of a timing diagramB explain ho* the M-C *or!s. May #AA7BNo% #AA?"

#.

i"In relation to DS4 processorB explain the follo*ing techniques3 SIMDB q)I1. In each caseB clearly point out the ad%antages and disad%antages of the technique in signal processing. May #AA7BNo% #AA?" 2eference $oo!3 Digital signal processing $y %en!atramani p.no.(( ii" 1ith a suita$le diagram descri$e the functions of multiplier;adder unit of TMS &#AC@(8. May #AA7BNo% #AA?" 2eference $oo!3 Digital signal processing $y %en!atramani p.no.#C7

&. Descri$e the Multiplier and accumulator unit in DS4 processors. No% #AA7" 2eference $oo!3 Digital signal processing $y %en!atramani p.no.(A (. Lxplain the architecture of TMS &#AC@8 processor. No% #AA7" 2eference $oo!3 Digital signal processing $y %en!atramani p.no.@C @. Discuss in detail the four phase of the pipeline techniques. No% #AA7" 2eference $oo!3 Digital signal processing $y %en!atramani p.no.(@ C. 1rite short notes on a. 4arallel logic unit $. Circular registers.

No% #AA7"

7. Lxplain ho* Oar%ard architecture as used $y the TMS &#A family differs from the strict Oar%ard architecture. Compare this *ith the architecture of a standard %on Neumann processor. May #AA7" ?. Ki%e the !ey features of digital signal processor. No%#AAC" 2eference $oo!3 Digital signal processing $y %en!atramani p.no.(A 6. *rite short notes on3 a. &#'$it accumulator $. 1C 8 1C $it parallel multiplier No%#AAC" c. Shifter.

1A. Lxplain the function of auxiliary registers in the indirect addressing mode to point the data memory location. No%#AAC" 2eference $oo!3 Digital signal processing $y %en!atramani 11. 1rite a program to use the auxiliary register in memory pointing and looping. 1#. 1rite a program to compute the follo*ing equation3 a. r , -+81 0 5+8# 0 C+8& $oo!3 Digital signal processing $y %en!atramani No% #AAC" 2eference

1&. 1rite a program to perform addition of t*o C( $it num$ers. No% #AAC" 2eference $oo!3 Digital signal processing $y %en!atramani

1(. explain the operation of TDM serial ports in 4'DS4Qs May #AA7" 2eference $oo!3 Digital signal processing $y %en!atramani 1@. Lxplain the operation of CSS[ of TMS&#AC @(8 and explain its use considering the qiteri operator. May #AA7" 2eference $oo!3 Digital signal processing $y %en!atramani 1C. Ki%e a detail account of the 4ipeline structure and operation of TMS&#AC@8 2efer $oo!3 Digital signal processing $y qen!ataramani pg no 1AA" 17. 5riefly explain the follo*ing a"C-)[ $"-2-[ c"IND8 d"-2C2 2efer $oo!3 Digital signal processing $y qen!ataramani pg no @6BCA" 1?. Ki%e in detail a$out assem$ly language instruction of TMS&#AC@8 2efer $oo!3 Digital signal processing $y qen!ataramani pg no C6'?6" 16. Lxplain a$out 4)[ B4rogram counter and flags in TMS&#AC@8 2efer $oo!3 Digital signal processing $y qen!ataramani pg no CA'C#" #A. Lxplain in detail a$out 4ipeline operation in C@(8 2efer $oo!3 Digital signal processing $y qen!ataramani pg no &#7'&&#" #1. 1hat are the -rithmeticB)ogical and control instruction of C@(8 2efer $oo!3 Digital signal processing $y qen!ataramani pg no &A1'&1(" ##. Lxplain a$out -)[BCSS[BD-KLN and 4-KLN. 2efer $oo!3 Digital signal processing $y qen!ataramani pg no #A@B#C6B#7#" #&. Lxplain @(8 5uses and Internal Memory organisation of C@(8 2efer $oo!3 Digital signal processing $y qen!ataramani pg no #@?T #@6" #(. 1hat are 5M-2 and 522 and memory mapped registers. 2efer $oo!3 Digital signal processing $y qen!ataramani pg no @7'CA" #@. Lxplain a$out Dn'Chip memory and Dn'chip peripherals 2efer $oo!3 Digital signal processing $y qen!ataramani pg no C#'C@"

4repared $y

-ppro%ed $y

ODD;LCL