Question Paper Code:: (10 2 20 Marks)
Question Paper Code:: (10 2 20 Marks)
Reg. No. :
(Regulations 2017)
Time : Three Hours Maximum : 100 Marks
2. List the necessary and sufficient condition for a random process is said to be
wide sense stationary process.
12. a) Explain the Bartlett and Welch method of smoothing the periodogram and
evaluate the performance measures. (13)
(OR)
b) Explain the periodogram method of spectrum estimation in detail and also
obtain the variance of the periodogram. (13)
14. a) Starting from the basic principles, derive the LMS weight update equation
and explain the LMS adaptive algorithm in detail. (13)
(OR)
b) Explain in detail about exponentially weighted RLS and sliding window
RLS algorithms. (13)
15. a) With neat diagram and relevant expressions, explain the time domain and
frequency domain characteristics of a decimater with a decimation factor
of ‘D’. (13)
(OR)
b) Draw the polyphase decomposed structure of a 15-tap FIR filter with a
decomposition factor of ‘3’. (13)
*X85082* -3- X 85082
Part – C (1�15=15 Marks)
16. a) Assume that v(n) is a real-valued zero-mean white Gaussian noise with
sv2 = 1, x(n) and y(n) are generated by the equations
x(n) = 0.5x(n – 1) + v(n),
y(n) = x(n – 1) + x(n).
i) Compute the power spectrum of x(n) and y(n). (7)
ii) Compute Ry(k); for k = 0, 1, 2, 3. (4)
iii) ARMA(1, 1) spectral estimate. (4)
(OR)
b) A simple averaging filter is defined as
1
y[n ] =
N
(x[n − 1] + ... + x[n − N ])
This is clearly an FIR filter.
i) Let N = 4. Determine the transfer function, its zeros and poles ; (4)
ii) determine a general form for zeros and poles for any N ; (4)
iii) By comparing y(n) and y[n – 1] determine a recursive implementation.
Also the transfer function, together with its zeros and poles of the recursive
implementation. Looking at this example, can we say that “any” recursive
filter is IIR ? (7)
–––––––––––––