Scribd
Upload
449 views

CS331 Digital Signal Processing Apr May 2004

This document contains questions for a Digital Signal Processing exam. It covers topics like memoryless discrete-time systems, stability of systems, Parseval's theorem, FIR and IIR filters, Z-transforms, cross-correlation, convolution, DFT, FFT algorithms, filter design, sampling rate conversion, and estimation of power spectral density from autocorrelation functions. The exam has two sections - Part A contains 10 short answer questions worth 2 marks each and Part B contains 5 long answer questions worth 16 marks each.

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
449 views

CS331 Digital Signal Processing Apr May 2004

This document contains questions for a Digital Signal Processing exam. It covers topics like memoryless discrete-time systems, stability of systems, Parseval's theorem, FIR and IIR filters, Z-transforms, cross-correlation, convolution, DFT, FFT algorithms, filter design, sampling rate conversion, and estimation of power spectral density from autocorrelation functions. The exam has two sections - Part A contains 10 short answer questions worth 2 marks each and Part B contains 5 long answer questions worth 16 marks each.

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

J 28L

B. E./B.Tech. DEGREE EXAMINATION,


APRILA{AY 200 4'
Fifth Semester
Computer Science and Engineering
CS 331
-
DIGITAL SIGNAL PROCESSING
Time : Three hours
Maximum : 100 marks
Answer ALL questions.
PARTA- ( 10
x2=20 mar ks)
1. Define Memoryless discrete-time systems. Provide an example for a
(a)
System with memory
(b)
Memoryless system'
2. Find the stability of the system with impulse respon se h (n) = (Z)" u (n) '
3. State the Parseval's theorem.
4. State the main advantage of the FIR filter over IIR filter.
5. Draw the direct form realization of FIR system'
6. What is the frequency response of N point rectangular window?
7. What is a bilinear transformation?
g.
Mention any two procedures for digitizing the transfer function of an analog
filter.
9. State the power density spectrum of a random signal'
10. What do you mean by down sampling?
PARTB- ( 5x16=80mar ks)
11. State and prove important
properties of the Z transforms.
(16)
w
w
w
.
M
a
a
n
a
v
a
N
.
c
o
m
L2.
(a) (i)
Determine if the system described by
causality and time invariance
( 1) y( n) = x( n) +Ll x( n
- L) .
Q) y( n) =* ( " ' ) .
H
Qi * ) l =
t r o
<w<0. 2n
H
Qi * ) l =
0. ,
;
o. 6n
1w
. - n.
the following equation for
(8)
Iength sequences
( 8)
(ii)
Find the cross-correlation of two finite
x( n) ={ L, 2, 1, 1} ; y( n) =f l , I , 2, 1} .
Or
(b) (i)
Determine the convolution sum of two sequences
x (n) =
{3,
2, 7, 2} h (") =
X,
2,I, 2}.
T
(ii)
Find Z-transform of the signal
r l
x (n)=
13
(3)'
-
4(2)"
l "(").
Describe the Decimation-in-time FFT algorithm and construct 8
DFT from two 4 point DFTs and 4 point DFT from two points DFTs'
Or
Design a filter with
HaQ- i * ) =u- i t '
- f t 14<w
<nf 4
-
0
f,.1*1.".
(8)
\
13.
(a)
( 8)
point
( 16)
(b)
( 16)
L4.
(a) (i)
Describe the procedure for the design of digital filters from analog
filters and advantages and disadvantages of digital frlters.
(8)
(ii)
State and prove the conditions satisfied by a stable and causal
discrete-time frlter in the Z-Transform domain.
( 8)
Or
(b)
Design a butterworth filter using the impulse variance method for the
following specifrcations
( 16)
0. 8 <
J 281
w
w
w
.
M
a
a
n
a
v
a
N
.
c
o
m
15.
(a)
Derive an expression for the periodogram from the estimate of the
autocorrelation function ofa random process. (16)
Or
(b) (i)
Describe a decimation filter with essentiai Mathematicai
expressions. (8)
(ii)
Explain a sampling rate conversion process by a factor of llM. (8)
J 281
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