Anna University Chennai 2005-1st Sem B.E Electrical and Electronics Engineering VESTER EE337 - DIGITAL SIGNAL PROCESSING - Question Paper

ANNA UNIVERSITY :: CHENNAI – 600 025 MODEL ques. PAPER
VI - SEMESTER
B.E. ELECTRICAL AND ELECTRONICS ENGINEERING
EE337 - DIGITAL SIGNAL PROCESSING
Time: 3hrs Max Marks: 100
ans all ques.
PART – A (10 x two = 20 Marks)
1. describe even and odd signals.
2. State the disadvantages of digital signal processing over analog processing.
3. Check whether the subsequent system is time-invariant. y (n) = n . x2 (n)
4. State and prove initial value theorem.
5. describe convolution property of continuous time and discrete time signals.
6. What is the method of finding IDFT through DFT?
7. What is aliasing? How it can be eliminated?
8. describe acquisition time and aperture time.
9. find the digital filter transfer function of the subsequent analog filter using
impulse invariant transform. H (s) = 1/(s+1) (s+2).
10. What is warping effect?
PART – B (5 x 16 = 80 Marks)
11.i) Develop the algorithm for radix 2, 8-point decimation in time – FFT method.
(12)
ii) obtain the DFT of the sequence x(n) = { 0, 1, 2, three } using DIT - FFT algorithm.
(4)
12.a)i) obtain the inverse Z-Transform of X(Z) = (z2 + z) / (z-1) (z-3), ROC | z | > three by
partial fraction method. (9)
ii) Determine the Z transform of x (n) = n (-1)n u(n). (7)
OR
12.b)i) State and prove convolution theorem in Z transform. (6)
ii) obtain the Z transform and ROC of the signal x(n) = -bn u(-n-1) (6)
iii) obtain the transfer function of the subsequent LTI system: (4)
y(n) = y(n-1) – 0.5 y(n-2) + x(n) +x(n-1)
13.a)i) State and prove Parseval’s theorem in continuous time Fourier Transform. (8)
ii) Show the relationship ranging from DFT and DTFT. (4)
iii) obtain the output of an LTI system whose impulse response is h(n) = {1, 1, 1}and
input signal is x(n) = {3, -1, 0, 1}, using circular convolution. (4)
OR
13.b)i) Determine the IDFT of the subsequent sequence using DIF-FFT method. (10)
X(k) = {20, -5.828 + j 2.414, 0, -0.172 – j 0.414, 0, -0.172 – j 0.414, 0, -5.828 +j
2.414}
ii) Prove that all real and even signals will have real and even spectra in DFT. (6)
14.a) discuss in detail the concept of sampling, recovery of signal and discrete time
processing of continuous – time signals. (16)
OR
14.b)i) discuss with block diagrams, the functioning of serial – parallel sub-ranging and
ripple A/D converters. (10)
ii) discuss any 1 kind of D/A converter with schematic diagram. (6)
15.a)i) Apply bilinear transform to the transfer function,
H(s) = 2/(s+1) (s+3) by assuming T = 0.1s. (5)
ii) Design a digital butterworth filter satisfying the subsequent constraints using
bilinear transform. presume T = one sec.
0.9 = | H (?) | = 1, 0 = ? = p/2;
| H (?) | = 0.2, three p/4 = ? = p. (11)
OR
15.b)i) discuss briefly the theory of Chebyshev approximation of digital filter design(4)
ii) Design a digital Chebyshev filter satisfying the subsequent constraints using
bilinear transform. presume T = one sec.
0.707 = | H (?) | = 1, 0 = ? = 0.2p;
| H (?) | = 0.1, 0.5p = ? = p. (12)
-----

Earning:   Approval pending.