B. Tech. | TEN-704 ISEVENTH ODD SEMESTER THEORY EXAMINATION 2009-10) FUNDAMENTAL OF DIGITAL SIGNAL PROCESSING Tine. Howes) Nate: (i) Answer alt questions 4 At questions carry qual marks 1. Attempt any four parts of the following questions: (a) Compate the signal energy for x(0) eer. no meM0 Vforrz0 ay een Ani. t 2 be fixe ot J! (oF “fet P= ae Joa [Total Marks; 100 Q.1(b) Explain testability condition or the DSP systems Hescribed by the equation iG 1% 2 re ted flee ae ae J! i at =u tle seotL 8, sole F cqetto 1 paeyen 2, Feeney 7 roesince 40 isan even signa [200 = 0)) Cis average value of signal x() “a Zp ae PO ah _ At Sieh Fe 7 omAF,t irc Q.1(d) Compute DFT of thesequence-xa]~{0,1, 2, 3,). Define twiddle factor and its properties also. 123) Using the periodicity property of W, and the symmetry property Warm = Ws we wy we we wy =[PE WR we We we we we We OWE WD We, . yoru beatoi t rww2 we) Np 7 “teow? wo w2]T fa a at tp we wy Wd Ao, 6 et f-242d Xo Wae(P 2-2): Twiddle Factor: Hw e™, Property: Asymmetry Prdpery: W, Periodicity Propeny W, "= W, 5 (0 Circa time siafing extn) AL x), then axl (mod NY} PEE x(a) 0 Shifting ofthe sequence by units in the time ‘domain is equivalent to shultiplication of « ™"in the frequency domain Proott DFT{x(0-Dy} Ne = Yxdin-d)ge ao » Satu-merm wo Ne 4D arn ne = But 2((n=D)y 2xN—1 a) tet Dea) cP a « Bawrctene 2%vet ‘Change the ihdex from m to m= n—, then scr pen Pa ee zm DET{2¢4 -In} = Sse — myer 20 weit : fh 2S etme Paces =F eae wo ao Same anen 2 Fame Peony = XN-K) prt {x("-D)} vel = S xeme Beene tem, (iy Cireutar Time Reversat vtsun Poe te then, «(CE )N = (Ny a Xm) 8A. Reversing the N ~ pt sequence in time is equivalent to reversing the DFT values. Proof: . vet peti = Sime en Cireutar Convolution: nae we med sane ae wer aso? Folded sequence Product {equence x,(0)=2+2+0+2-601-2 neiet nee “er Folded sequence rotated by ‘One unit in time, vane moet Tadd vers nee Folded sequence rotaied by ‘vo units in time mes nae on vgs sored one? Folded sequence rotated by tee units in time Cireular Convolution x 0 =(6,7.6,5} 2, Attempt any four parts of the following questions : $6220 4a) Draw the spectrum of a sampled signat and explain aliasing, Ans, Let () be a continuous ime varying signa. The signal x¢)issampled at eeulr interval of time svith sampling period (7). The sampled signal x(t) is given by MAT) = jogg = 0IT 00 En <> ee + ‘ “The continuous tie signal x) i multiplied by the ‘sampling function s() whieh is a series of impulses the resultant signal is a discrete time signel x). Paeeuence 52) ae OF pt sequence +9) Pis2eO22=5 x(a) 919-200), | -wenee, Aliasing: | ‘Thespectrum off band ltd analog signal is.as shows in (a). The spectrim is ero for} 12 8. the sampling frequency Fis pelected to be greater than 28. she spectrum XCF Al) ofthe diserete ime signat is show int) i i sh i~ {tthe sampling frequency F, is selected such han #2 2B, then taan ‘eit AKA. £) FX UAV IFISA 2 Fy) “There is no aliasing therefore the spectrum of ciscrete time signal is identical 1 spectrum of analog ienal within the fundamental frequency range <5 ost WF, <28] results in spect The signal contains| (he analog sign thatthe aliasing signal from sam ithe periodic continuation of X(F) overlap as shown in Fig‘. of A(FIF,) of the discrete time aliased frequency components of spectrum. (F). The end results is loecurs which prevents recovery of le. @.20H) Discuss the process of reconstruction of the signal fron its samples. Obtain the impulse response of at ideal reconstruction filter, Aus. Process of Reconstruction: rg rove “ Eee | Qa a ‘The reconstruction ofthe signal from is samples is Viewed as a linear filtering process in which a Viserete time sequence of short pulses with amplitudes equal to the signal samples, excites an analog filer. The analog filter corresponding o the ‘ideal interpolator has 2 feequeney response LA T |Fise fe WA = wa OF oe 14) Fourier transform of the interpolation tunetion et. ‘Given te discrete time signal.) withthe spectrum NUP) with no aliasing, tis possible to reconstruct the original analog signal fromthe samples (7). fn the abscence of aliasing i KR cerry (Fist gp AIFS) LFS A= 0 Fie 2 By Fourier ransform, rhe xf El) = Be xqme ern Fs zt Inverse Fodjrier transform of X,(F), Ft ape J xe Par an Le A, =2B,2 UR ES anf orern ae ‘ oniesep f+ impulse resporise of eq, digital filler is. Ke) qh SE 4euserr)system response of digital syitem Hay = 5 mm2-" “= is aemtasonle eof a > agent sa) zn Stes Iisa one to one mapping from S-lomain to the 2- domain. This method is conforms! mapping that transfor the as ito the unit ice inthe Z- plane only once, Ms) las) 9" TG) yee sor ras aking Inverse Laplace ao Sp tend = OX) Applying trapezoidal re “ 7 J tou = Toca) rant -1)] wer 2 ot J aoa. i Bae | f ier aro MoT)-yrT=-7 + Com Dorn = Lacan +E ir 7) Taking Zt system function of digital filteris v(Z) 6 2 =D. WO) =a) ca Thiez 5 Attempt any {wo parts of the following questions: 10x2=20 (2) Write short noteson (1) Goertzet Ajgorithm {2) Effect of fite workd length in digital Alters. Ans. (1) Goertzel/Algorithm: it exploits the periodicity ofthe pase factors (M4) and allows to expres the compptation ofthe DFT as a linear filling operation. Sinbe W’,- "= 1, we ean multiply DFT by this factor. wis! 40 = Hh see =! = [SS xemurg hm feo SS semis ris the com sequence x(n) of impalse response n of finite duration input feth “N’ with a filter that has fifo) = We we, anttoisthatetesot orate 288 ie Ma) = ya)in=N-‘The filter with impulse response h(n) has system function filter bas a pote on unit cacka’, =2nk.M) FET::~ The aspect of noriparametric power spectiuun Thus the entire OFT can be computed by estimates is their computation requirements. The passing the block of input data ito a sarallel bank _TWSix-2 FFT algo isassomed inal the computations ‘oFN single pole fillers where each ite"has pole at Boitlett power spectrum estimate the eoresponding frequency of DFT. £2) Etec of ite word length diptal fers FeTidayn == 22 ay Kal systems are ienplemented either in haaware or in softwar. the filler coeff. are stored » in binary registers. These registers can No.of FFIs* = sti Nay ‘accommodate only a finite no, of bits apd henee the M ot Coe’ have to be truneated or rounded off in ‘order toi iato these registers. Truncaiingortending ‘off the death eesults in degradation of system performance. ‘The lation of poles and 2eras ofthe resulting system wil be diferent from the oi snal locations adc he system may hve en Wekch pomer pcre frag, response than the one desire FFT leegth © M=128/a¢ Due 10 finite capacity of registers overflow cceus hich lad 10 overtow lr eyeles. pat wo otters = 2 soy stan noe be ssn ae (Sty Esplin how DET and FET attain sera per spect eimabon Deine o.oo = 24($4up 1} periodogram.— ee us - us DET FFT wets in pone pee tO vg 2 " - af DET: The estimated energy density spectnn (ante pesiodogram P,(/ ean be ccmputed cow einer Forwindowing 2 AF mutiptieins are Pesiodogram sven by eid LIS aqme’ 728 ‘Tike samples of the peridograin canbe obtained by DET algo, LetJ=Ab where k= 0,1.2,-N—I, the penadogtam begomnes rf)Perkodogram >= N The estimate for poner density spectrum is called fe O Sad pentose, wer." fur, no ¥ _ nee hates gn + (fir) > estimate for auto correlation function. etmleaca+ {ns 2 : 2 ot . ae ps LS sore ” 2, f gina {xe-s{ne )} ne 0.5 (¢) Draw the fw graph ofan8 point DIF FFT wy gorithm and explain then, ane Seng At 8 p(DIF FET ulgortta oe cunt algorit hy spitingthe DFT formula = naa ato avo smmations, one of shih involves the geKen|= SS enmity sanm over the first 9/2 data points andthe second of ‘sum involves the last A/2 data points. “The use of these 1 0 compute N?2 pt gel vst DFT is shown wre Seng eS canes : . oe co Ba J « “0 “= a cept wae “a sqm ee foe) ‘> Sin WI DSA “ sag Fo a OF Lae x [me ecnt afore) me ” ™ 7 * @ Doevinsne «Spi NG) into even & odd numbered __— This computational procedure can berepeated samples ‘through decimatidn of the 2 pt DFT Xk) and , sk + 1). THe emtire process. involves 21 Teena afne livdtg oT IORN stages OF decimation. where each stage v0 TE Lieven] ete Sane A ade shoe Fg) computation of Nept DFT via DIF ~ FFT algo. cate (2) ohne mtn N tog, complex voce 8 Ganafeek|faf, sn