Scribd
Upload
9 views

dsp

que

Uploaded by

Somu Vel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
9 views

dsp

que

Uploaded by

Somu Vel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Reg.

No :

SALEM COLLEGE OF ENGINEERING AND TECHNOLOGY


B.E/B.Tech. DEGREE EXAMINTION, NOV/DEC 2017
MODEL EXAMINATION
ELECTRONICS AND COMMUNICATION ENGINEERING
EC 6502 / PRINCIPLES OF DIGITAL SIGNAL PROCESSING
Year/ Sem: III/V
Date:10.10.2017 Time: 2 ½ Hrs Maximum: 100 marks
Answer ALL Question
PART A-(10 × 2=20 marks)
1. Obtain the circular convolution of the following sequence X(n)={1,2,1} & y(n)={1,-2,2}.(Nov/Dec 2010)
2. Define DFT pairs.(Nov / Dec 2010)
3. Find the digital transfer function H(z) by using impulse invariant method method for the analog transfer
function H(s) = 1/(S+2) . Assume T = 0.5 sec. (May/June 2007)
4. Draw the direct form-I structure of IIR filter?( Apr/May 2014, 2010)
5. Determine deadband of the filter?(Nov/Dec-2012)
6. Compare truncation with rounding errors?(Apr/May-2012)
7. what is zero input limit cycle oscillation?(Nov/Dec-2009)
8. What is meant by down sampling and up sampling?(Nov/Dec-2011)
9. Give the application of multirate DSP?(May/June-2013,Nov/Dec-2014,2016)
10. What is anti-imaging filter?(May/June-2013)

Answer ALL Question


PART B-(5 × 16 = 80 marks)
11. (a) i) Obtain 8 point DFT of the sequence x(n) = {0.707, 1, 0.707, 0, -0.707, -1, -0, 707, 0} (8)
using radix 2 decimation in time FFT algorithm. (Nov/Dec 2014)
ii Perform the linear convolution of finite duration sequences h(n) = {1,2} and (8)
) x(n) ={1,2,-1,2,3,-2, -3,-1,1,2,-1}by overlap save method. (Nov/Dec 2016)
Or
(b) i) Compute the FFT for the sequence x(n) = n+1 where N=8 using the inplace radix 2 (8)
decimation in frequency algorithm.
ii Perform the linear convolution of finite duration sequences h(n) = {-1,1} and (8)
) x(n) ={1,2,3,4,4,3,2,1}by overlap save method. (Nov/Dec 2016)

12. (a) Design a digital Butterworth filter that satisfies the following constraint using bilinear
transformation. Assume T = 1 sec.
π
0.9 ≤ |H(ω)| ≤ 1 0≤ ω ≤
2
3π
|H(ω)| ≤ 0.2 ≤ ω ≤ π (Nov/Dec 2010, Apr/May 2013)
2
Or
(b) 2
For the analog transfer function: H(s) = . Determine H(z) using impulse
( S +1 ) (s+2)
invariant method. Assume T=1 seconds. (Nov/Dec 2014)
13. (a) i) What is called quantization noise? derive the expression for quantization noise power?
(Apr/May-2012)
ii Explain fixed point and floating point number representations?(Nov/Dec-2004)
)
Or
(b) Discuss in detail the error results from rounding and truncation?(Nov/Dec-2010)
14. (a) Explain decimation by a factor D . Write an expression for decimation signal at the
output.(Apr/May-2011,2012)
Or
(b) What is the principle of interpolation? Derive the expression for interpolated signal of the
output?( Apr/May-2011,2012)
15. (a) Write a short note on adaptive filter?(Nov/Dec-2010)
Or
(b) Discuss the following :(a) product quantization error
(b)limit cycle oscillations.(Nov/Dec-2014)

VERIFIED BY SUBJECT INCHARGE EXAMCELL CO ORDINATOR PRINCIPAL

You might also like