0% found this document useful (0 votes)
116 views

Model Question Paper in DSP

This document provides a model question paper for a 3 hour exam on digital signal processing with 50 total marks. It includes 8 questions split into two parts. Part A contains 5 short answer questions worth 2 marks each, covering topics like system properties, z-transforms, IIR filter design using bilinear transformation, FIR frequency response, and DFT of a sequence. Part B contains 5 longer answer questions worth 8 marks each, covering topics like LSI system response, inverse z-transform, difference equation solution, direct form filter structures, window design of a lowpass filter, impulse invariance method, circular convolution, and decimation-in-time FFT algorithm. Students are asked to answer all questions in Part A and any 5 questions
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
116 views

Model Question Paper in DSP

This document provides a model question paper for a 3 hour exam on digital signal processing with 50 total marks. It includes 8 questions split into two parts. Part A contains 5 short answer questions worth 2 marks each, covering topics like system properties, z-transforms, IIR filter design using bilinear transformation, FIR frequency response, and DFT of a sequence. Part B contains 5 longer answer questions worth 8 marks each, covering topics like LSI system response, inverse z-transform, difference equation solution, direct form filter structures, window design of a lowpass filter, impulse invariance method, circular convolution, and decimation-in-time FFT algorithm. Students are asked to answer all questions in Part A and any 5 questions
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

DIGITAL SIGNAL PROCESSING

(MODEL QUESTION PAPER)


Time: 3 Hours
Maximum Marks: 50
PART A
(Answer ALL questions)
(5x2 = 10)
I.
a)

Verify whether the following systems are linear, shift invariant,


n+1

x( k ) ,
stable, and causal: ( i ) y 1 ( n )=k=

( ii ) y 2 ( n ) =x ( n ) cos ( 0 n) .

b)

Obtain the z- transform of the following with ROC:


1 n

( i ) x 1 ( n )=
cos n+
u ( n ) , (ii ) x 2 ( n )=n n u (n1 ) .
3
3
6

c)

Obtain the IIR digital filter transfer function H(z), using bilinear
transformation, of the analog filter given below (choose Ts = 1):

[( ) (

H a ( s )=

)]

s+1
s +5 s+6
2

.
d)

Show the frequency response

H ( e j )

of a causal FIR filter of

length N +1.
e)

n
Show the N-point DFT of x ( n )= , 0 n< N .

PART B
(Answer ANY FIVE questions)
(5x8 = 40)
II.

Consider an LSI system with impulse response h(n) specified as


h(n) = u(n).
n
If a discrete-time signal x(n) specified as x ( n )=2 u (n) is given
at the input, what would be the output y(n) of the system?

(P.T.O)

III.

If the z-transform X(z) of a discrete-time sequence x(n) is given


as
1
1+ z1
4
1
X ( z )=
,|z|<
2
2
1
1 z 1
2

obtain the inverse z-transform.

IV.

Find the solution of the constant coefficient linear difference


equation
1
1
y ( n )= y ( n1 ) + x ( n ) , with x ( n )=u ( n ) y (1 )=
2
4

V.

A relaxed LSI system is given by the difference equation


y ( n )=

3
1
1
y ( n1 ) y ( n2 ) + x ( n ) + x ( n1 )
4
8
3

obtain the direct-form II and cascaded structures of the


system.
VI.

Using the window design method, design a minimum-order lowpass filter with a pass-band cutoff frequency p = 0.45, a stopband cutoff frequency s = 0.5, and a maximum stop-band
deviation s = 0.003.

VII.

Consider a causal and stable continuous-time filter that has a


system function
H a ( s )=

s+1
( s+2 )2

A discrete-time filter is designed for the above, using impulse


invariance method with Ts = 1. Obtain the filter transfer function
H(z).
VIII. a) Consider the sequences
x ( n )= ( n )+2 ( n2 ) + (n3)
h ( n )= ( n ) + ( n1 ) +2 (n3)

find the 4-point circular convolution of x(n) with h(n).

b) Explain with the help of a flow-graph, how an 8-point DFT is


computed by decimation-in-time FFT algorithm.

You might also like