A 1L2O

B.E./B.Tech. DEGREE EXAMINATION, MAY/JUNE 2006.

Fifth Semester
Computer Science and Engineering
CS 331
-
DIGITAL SIGNAL PROCESSING
Time : Three hours Maximum : 100 marks
Answer ALL questions.
PART A
- (10 x2 =
20 marks)
1. Define Shift-Invariant svstem.
2. Define Causalitv.
3. List the advantages of FIR systems over IIR systems.
4. Define
'twiddle
facLor' of FFT.
5. What are the conditions to be satisfied for constant phase delay in linear phase
FIR filters?
6. List the well known design techniques for linear phase FIR filter.
7. What is the main drawback of impulse-invariant mapping?
8. Why IIR fiiters do not have linear phase?
9. Distinguish between first order and second order filters.
10. What is the need for scaling in digitai filters?
w
w
w
.
M
a
a
n
a
v
a
N
.
c
o
m
11.
( i )
PARTB- ( Sx16=80mar ks)
Obtain and sketch the impulse response of shift invariant system
described by
f
( n) =
0. 4x( n) + x( n- 1) + 0. 6( z
- 2)
+ x( n
-
3) + 0. 4x( n
-
4) .
( 8)
(i i )
An LTI system is described by the equation
! ( x)
=
x( n) +0. 8l x( n
- 1)
+ 0. 81r f u
- 2) - 0. 45y( n - 2) .
Det er mi ne t he
transfer function of the system. Sketch the poles and zeros on the
y-plane. (8)
12.
(a) (i)
State and prove convolution property of discrete Fourier transform.
( 8)
( 8)
(b)
(ii)
State the shifting property of DFT and give its proof.
Or
Determine the Fourier transform of the signal
Determine the inverse Fourier transform
recursi ve f i l t er H t ri
= (1
-or-' ' )t
.
(i )
(ii)
x( n)
=
at " t ;
- I
< a <1 .
( 8)
for the first order
(8)
13.
(a) (i )
The desired frequency response of a digital filter is
f ^ 1 T i r
l P- t s w
t 44
Haf u\ =\
l o
L. l *
l . o
l 4 ' ! l
Determine the fiIter coefficients if the window function is defined as
I o<r <5
wk)
=
1^
( 10)
lU
otherwrse
(ii)
List the various steps in designing F.I.R. filters.
Or
(b) (i)
Derive the frequency response of linear phase FIR filter when
impulse response is s5rrnmetrical and N is odd. (8)
(ii)
How is design of linear phase FIR filter done by frequency sampling
( 8)
A 1120
(6)
method? Explain.
w
w
w
.
M
a
a
n
a
v
a
N
.
c
o
m
(i )
74.
( a)
Appiy the bilinear transformation of
H, , ( s)
=
2
wi th 7
=
1 sec and fi nd 11(z)
( s+1) ( s+2)
(i i )
The normal i zed transfer functi on of an anal og fi l ter i s gi ven by
H
o( . s , )
=
sf ; +1. 4L4s, +1
( 8)
Convert the analog filter to a digital filter with
0.4zr using bilinear transformation.
Or
Enumerate ti re vari ous steps
digrtal Butterworth IIR filter.
The speci fi cati on of the desi red
0. 8 <
l H
( r u) l <
1. 0
;
0
<w <
0. 2n
involved in the
l ow pass fi l ter i s
a cutoff frequency of
( 8)
design of low pass
( 6)
(b) ( i )
(i i )
l H
t u) l <0. 2
;
0. 32r
<w 1t r
Design a Butterworth digrtal filter using impulse
transformation.
Explain in detail the design and various implementation steps
using sampling rate conversion system.
invariant
( 10)
for filter
( 16)
( a)
15.
(b)
Or
(i )
Di scuss on sampl i ng rate conversi on
(i i )
Expl ai n dead band i n l i mi t cycl es.
(i i i )
Di fferenti ate between Auto and
si gnal s.
of nat i onal f act or
(Z
/ D).
(5)
( 5)
Cross correlation of random
( bl
A 1120
w
w
w
.
M
a
a
n
a
v
a
N
.
c
o
m