Professional Documents
Culture Documents
1
III B.Tech I Semester Supplementary Examinations, February 2007
DIGITAL SIGNAL PROCESSING
( Common to Bio-Medical Engineering and Electronics & Computer
Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆
3. (a) Compute the discrete Fourier transform of each of the following finite length
sequences considered to be of length N.
i. x(n) = δ(n)
ii. x(n) = δ(n − n0 )where0 < n0 < N
iii. x(n) = an 0 ≤ n ≤ N − 1
(b) Let x2 (n) be a finite duration sequence of length N and x1 (n) = δ(n − n0 )
where n0 < N. Obtain the circular convolution of two sequences. [8+8]
4. (a) Implement the Decimation in frequency FFT algorithm of N-point DFT where
N-8. Also explain the steps involved in this algorithm.
(b) Compute the FFT for the sequence x(n) = { 1, 1, 1, 1, 1, 1, 1, 1 } [8+8]
5. (a) How will you test the stability of a digital filter? Discuss the stability of the
system described by H(Z) = 1−ZZ−1 −Z −2
−1
(b) Determine the frequency, magnitude and phase responses and time delay for
the system
y(n) + 14 y(n − 1) = x(n) − x(n − 1) [8+8]
1 of 2
Code No: RR311102 Set No. 1
(b) Bilinear transformation method.
Assume T = 0.2 msec. [16]
7. (a) Design a low pass filter using rectangular window by taking samples of ω(n)
and with a cut-off frequency of 1.2 radians/sec.
(b) Compare the various window functions. [8+8]
8. (a) Explain the different structures for realisation of IIR system. and explain
how conversion can be made from direct form I structure to direct form II
structure.
(b) Realize the given system in cascade and parallel form
1+ 1 Z −1
H(Z) = 1−Z −1 + 1 Z −22 1−Z −1 + 1 Z −2 [8+8]
[ 4 ][ 2 ]
⋆⋆⋆⋆⋆
2 of 2
Code No: RR311102 Set No. 2
III B.Tech I Semester Supplementary Examinations, February 2007
DIGITAL SIGNAL PROCESSING
( Common to Bio-Medical Engineering and Electronics & Computer
Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆
1. (a) Let e(n) be an exponential sequence, i.e., e(n)=xn , for all n and let x(n) and
y(n) denote two arbitrary sequences, Show that
[e(n)x(n)]*[e(n)y(n)] = e(n)[x(n)*y(n)]
(b) Consider a discrete-time linear shift-invariant system with unit-sample re-
sponse h(n). If the input x(n) is a periodic sequence with period N. Show
that the output y(n) is also a periodic sequence with period N. [8+8]
4. (a) Let x(n) be a real valued sequence with N-points and Let X(K) represent its
DFT , with real and imaginary parts denoted by XR (K) and X1 (K) respec-
tively. So that X(K) = XR (K) + JX1 (K). Now show that if x(n) is real,
XR (K) is even and X1 (K) is odd.
(b) Compute the FFT of the sequence x(n) = { 1, 0, 0, 0, 0, 0, 0, 0 } [8+8]
5. (a) How will you test the stability of a digital filter? Discuss the stability of the
system described by H(Z) = 1−ZZ−1 −Z −2
−1
(b) Determine the frequency, magnitude and phase responses and time delay for
the system
y(n) + 14 y(n − 1) = x(n) − x(n − 1) [8+8]
7. (a) Describe the principle of designing FIR filter using DFT method.
1 of 2
Code No: RR311102 Set No. 2
(b) Using frequency sampling method, design a band pass filter with the following
specifications.
Sampling frequency F =8000Hz
Cut-off frequency fc1 = 1000Hz fc2 = 3000Hz
Determine the filter coefficients for N=7. [6+10]
8. (a) Explain the factors that influence the choice of structure for realisation of a
LTI system.
(b) An LTI system is described by the difference equation y (n) = a1 y (n − 1) +
x (n) + b1 x (n − 1)
Realize it in direct form I structure and convert it to direct form II structure.
[4+12]
⋆⋆⋆⋆⋆
2 of 2
Code No: RR311102 Set No. 3
III B.Tech I Semester Supplementary Examinations, February 2007
DIGITAL SIGNAL PROCESSING
( Common to Bio-Medical Engineering and Electronics & Computer
Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆
3. (a) Compute the discrete Fourier transform of each of the following finite length
sequences considered to be of length N.
i. x(n) = δ(n)
ii. x(n) = δ(n − n0 )where0 < n0 < N
iii. x(n) = an 0 ≤ n ≤ N − 1
(b) Let x2 (n) be a finite duration sequence of length N and x1 (n) = δ(n − n0 )
where n0 < N. Obtain the circular convolution of two sequences. [8+8]
4. (a) Explain the inverse FFT algorithm to compute inverse DFT of a N=8. Draw
the flow graph for the same.
(b) Compute the FFT for the sequence { 1, 0, 0, 0, 0, 0, 0, 0 } [8+8]
5. (a) How will you test the stability of a digital filter? Discuss the stability of the
system described by H(Z) = 1−ZZ−1 −Z −2
−1
(b) Determine the frequency, magnitude and phase responses and time delay for
the system
y(n) + 14 y(n − 1) = x(n) − x(n − 1) [8+8]
6. (a) Discuss Bilinear transformation method of deriving IIR digital filter from cor-
responding analog filter.
(b) Convert the following analog filter with transfer function.
HA (S) = S + 0.2/(S + 0.2)2 + 16 using Bilinear transformation method. [8+8]
1 of 2
Code No: RR311102 Set No. 3
7. (a) Describe the principle of designing FIR filter using DFT method.
(b) Using frequency sampling method, design a band pass filter with the following
specifications.
Sampling frequency F =8000Hz
Cut-off frequency fc1 = 1000Hz fc2 = 3000Hz
Determine the filter coefficients for N=7. [6+10]
⋆⋆⋆⋆⋆
2 of 2
Code No: RR311102 Set No. 4
III B.Tech I Semester Supplementary Examinations, February 2007
DIGITAL SIGNAL PROCESSING
( Common to Bio-Medical Engineering and Electronics & Computer
Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆
1. (a) Check the following systems for linearity, causality, time invariance and sta-
bility using appropriate tests.
i. y(n) = n e|x(n)|
ii. y(n) = an cos (2πn/N )
(b) The unit-sample response of a linear-shift-invariant system is known to be
zero. Except in the interval N0 ≤ n ≤ N1 . The input x(n) is known to be zero
except in the interval N2 ≤ n ≤ N3 . As a result, the output is constrained to
be zero except in some interval N4 ≤ n ≤ N5 . Determine N4 and N5 in terms
of N0 , N1 , N2 and N3 . [8+8]
3. (a) Compute the discrete Fourier transform of each of the following finite length
sequences considered to be of length N.
i. x(n) = δ(n)
ii. x(n) = δ(n − n0 )where0 < n0 < N
iii. x(n) = an 0 ≤ n ≤ N − 1
(b) Let x2 (n) be a finite duration sequence of length N and x1 (n) = δ(n − n0 )
where n0 < N. Obtain the circular convolution of two sequences. [8+8]
4. (a) Explain the inverse FFT algorithm to compute inverse DFT of a N=8. Draw
the flow graph for the same.
(b) Compute the FFT for the sequence { 1, 0, 0, 0, 0, 0, 0, 0 } [8+8]
5. (a) How will you test the stability of a digital filter? Discuss the stability of the
system described by H(Z) = 1−ZZ−1 −Z −2
−1
(b) Determine the frequency, magnitude and phase responses and time delay for
the system
y(n) + 14 y(n − 1) = x(n) − x(n − 1) [8+8]
1 of 2
Code No: RR311102 Set No. 4
6. Design a Digital IIR low pass filter with pass band edge at 1000 Hz and stop band
edge at 1500 Hz for a sampling frequency of 5000 Hz. The filter is to have a pass
band ripple of 0.5 db and stop band ripple below 30 db. Design Butter worth filler
using both impulse invariant and Bilinear transformations. [16]
7. (a) Design a low pass filter using rectangular window by taking samples of ω(n)
and with a cut-off frequency of 1.2 radians/sec.
(b) Compare the various window functions. [8+8]
8. (a) Explain the different structures for realisation of IIR system. and explain
how conversion can be made from direct form I structure to direct form II
structure.
(b) Realize the given system in cascade and parallel form
1+ 12 Z −1
H(Z) = [8+8]
[ 1 −2
1−Z + 4 Z
−1
][
1−Z −1 + 21 Z −2 ]
⋆⋆⋆⋆⋆
2 of 2