Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 2

P.

A COLLEGE OF ENGINEERING AND TECHNOLOGY


POLLACHI – 642 002
Model Examination
Duration : 3 hr Date: 03.2011
Course : Digital Signal Processing Max Marks: 100
Programme : B.E (EEE) Class: IV semester / II year
PART – A (20*2=40)
ANSWER ALL QUESTIONS:
1. What are the advantages of FIR filters?
2. What is Gibb’s phenomenon?
3. Compare the rectangular window and hamming window.
4. List the desirable features of Kaiser Window spectrum.
5. What are the advantages and disadvantages of digital filter?
6. What is prewarping? Why it is employed?
7. Write the properties of butterworth filter.
(s+ 1)
8. Obtain H(z) for the function Ha(S)= using IIM.
( s+ 2 ) (s +4 )
9. Write the properties of chebyshev filter.
10. Define Kaiser Window.
11. Find whether the signal is power, energy or neither energy nor power signal
x(n)=(1/3)n u(n).
12. What is aliasing? How can it be overcome?
13. Relate unit step & unit impulse function.
14. Determine the fundamental period of the signal x(n)= e j2n.
15. When a system is said to be stable?
16. Relate z transform & Fourier transform.
z−4
17. Find z-1 [ ]
1−az−1
18. Compare DFT & DTFT.
19. State initial value theorem of z transform.
20. Compare DIT & DIF algorithms.
PART – B (5*12=60)
ANSWER ANY FIVE QUESTIONS
21. Find the convolution of the signals
x(n)= 1 n= -2,0,1
=2 n= -1
=0 elsewhere
h(n)=δ(n)- δ(n-1)+ δ(n-2)- δ(n-3).
22. a)Find i) z[rn cos(ωo n) u(n)] ii) i) z[rn sin(ωo n) u(n)]
b)State and prove convolution & parseval’s property of z transform.
23. Find the output of the system whose input & output is related by
y(n)=y(n-1)-12y(n-2)+2x(n)-x(n-2) for the input x(n)=u(n).
24. Given x(n)=2n and N=8, find X(k)using DIT FFT & DIF FFT algorithms.
25. Explain the architecture and features of TMS 320C54 signal processing chip.
26. Design a high pass filter using hamming window, with a cut off frequency of 1.2 radians/sec
and N=9.
27. Design a butterworth lowpass digital filter satisfying the specifications
0.89 ≤ |H(w)| ≤ 1.0, 0 ≤ w ≤ 0.2∏
|H(w)| ≤ 0.18, 0.3 ∏ ≤ w ≤ ∏ using BLT.
28. Design a digital Butterworth filter satisfying the constraints

0.707 ≤ |H(ejw))| ≤ 1 for 0 ≤ w ≤
2
3∏
|H(ejw))| ≤ 0.1 for ≤ w ≤ ∏ by using IIM.
4

You might also like