Code No: RR410201

Set No. 1

IV B.Tech I Semester Supplementary Examinations, February 2007 DIGITAL SIGNAL PROCESSING (Electrical & Electronic Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ⋆⋆⋆⋆⋆ 1. By explicitly evaluating the convolution sum, evaluate the convolution y(n)=(n)*h(n) of the sequences αn 0 ≤ n < N h(n) = 0 elsewhere n−n0 β , n0 ≤ n [16] X(n) = 0 , n ≤ n0 2. (a) If x(n) → x(ejω ) Constitute a Fourier transform pair. Prove the following: Sequence Fourier Transform i. x*(-n) ii. j Im[x(n)] X ∗ (ejω ) X0 (ejω )

(b) Prove that the convolution in time domain leads to multiplication in frequency domain for discrete time signals. [8+8] 3. (a) Define DFT. Guide tow properties of DFT. (b) Discuss the effects of truncating a sequence x(n) of infinite duration. (c) Compute the DFT of X(n) = {−1, 0, −1} with T = 0.5. Plot the DFT sequence suggest a method for improving frequency resolution. [4+6+6] 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 −1 system described by H(Z) = 1−ZZ −Z −2 −1 (b) Determine the frequency, magnitude and phase responses and time delay for the system [8+8] y(n) + 1 y(n − 1) = x(n) − x(n − 1) 4 6. Use the Bilinear transformation to convert the analog filter with system function H(S) = S + 0.1/(S + 0.1)2 + 9 into a digital IIR filters. Select T = 0.1 and compare the location of the zeros in H(Z) with the locations of the zeros obtained by applying the impulse invariance method in the conversion of H(S). [16] 7. (a) Design a low pass filter by the Fourier series method for a seven stage with cut-off frequency at 300 Hz if ts = 1msec. Use hanning window.

1 of 2

Code No: RR410201

Set No. 1

(b) Explain in detail, the linear phase response and frequency response properties of Finite Impulse Response filters. [8+8] 8. (a) Write the difference equations for FIR and IIR system and hence derive the transfer function of FIR and IIR system. (b) Realize the following system with minimum number of multipliers H (Z) = 0.5+0.75Z −1+0.8Z −2 +0.9Z −3+2Z −4 +0.9Z −5 +0.8Z −6 +0.75Z −7+0.5Z −8 [8+8] ⋆⋆⋆⋆⋆

2 of 2

Code No: RR410201

Set No. 2

IV B.Tech I Semester Supplementary Examinations, February 2007 DIGITAL SIGNAL PROCESSING (Electrical & Electronic Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ⋆⋆⋆⋆⋆ 1. (a) For each of the following systems, determine whether or not the system is i. ii. iii. iv. stable causal linear shift-invariant.
n

i. T[x(n)]=g(n)x(n). ii. T [x(n)] =
K=n0

x(k) Justify your answer.

(b) Consider a linear shift-invariant system with unit-sample response h(n) = αn u(n), where α is real and 0 < α < 1. If the input is x(n) = β n u(n), 0 < |β| < 1, determine the output y(n) in the form y(n) = (k1 αn + k2 β n u(n). [8+8] 2. (a) If x(n) → x(ejω ) Constitute a Fourier transform pair. Prove the following: Sequence Fourier Transform i. x*(-n) ii. j Im[x(n)] X ∗ (ejω ) X0 (ejω )

(b) Prove that the convolution in time domain leads to multiplication in frequency domain for discrete time signals. [8+8] 3. (a) Define DFT of a sequence. Compute the N - point DFT of the sequence. X(n) = Cos(2πrn/N ), 0 ≤ n ≤ N − 1 and 0 ≤ r ≤ N − 1 (b) Explain how DFT can be obtained by sampling DFS for a given sequence. [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 −1 system described by H(Z) = 1−ZZ −Z −2 −1 (b) Determine the frequency, magnitude and phase responses and time delay for the system [8+8] y(n) + 1 y(n − 1) = x(n) − x(n − 1) 4

1 of 2

Code No: RR410201

Set No. 2

6. (a) Design a second order Digital low pass Butterworth filter using impulse invariance method. The sampling period is “T”. Determine the difference equation and realize the filter in all possible forms. (b) Compare Bi-linear and Impulse Invariance transformation methods. [12+4]

7. (a) Design a Finite Impulse Response low pass filter with a cut-off frequency of 1 kHz and sampling rate of 4 kHz with eleven samples using Fourier series method. (b) Show that an FIR filter is linear phase if h(n) = h(N-1-n). 8. (a) Realize an FIR filter with impulse response h(n) given by h (n) =
1 n 2

[8+8] [u (n) − u (n − 5)]

(b) A system is described by it’s transfer function H(Z) given by H (Z) = 4 + 1 3Z − Z− 1 ] [8+8] Z− 1
2 4

⋆⋆⋆⋆⋆

2 of 2

Code No: RR410201

Set No. 3

IV B.Tech I Semester Supplementary Examinations, February 2007 DIGITAL SIGNAL PROCESSING (Electrical & Electronic Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ⋆⋆⋆⋆⋆ 1. (a) Find the impulse and step responses for the given system: y(n)+y(n-1) = x(n)-2x(n-1) (b) Test the following systems for linearity, time invariance, causality and stability. i. y(n) = a|x(n)| ii. y(n) = sin(2nf π/F )x(n) [8+8]

2. (a) State and prove time and frequency shifting properties of Fourier transform. (b) Find the Fourier transform of the following signals i. x(n) = (αn sinwo n)u(n) |α| < 1 ii. x(n) = (1/4)n u(n + 4) 3. (a) Define DFT. Guide tow properties of DFT. (b) Discuss the effects of truncating a sequence x(n) of infinite duration. (c) Compute the DFT of X(n) = {−1, 0, −1} with T = 0.5. Plot the DFT sequence suggest a method for improving frequency resolution. [4+6+6] 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) respectively. 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] [8+8]

5. (a) How will you test the stability of a digital filter? Discuss the stability of the −1 system described by H(Z) = 1−ZZ −Z −2 −1 (b) Determine the frequency, magnitude and phase responses and time delay for the system y(n) + 1 y(n − 1) = x(n) − x(n − 1) [8+8] 4 6. (a) Design a second order Digital low pass Butterworth filter using impulse invariance method. The sampling period is “T”. Determine the difference equation and realize the filter in all possible forms. (b) Compare Bi-linear and Impulse Invariance transformation methods. [12+4]

7. (a) Design a Finite Impulse Response low pass filter with a cut-off frequency of 1 kHz and sampling rate of 4 kHz with eleven samples using Fourier series method. 1 of 2

Code No: RR410201

Set No. 3
[8+8]

(b) Show that an FIR filter is linear phase if h(n) = h(N-1-n). 8. (a) Describe how targets can be decided using RADAR (b) Give an expression for the following parameters relative to RADAR i. Beam width ii. Maximum unambiguous range (c) Discuss signal processing in a RADAR system. ⋆⋆⋆⋆⋆

[4+6+4]

2 of 2

Code No: RR410201

Set No. 4

IV B.Tech I Semester Supplementary Examinations, February 2007 DIGITAL SIGNAL PROCESSING (Electrical & Electronic Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ⋆⋆⋆⋆⋆ 1. (a) A digital system is characterized by the following difference equation: Y(n) = x(n)+ay(n-1) Assuming that the system is relaxed initially, determine its i. impulse response and ii. step response. (b) Show that an LSI system can be described by its unit sample response.[10+6] 2. (a) State and prove time and frequency shifting properties of Fourier transform. (b) Find the Fourier transform of the following signals i. x(n) = (αn sinwo n)u(n) |α| < 1 ii. x(n) = (1/4)n u(n + 4) 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) 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) respectively. 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] [8+8]

5. (a) How will you test the stability of a digital filter? Discuss the stability of the −1 system described by H(Z) = 1−ZZ −Z −2 −1 (b) Determine the frequency, magnitude and phase responses and time delay for the system y(n) + 1 y(n − 1) = x(n) − x(n − 1) [8+8] 4 6. (a) Discuss about the pole locations for the digital Chebyshev filters. (b) Compare the impulse invariance and bilinear transformation methods. [8+8] 7. (a) Design a Finite Impulse Response low pass filter with a cut-off frequency of 1 kHz and sampling rate of 4 kHz with eleven samples using Fourier series method. 1 of 2

Code No: RR410201

Set No. 4
[8+8]

(b) Show that an FIR filter is linear phase if h(n) = h(N-1-n). 8. (a) Explain in detail the short time Fourier analysis for speech signals (b) What is a vocoder? Explain with a block diagram. ⋆⋆⋆⋆⋆

[10+6]

2 of 2