Nirma University Institute of Technology Semester End Examination (RPR), May - 2019 B. Tech. in Electronics and Communication Engineering, Semester-V EC506 Digital Signal Processing Roll / Exam Supervisor's No. initial with date Time: 3 Hours Max. Marks: 100 Instructions: 1. Attempt all questions. Qu Q.2 Q3 0 ml Vv 2. Figures to right indicate full marks. 3, Draw neat sketches wherever necessary. SECTION -1 Answer the following questions. ( Any three) 18) Justify: The DFT transform is periodic in both frequency and time domain even though the original time domain sequence to be transformed is not periodic. Give reasoning: “The causal FIR filters obtained by simply truncating and right-shifting the impulse response of the ideal filters exhibit an oscillatory behavior in their respective magnitude response.” Also how can oscillatory behavior be reduced? Justify your answer. If the Bilinear Transformation is used to transform a continuous-time analog all-pass filter to a discrete-time digital filter, the resulting digital filter will also be an all-pass system. Justify: A causal system is stable, if and only if, all poles of its transfer function H(z) are inside the unit circle in the z-plane. Consider the complex sequence [06] x{n] =e, 0snsN-1, 0, © otherwise (a) Find the N-point DFT X{k] of the finite-length sequence xn]. (b) Find the DFT of x{n] for the case wo 2n ko/N, where ko is an integer. Find the inverse-Z transform h(n) of the following transfer function. [04] H() = (2)/(2 - 0.3)(@ + 0.5) ROC: |2| > 0.5 Let x(n) be the sequence with the pole at z = %, and two zeros at 21 evi"/2 and zz = e3/2, Sketch the pole-zero plot for: (i) y(n) = (1/2) x(n) (ii) win) = x(n}cos(en/2) (06) oR Determine the zeros for the following systems and indicate whether the [06] system is minimum phase, maximum phase, or mixed phase. () M2) =6 + 23-22 (ii) Hulz) = 1-23 - 622 What concept makes the decimation-in-time FFT algorithm [10] computationally very efficient? Compute the 8-point DFT of the page \/oQ4 A Q5 A Qe A Ecsvé sequence x(n) =cost"E)using the DIT-FFT algorithm. Show all intermediate results. Obtain Direct Form I, transpose of Direct Form I and parallel form of [06) He) = 3 [1+ 0.227) (1+ 24) ] / [( 1+ 0.527 )(1- 0.42") SECTION - 11 Derive order of IR filter equation. Design an IIR lowpass Butterworth [12] digital filter using Bilinear Transformation method satisfying following specifications: (i) 09s|M(w)|sl for Oswsa/2 (ii) [HQ|s02 for 3a/4swsa Assume T= Is, OR Design an IR lowpass Butterworth digital filter using impulse [12] invariance method satisfying the specifications 0.89125 s |H(e%)|< 1, 0s |als 0.21, |H(e®) |< 0.17783, 0.3 |o|s n. What is finite word length effect? How to reduce the effect of it? [06] Compare various quantization methods and their effects in filter design. () Design an FIR linear phase digital bandpass filter to pass digital [10] frequencies in the range from ae: = 1.2 to ag = 2.3 radians/sample using the window method. The filter length should be M = 5 (ic. order = 4), and the Hanning window function is wuany(n) = 0.5 - 0.Scos{(2nn/(M - 1); 0 sn M-~ 1. (ii) Plot the magnitude response of the filter you have designed (iii) If you are asked to implement this filter using delays, adders and multipliers, draw the block diagram of the hardware. Why FIR filter is linear phase filter? Prove the condition for linear phase. [06] Derive Type-II FIR filter Equation and plot its magnitude and phase response, Why multirate signal processing required? Explain with clear reason [08] that antialiasing filter is used before or after downsampler or upsampler? How DSP processor is different than General purpose processor? [08] Explain the operation of DSP processor with VLIW architecture for any one cycle of fetch, decode and execute with diagram. Explain Circular buttering, SIMD and pipeline MAC with diagram. pogealn