4225

B. E.IB.TECh. DEGREE EXAMINATION, NOVEMB ER/DE C EMBER 2005.

Fifth Semester
Computer Science and Engineering
CS 331
-
DIGITAL SIGNAL PROCESSING
Time : Three hours
Maximum : 100 marks
Answer ALL questions.
PARTA- ( 10
x2=2Q mar ks)
1. Find the fundamental period No for g (n) =
r-i(2rn/s) '
2. Det er mi net hepol esandzer os
of H( z) , H( z) =:
'
. -
/ '
- - \ - '
I _ 22- 1 +22- 2
'
3. Check for linearity and stability of gh), g(n)
=
"l;@)
.
4. Fi nd t he si gnal eners"y of x(n)=
(; )"
u@).
5. List any two properties of Discrete Fourier Transform.
6. Calculate the multiplication reduction factor, a in computing 1024 point DFT,
is a radix-z FFT algorithm.
7. If A, B, C and D are the matrices of discrete time system, write the formula for
fi.nding transfer function.
8. Compare fixed point representation of coefficients with floating point
representation.
9. Prove that decimator is Time-varying Discrete time system.
10. List few applications of multirate systems.
w
w
w
.
M
a
a
n
a
v
a
N
.
c
o
m
11.
( i )
PARTB- ( 5x16=80mar ks)
Determine H
(z) =Y (z)/
X
(z)
for Fig. 1.
(ii)
Explain through example
(1)
Linearity
(2)
Differentiation property
of z-transform.
Fig. 1
(ii)
Realise the FIR system in
(1)
Direct form
(2)
Cascade form
H
( z) =( ,
*! ,
- ' ) [ t
*L r - ' *
! ,
- ' )
.
\ 2/ \ 24)
L2.
(a) (i)
Find the convolution of x(n)*h(n) through z-transform
method.
x( n)
=( Lr ) '
" ot
h( n)
=[ 1) "
r t r r l .
\ 4/
Or
2 4225
w
w
w
.
M
a
a
n
a
v
a
N
.
c
o
m
(b) (i )
rf hr(n)=
r+)" f ut u)-u(n
-3)l
and hr(n)
=
6(n)
-
6(n-1). Fi nd t he
\ 2)
overall ltln) for the cascaded LTI system
(FiS.
2).
Fi g. 2
(ii)
Find the inverse z-transform of H
(z)
H
(z)=
--l
.
.
/ 1 \ z
I t - ! z- ' I
\ 2)
13.
(a) (i)
Determine the signal x(n) for the given Fourier transform
X( " , *) =
" - i *' n
f or
-
n
I
w
1
n .
(ii)
Find the magnitude and phase of the system y (n) =
0.6y (n
-I) =
x(n)
at w=t r / 4.
Or
(b) (i) Find the circular convolution of x(n) @
h(n) .
x( n) =1
; 0<ns10
h( n) =( ; ) ' ' o<ns1o
(ii)
State and prove Parsaval's Theorem.
14.
(a) (i)
Draw the FFT flowchart for radix-2, DIF algorithm. Assume N
=
8.
(ii)
Compute the DFT of x(n)
"(")={l ::::;
Or
(b)
Explain the various design method of IIR filters through analog frlters.
A^225
w
w
w
.
M
a
a
n
a
v
a
N
.
c
o
m
lb.
(a)
Describe filter design and implementation
(Structure) for sampling rate
conversion sYstem.
Or
(b) (i) Test for linearity, in the case of Up-Sampler'
(ii)
Explain sampling rate conversion by rational factor
(yD).
(iii)
Consider the spectrum X
(ru)
. If the signal is decimated by factor 3,
draw the O/P sPectrum.
'T1
4 A^225
w
w
w
.
M
a
a
n
a
v
a
N
.
c
o
m