CNN A er [3563] -— 194
'T.E. (Computer) (Sem. - I) Examination, 2009
DIGITAL SIGNAL PROCESSING
(2003 Course)
Time : 3 Hours Max. Marks : 100
Instructions : 1) Answers to the two sections should be written in separate
books.
2) Neat diagrams must be drawn wherever neces:
ry.
3) Use of logarithmic tables, slide rule, Mollier charts, electronic
pocket calculator and steam tables is allowed.
4) Assume suitable data, if necessary.
5) Attempt Q. 1 or Q. 2, Q. 3 or Q. 4, Q. 5 or Q. 6 from
Section I and Q. 7 or Q. 8, Q. 9 or Q. 10, Q. 11 or Q. 12
from Section IL.
SECTION ~1
1. A) Define 8(n) and u (n). Show that
u(n)=¥ 8(a-K) 6
&
B) Test the following system for linearity and time invariance :
y(n) =2x(n) +x (n-1) 6
C) Define: i) CT signal ii) DT signal
iii) Quantization iv) Sampling period 6
OR
2. A) Obtain the linear convolution of two DT signals. 8
x(n) =u (n)-u(n-4)
h(n) =2[8(n) + 8@-1)][3563] - 194 e ‘ADV EL A
B) Define step response and impulse response of a system. How stability and
causality can be described in terms of impulse response ? Test it for the system
y (n) =2 x(n) +x (n=1) 10
3. A) Define Fourier Transform (FT). Obtain it for
x(n) =(a)" u(n), Ja] <1.
State the necessary conditions for the existence of FT. 8
B) Derive the relationship between Fourier Transform (FT) and Z - Transform
(ZT). What is ROC? 8
oR
4, A) State and prove the convolution property of FT. 8
B) Using power - series method obtain Inverse ZT (IZT) for
224) yy 5
3Z° 4+3Z-1
5. A) Define i) Rational ZT and ii) Pole zero plot. Explain in detail how a behaviour
of a causal signal can be described by means of pole zero plot. 10
B) Obtain system function H (z) and draw a pole zero plot
=fy@=-Deximex(a-D, 6
OR{N00 000 8 a [3563] - 194
6. A) With example, explain the method of simple geometric interpretation (construction)
to obtain the frequency response of DT system. 10
B) Determine the system function H (z) and impulse response h (n) for a system.
1
y(n) =2x (a) + Syn) with y (- 1) =0. 6
SECTION - Tl
7. Derive 1* stage of Radix-2 Decimation In Time (DIT) FFT algorithm. Draw a
signal flow graph for N = 8. Explain the basic butterfly structure and obtain the
computational complexity of FFT algorithm. 18
OR
State the convolution property of DFT. How circular convolution is different than
linear convolution ? Using graphical method find out N - point circular convolution
of
x, (n) = (1, -1, -2, 3, 1]
x, (n) = {1, 2,3} 18
9. A) Explain Gibbs phenomenon observed in FIR filter design. State the desirable
features of window functions. 8
B) Explain the design steps of FIR filter using windowing method. 8
OR