Scribd
Upload
31 views

EE61 June 2010

The document is a past exam paper for a Digital Signal Processing course. It contains multiple choice and short answer questions testing key concepts in DSP including: 1) Properties of the discrete Fourier transform (DFT) such as its linearity, periodicity and relationship to the inverse DFT. 2) Algorithms for computing the DFT such as the direct computation, fast Fourier transform (FFT) and their computational complexities. 3) Filter design techniques including impulse invariance, bilinear transformation, and types of analog and digital filters like Butterworth, Chebyshev and their properties. 4) Filter structures for implementing digital filters including direct form, cascade and ladder realizations. 5)

Uploaded by

MSG
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
31 views

EE61 June 2010

The document is a past exam paper for a Digital Signal Processing course. It contains multiple choice and short answer questions testing key concepts in DSP including: 1) Properties of the discrete Fourier transform (DFT) such as its linearity, periodicity and relationship to the inverse DFT. 2) Algorithms for computing the DFT such as the direct computation, fast Fourier transform (FFT) and their computational complexities. 3) Filter design techniques including impulse invariance, bilinear transformation, and types of analog and digital filters like Butterworth, Chebyshev and their properties. 4) Filter structures for implementing digital filters including direct form, cascade and ladder realizations. 5)

Uploaded by

MSG
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/ 2

USN EE61

Siddaganga Institute of Technology, Tumkur – 572 103


(An Autonomous Institution under Visvesvaraya Technological University, Belgaum)

Sixth Semester B.E. Electrical & Electronics Engineering Examinations June 2010
Digital Signal Processing
Time: 3 Hours Max. Marks: 100
Note: 1. Question No. 1 is Compulsory
2. Answer any 4 full questions from question No. 2 to Question No. 6

1 a) Let X(k) be 8 point DFT of x(n)= {4,3,2,1,0,0,0,0}. Here, X(0) = _________


b) Obtain 4 point DFT of x(n) = δ(n)
c) WNk+N = ____________
d) The input x(n) to the DIT FFT algorithm is given in ________________ order.
e) In the direct form II realization of a 4 th order system (M=3,N=4), the number of delay
elements required is ___________
f) Write the direct form II realization of a second order system.
g) The pre-warping operation required in IIR digital filter design by Bilinear Transformation is
given by ________
h) When Impulse invariance method is used to obtain a digital filter from an analog filter, then a
pole at s=p1 of the analog filter is mapped to z = _______ in z-plane.
i) What is the magnitude in dB of a normalized analog butterworth low pass filter at
Ω = 1 rad/sec?
j) Mention any one difference between Butterworth and Chebyshev filter. 1 × 10
k) If x(n) is real and odd , then its DFT X(k) is _________ and ____________
ℓ) Write signal flow graph for the computation of 4 point DFT using DIT FFT algorithm.
m) What is a linear phase FIR system?
n) Draw the magnitude response of a nth order normalized type 1 Chebyshev filter ( n is odd) .
o) A digital filter H(z) is obtained from an analog filter H(s) by bilinear transformation.
3
If H ( S ) =
( S + 2 ) , then H(z) = _________ . 2× 5

2 a) Find the 4 point DFT of the sequence x(n) = cos(πn/4). 5


b) Prove circular time shift property of DFT. 5
c) A long sequence is filtered through a filter with impulse response h(n) to yield the output
y(n). If x(n) = { 1,1,1,1,1,3,1,1,4,2,1,1,3,1} and h(n) = {1,-1}. Compute y(n) using the ovelap-
save technique. Use 5-point circular convolution. 10

3 a) Find the DFT of the sequence x(n) = { 1,3,5,7,2,4,6,8} using DIT FFT algorithm. 10
b) How many multiplications and additions are needed for a 64-point sequence in the calculation
of DFT using (i) FFT algorithm (ii) Direct computation.
Also determine the speed improvement factor and number of real registers needed in both
cases. 6
c) Explain how IDFT of a sequence X(k) can be obtained by using FFT algorithm 4

4 a) Determine the direct form I and direct form II realizations for the system
2 + 3 z − 2 − 1.5 z − 4
H ( z) =
1 − 0.2 z − 1 + 0.35 z − 2 6

-1- Please Turn Over

-2- EE61
( z − 1) ( z 2 + 5 z + )
6 ( z − 3)
b) Obtain the cascade realization of H ( z ) = The cascade system
(z 2
)(
+ 6z + 5 z − 6z + 8
2
)
should consist of two biquadratic sections. 6
−1 −2
2 + 8z + 6 z
c) Given the system function H ( z ) = Realize using Ladder structure. 8
1 + 8 z − 1 + 12 z − 2

5 a) Design a digital Chebyshev filter (type I) to satisfy the following constraints


0.8 ≤ |H(ejω)| ≤ 1 , 0 ≤ ω ≤ 0.2π
jω
|H(e )| ≤ 0.2, 0.6π ≤ ω ≤ π
Use Bilinear transformation. 14
b) 1
Let H ( S ) = S 2 + S + 1 represent the transfer function of a low pass filter with a pass band of
( )
1rad/sec. Use frequency transformation to find the transfer function of
i) A high pass filter with cutoff frequency of 10rad/sec
ii) A band pass filter with a pass band of 10rad/sec and center frequency of 100 rad /
sec 6

6 a) If h(n) is the impulse response of an FIR filter , so that h(n) = 0 for n<0 and n≥N. Assume
h(n) is real, symmetric with respect to midpoint (N is even). Find the magnitude and phase
response when h(n) = h(N-1-n). 6
b) A low pass filter is to be designed with the following desired frequency response
Hd(ejω) = e-j2ω , -(π/4) ≤ ω ≤ (π/4)
= 0, , (π/4) < |ω| ≤ π
Determine the filter coefficients hd(n) if the window function is defined as
w(n) = 1, 0 ≤ n ≤ 4
= 0, otherwise
Also determine the frequency response H(ejω) of the designed filter.
10
c) Compare FIR and IIR digital filters. 4
_________

You might also like