Scribd
Upload
196 views3 pages

CS331 Digital Signal Processing Nov Dec 2003

This document contains questions from a Digital Signal Processing exam. It covers topics like stability analysis of systems, z-transforms, Fourier transforms, frequency responses of linear shift-invariant systems, fast Fourier transforms, Wiener filters, impulse-invariant techniques, polyphase filters, and multi-rate digital signal processing concepts like decimation, interpolation, and power spectrum estimation. The questions test understanding of fundamental DSP concepts and ability to analyze, design, and realize different digital filters and signals.

Uploaded by

Chandru Sekar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
196 views3 pages

CS331 Digital Signal Processing Nov Dec 2003

This document contains questions from a Digital Signal Processing exam. It covers topics like stability analysis of systems, z-transforms, Fourier transforms, frequency responses of linear shift-invariant systems, fast Fourier transforms, Wiener filters, impulse-invariant techniques, polyphase filters, and multi-rate digital signal processing concepts like decimation, interpolation, and power spectrum estimation. The questions test understanding of fundamental DSP concepts and ability to analyze, design, and realize different digital filters and signals.

Uploaded by

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

E 272

B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECENIBER 2003


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. Consider an LSI system of h(n)
= (0.5)n u(n).Yerify the system for stability.
2. State the initial and final value theorems of z-transform,
3. Comput e Fouri er t ransf orm of t he si gnal x(n)
=u(n)-t t (. n-
1) and comment
on the result.
4. Write the reiationship between system function and the frequencl,- response of
LSI system.
5. Give the computation efficiency of \024 point FFT over 1024 point DFT.
Hbi . \ =r - i t * . 0<l wl <w^
6. Let
\ / '
. Is it FIR (or) IIR filter?
0, w" <l wl <n
7. What are Wiener Filters?
8. What are the two demerits of Impuise-invariant technique?
L Why the filters designed for Muiti-rate systems are named poiy-phase filters?
10. State Wiener-Khintchine theorem.
w
w
w
.
M
a
a
n
a
v
a
N
.
c
o
m
11. Consider an LTI
(i)
Determine
(ii)
Determine
the input is
PARTB- ( 5x16=80mar ks)
syst em
! (n)
=
0. \ y(n
-I )
+ x(n) .
the step response of the system.
the transient and steady state response of the system
x(n)
=tOror(?!J1"l rfr).
The system i s i ni ti al y at rest.
[ 8 )
( 6)
when
( 10)
12.
(a) (i)
State and
prove
the Parseval's theorem of Fourier Transform.
(6)
(ii)
Determine Fourier Transform for the follou'ing signals.
(10)
( 1)
n u( n)
( 2)
cost D^n uh) .
(b)
Or
A LSI system is described by the following difference equation
Y( n)
=
a3, ( n
- \ ) +bx( n) ,
(i)
Determine the Magnitude and phase response of the system.
(8)
(ii)
Choose the param eter
' b' so
that the maximum value of
ln
(rr"
)l
t.
unity. (8)
Derive eight point radix-2 decimation in Time FFT algorithm and
comput e DFT f or
x( n) =l ; o<n<7
=
0, otherwise
using Decimation in Time FFT
algorithm. (10
+ 6)
13.
( a)
Or
(b)
Design a Nine tap linear phase filter having the ideal response
l \ ,
H, , Vt '
J=
t ,
I
wl <nl 6
=
o, nl G <l wl <nl s
=t ,
nl T <l *l <,
using Hamming window and draw the realization for the same. (
1 b )
E 272
w
w
w
.
M
a
a
n
a
v
a
N
.
c
o
m
14.
(a)
Design and realize a digital filter using bilinear transformation for the
following specifications.
(i)
Monotonic pass band and stop band
(ii) -3.01
dB cut off at 0.5 n rad
(iii)
Magnitude down atleast 15 dB at ut
=
0.75 n rad.
Or
(b) (i)
Illustrate the characteristics of a limit cycle oscillation of a typical
first order svstem. (12)
(ii)
Determine the dead band of the following filter if 8 bits are used for
r epr esent at i on y( n)
=0. 2
y( n
- 1)
+ 0. 5 y( n- 2) + x( n) . @)
15.
(a) (i)
Explain the need for low pass filter in the decimation process. (8)
(ii)
Show that the decimation process is a frequency streatching
( 16)
process, r 8)
Or
(b) (i)
Derive the expression for power spectrum estimation.
(8)
(ii)
Explain how the linear interpolation is used to achieve the better
performance compared to first order approximation. (8)
E 272
w
w
w
.
M
a
a
n
a
v
a
N
.
c
o
m

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy