Reg. No: B.Tech.

DEGREE EXAMINATION, JUNE 2011 Fifth Semester EE0303 DIGITAL SIGNAL PROCESSING
(For the candidates admitted from the academic year 2007-2008 onwards)

Time: Three hours

Max. Marks: 100

PART A (10 2 = 20 Marks) Answer ALL Questions 1. 2. 3. What are the different types of discrete signal representation? State sampling theorem. Determine the z-transform of the discrete signal x(n) = {4, 3, 2, 5}

4. 5. 6. 7. 8. 9. Define: System function. List any four properties of Fourier transform. What is meant by radix-2 FFT? What are the requirements for a digital filter to be stable and causal? Write the relation between digital and analog frequency in impulse invariant transformation. What are the advantages of FIR filters?

10.

List some of the finite word length effects in digital filters.

PART B (5 16 = 80 Marks) Answer ANY FIVE Questions

11. i.

Test the following systems for time invariance and linearity (a ) y (n) = x(n) + C (b) y (n) = nx 2 (n) .(12 Marks)

ii.

Test the causality of the following systems (a ) y (n) = x(n) + 2 x(n 1) (b) y ( n) = x(n) . (4 Marks) Realize the system with difference equation 3 1 1 y (n) = y (n 1) y (n 2) + x(n) + x(n 1) . In direct 4 8 3 form-II and cascade form.
x(n) = cos n at N = 8 . 4

12.

13.

Find

x(k)

using

DIT-FFT

algorithm. 14. The specification of the desired low pass filter is 0.8 | H ( ) | 1.0 0 0.2 | H ( ) | 0.2; 0.32 Design chebyshev digital filter using bilinear transformation.
Design a high pass filter using rectangular window, with a cut-off frequency of 1.2rad/sec and N=9.

15.

16. i.

Perform the linear convolution of two sequences h( n) = {1, 2, 2, 1} by tabular method. x(n) = {1, 2, 3, 1} and
Derive any four properties of z-transform. Explain the following with an example. (a) Sign magnitude form (b) Ones complement form Find H(z) of Ha ( s ) =

ii. 17. i.

ii.

( s + 1)( s + 2 )

with T=1sec. Apply

bilinear transformation.

*****