PLEASE DO SEND YOUR QUESTION PAPERS TO QUESTIONPAPERFINDER@GMAIL.COM TO IMPROVE OUR DATABASE

Featured Post

KEAM Previous Years Question Papers and Time Table

Sunday, March 23, 2014

AI 09 601-DIGITAL SIGNAL PROCESSING MAY 2012 (2009 Admissions)

SUBJECT - DIGITAL SIGNAL PROCESSING

CODE -  09 601

SEMESTER - SIXTH

BRANCH - AI

UNIVERSITY - CALICUT

YEAR - 2012

DOWNLOAD LINK AVAILABLE AT THE END OF THIS POST


Part A
Answer all Questions

1.Show that DFT is a linear transform.
2.State the convolution property of the DFT.
3.Name any two errors occur due to finite word length effects in DSPs.
4. Define linear phase characteristics of a filter.
5.What is a MAC in a DSP chip?
(5x2=10 marks)

Part B
Answer any four questions,
6.Show that DFT of real signal is conjugate symmetric and DFT of a conjugate symmetric signal is real.

7.A data sequence having 10,000 samples is to be filtered using a 101 FIR filter. The filter is implemented in the DFT domain using 512 point DFT and overlap add method. Find out the percentage savings in computation (number of multiplications and additions required) compared to the direct implementation of convolution.

8.Draw the signal flow graph of direct form realizations (Type I and Type II) for the HR filter represented by
1 +2;_1 + 3~-2 + 2_-3
1 + O^-1 - 0.8;-2 + 0.5~_3

9.Using bilinear transform, determine the digital filter transfer function corresponding to the analog filter.

10. Discuss the architecture design enabling parallel processing in a Digital Signal Processor
H(s) = (8+0.1)/(8+0.1)^2+9 Take T=1

Part C
Answer all questions

11.(a) Show that linear convolution can be implemented through circular convolution and describe
the steps involved in implementing linear filtering in the DFT domain using overlap save method.
Or
(b) With appropriate signal flow graph, explain the implementation of decimation in time FFT algorithm for computing an eight point DFT. Also determine the number of complex multiplications and additions required for the DFT computation.

12.(a) Draw the direct form realization and lattice structure realization of the FIR filter repre¬
sented by the transfer function H(c) = 1 + 2.88c:-1 + 3.404c:-2 + 1.74c:-3 + 0.4c-4.
Or
(b)Obtain the impulse response of the filter y(n) = x(ri) + 0.5i/(n — 1) assuming four bit representation for the coefficients and input x(?i).

13.(a) Determine the system function H(z) of the lowest-order Chebyshev digital filter that meets
the following specifications:
i.0.5 dB ripple in the pass-band 0 < \w\ < 0.24?r.
ii.At least 50 dB attenuation in the stop-band 0.35TT < |u;| < 7T. Draw the Direct form II implementation of the filter.
Or
(b) Design an FIR linear phase filter using frequency sampling method approximating the ideal frequencey response.
H(w){ 1, for |w|<= pi/6
        { 0, for pi/6 <|w|<= pi
Assume filter length L=11.Draw the filter structure in Direct form

14.(a) What are the distinct features of DSP processor architecture? Explain with an example
processor architecture.
Or
(b) What is meant by instruction pipelining? Explain with an example how pipelining increases through put efficiency.

(4x10=40 marks)

Download




No comments :

Post a Comment

scrollbox { height:100px width:400px overflow:auto; }