Total No. of Questions : 10] SEAT No.

:
PA-917 [Total No. of Pages : 2
[5927]-349
B.E. (Computer Engineering)
DIGITAL SIGNAL PROCESSING
(2019 Pattern) (Semester - VII) (410244E) (Elective - III)
Time : 2½ Hours] [Max. Marks : 70
Instructions to the candidates:
1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8, Q.9 or Q.10.
2) Neat diagrams must be drawn wherever necessary.
3) Figure to the right indicate full marks.
4) Your answer will be valued as a whole.
5) Use of logarithmic tables slide rule, Mollier charts, electronic pocket calculator
and steam tables is allowed.
6) Assume suitable data, if necessary.
Q1) a) Find the Z - transform of the following discrete time signal and find the
ROC. [8]
n −n
 1 1
i) x ( n ) =  −  u ( n ) +   u ( − n − 1) .
 5 2
n
1
ii) x ( n ) = ( n + 0.5 )   u ( n ) .
5
b) State and prove the convolution property of Z - transform. [6]
OR
Q2) a) An LTI system is described by equation y (n) = x (n) + 0.8 x (n – 1) +
0.8 x(n – 2) – 0.49 y(n – 2). Determine the transfer function of the
system. Sketch the poles and zeros on the z – plane. [8]
b) Find the impulse response of the system described by the difference
equation, y (n) – 3y (n – 1) –4y (n – 2) = x (n) + 2x (n – 1). [6]

1 1
Q3) a) The transfer function of a system is given by, H ( z ) = −1
+
1 − 0.5 z 1 − 2 z −1
Determine the stability and causality of the system for [8]
i) ROC : |z| > 2;
ii) ROC : |z| < 0.5
b) State and prove the following properties of DFT: [6]
i) Time reversal property.
ii) Complex conjugate property.
OR
[5927]-349 1 P.T.O.
Q4) a) If x1(n) = {1, 2, 1, –2} and x2(n) = {3, –2, 1, –3} compute the circular
convolution using DFT-IDFT method. [8]
b) Explain Gibbs phenomenon in detail. [6]

Q5) a) Find 8-point DFT using radix-2 DIF FFT algorithm for the given sequence:
x(n) = {–1, 0, 2, 0, –4, 0, 2, 0}. [8]
b) Show and compare computational complexity is reduced if 16-point
DFT is computed using radix-2 DIT FFT algorithm. [6]
OR
Q6) a) Compute the DFT of following sequences using DIT FFT algorithm.[8]
i) x (0) = {1, 2, 3, 4}
ii) x (n) = {1, 2, 3, 1}
b) Explain in detail DIFFFT algorithm. [6]

Q7) a) Realize the following FIR system with minimum number of multipliers.
h (n) = {–0.5, 0.8, –0.5} [8]
b) Compare FIR and IIR filters. [6]
OR
Q8) a) Design a Butterworth filter using impulse invariant method transformation
to satisfy the following specifications.
0.707 < | H (e) jω | < 1; for 0 < ω < 0.2π
| H (e) jω | < 0.2; for 0.6 π < ω < π. [8]
b) What is bilinear transformation? Explain the properties of BLT. [6]

Q9) a) Write a short note on: SHARC DSP processor. [6]

b) What are the desirable features of DSP processors? [4]
c) What is prewarping? [4]
OR
Q10)a) Realize the cascade and parallel structure of the system governed by the
3 1 1
difference equation, y ( n ) −
y ( n − 1) − y ( n − 2 ) = x ( n ) + x ( n − 1) .
10 10 9
[6]
b) Explain following window functions:
i) Hammimng window [4]
ii) Hanning window [4]

  

[5927]-349 2