Digital Signal Processing

Question Bank

Module I
1. Derive the DFT expression from the DTFT. [Jan’19] (04)

2. Describe the process of frequency domain sampling and reconstruction of discrete time signals.
[Jul’19] (10)

3. Define DFT and IDFT of a signal and obtain the relationship between DFT and z-transform.
[Jan’18] (06)

4. Explain the frequency domain sampling and reconstruction of discrete time signals. [Model] (08)

5. Compute the N -point DFT of the sequence x(n) = a · n, 0 ≤ n ≤ N − 1. [Jan’19] (06)

6. Using linearity property, find the 4-point DFT of the sequence [Jul’19] (06)
π  π 
x(n) = cos n + sin n
4 2

7. Compute N -point DFT of the sequence [Jul’18] (08)

  
1 1 2π N
x(n) = + cos n−
2 2 N 2

8. Obtain the relationship between DFT and z-transform. [Jul’18, Jul’19] (08, 04)

9. The first five samples of the 8-point DFT X(k) are given as follows:
X(0) = 0.25, X(1) = 0.125 − j0.3018, X(4) = X(6) = 0, X(5) = 0.125 − j0.0518. Determine
the remaining samples, if x(n) is a real valued sequence. [Jan’18] (04)

10. The first five points of the eight point DFT of a real valued sequence are
{0.25, 0.125 − j0.3018, 0, 0.125 − j0.0518, 0}
Determine the remaining three points. [Model] (03)

11. State and prove circular folding and frequency shift properties of an N -point sequence.
[Jan’19] (06)

12. State and prove the circular time shift and circular frequency shift properties. [Jan’18] (06)

13. State and prove the

(i) circular time shift (ii) circular time reversal
properties of DFT. [Jul’19] (08)

14. If x(n) = {1, 2, 0, 3, −2, 4, 7, 5}; evaluate the following:

1
 P7
(i) X(0) (ii) X(4) (iii) k=0 X(k)
[Jan’18] (06)
15. Let x(n) be a real sequence of length N and its N -point DFT be X(k). Show that:
(i) X(N − k) = X ∗ (k)
(ii) X(0) is real
(iii) If N is even, then X(N/2) is real. [Jul’18] (08)
16. Consider a finite duration sequence x(n) = {0, 1, 2, 3, 4}.
(i) Determine the sequence y(n) with six point DFT Y (k) = Real[X(k)].
(ii) Determine the sequence v(n) with six point DFT V (k) = Imaginary[X(k)]. [Model] (04)
17. Find the circular convolution between the sequences using DFT and IDFT: x1 (n) = {1, 2, 3, 1}
and x2 (n) = {4, 3, 2, 1}. [Jan’19] (06)
18. Use concentric circle or graphical method to find the circular convolution of x(n) = {1, 3, 5, 3}
and h(n) = {2, 3, 1, 1}. [Jul’19] (04)
19. Compute the circular convolution using DFT and IDFT for the following sequences:
x1 (n) = {2, 3, 1, 1} and x2 (n) = {1, 3, 5, 3}. [Jan’18] (10)
20. Compute 4-point circular convolution of the sequences using time domain and frequency domain:
x(n) = {2, 1, 2, 1} and h(n) = {1, 2, 3, 4}. [Jul’18] (08)
21. Determine the circular convolution of the sequences: x1 (n) = {1, 2, 3, 1} and x2 (n) = {4, 3, 2, 2}
using time domain approach. [Model] (05)
22. Show that the multiplication of two DFTs leads to circular convolution of respective time se-
quences. [Model] (07)

Module II
23. State and prove symmetry property of twiddle factor WN . [Jan’19] (02)
24. State and prove the following properties of phase factor WN :
(i) periodicity (ii) symmetry [Jan’18] (04)

25. State and prove the property of circular time shift of a sequence. [Model] (05)
26. State and prove the
(i) Modulation property (ii) Circular time-shift property [Jul’18] (08)

27. State and prove the following properties:

(i) Circular correlation (ii) Parseval’s theorem [Jul’19] (06)

28. The 4-point DFT of a real sequence x(n) is X(k) = {1, j, 1, −j}. Find the DFTs of the following:
(i) x1 (n) = (−1)n x(n) (ii) x2 (n) = x((n + 1))4 (iii) x3 (n) = x(4 − n)
[Model] (06)
29. The 4-point DFT of a complex sequence x(n) is X(k) = {j, 1 + j, 1 + j2, 4 + j}. Compute Y (k),
if y(n) = x∗ (n). [Model] (04)
30. Let x(n) be a finite length sequence with X(k) = {10, 1 − j, 4, 1 + j}. Using the properties of the
DFT, find the DFT of the following:
2
 π π


(i) x1 (n) = ej 2 n x(n) (ii) x2 (n) = cos 2
n x(n) [Jul’18] (08)

31. Consider the finite length sequence: x(n) = δ(n) + 2δ(n − 4). Find:
(i) 10 point DFT of x(n)
4πk
(ii) Y (k) = e−j 10 X(k) where X(k) is the 10-point DFT of x(n). Find y(n).
(iii) Find z(n) that has DFT Z(k) = X(k)W (K) where W (k) is the 10-point DFT of
w(n) = u(n) − u(n − 7). [Jan’19] (07)

32. Let x(n) be a finite length sequence with X(k) = {1, 4j, 0, −4j}. Find the DFT of
π
(ii) x2 (n) = cos π2 n x(n)


(i) x1 (n) = ej 2 n x(n) (iii) x3 (n) = x((n − 1)4 )
[Jan’19] (03)

33. Consider a finite duration sequence x(n) = {0, 1, 2, 3, 4, 5}.

(i) Find the sequence y(n) with 6-point DFT Y (k) = W2k X(k).
(ii) Determine the sequence y(n) with 6-point DFT Y (k) = Real[X(k)]. [Jul’18] (08)

34. An FIR filter has the impulse response of h(n) = {1↑ , 2, 3}. Determine the response of the filter
to the input sequence x(n) = {1↑ , 2} using DFT and IDFT. Also verify the result using direct
computation of linear convolution. [Jul’19] (08)

35. Explain the linear filtering of long data sequences using overlap-save method.
[Model, Jan’18] (06, 10)

36. Explain the linear filtering of long data sequences using overlap-add method. [Jul’19] (08)

37. Find the response of an LTI system with an impulse response h(n) = {3, 2, 1} for the input
x(n) = {2, −1, −1, −2, −3, 5, 6, −1, 2, 0, 2, 1} using overlap and add method. Use 8 point circu-
lar convolution. [Model, Jul’18, Jan’19] (07, 08, 10)

38. Find the output y(n) of a filter whose impulse response is h(n) = {1, 2, 3, 4} and input signal
to the filter is x(n) = {1, 2, 1, −1, 3, 0, 5, 6, 2, −2, −5, −6, 7, 1, 2, 0, 1} using overlap-add method
with 6-point circular convolution. [Jan’18] (12)

39. A long sequence x(n) is filtered with a filter with impulse response h(n) to produce output y(n).
If x(n) = {1, 4, 3, 0, 7, 4, −7, −7, −1, 3, 4, 3} and h(n) = {1, 2}; compute y(n) using overlap and
add method. Use only 5-point circular convolution in your approach. [Jan’19] (10)

40. Consider a FIR filter with impulse response h(n) = {3, 2, 1, 1}. If the input is x(n) = {1, 2, 3, 3, 2, 1, −1, −2,
Find the output using overlap-save method, assuming the length of every block is 9. [Jul’19] (10)

41. Explain the computational complexity of direct computation of DFT. What are the efficient algo-
rithms for the evaluation of the DFT? [Model] (04)

42. In the direct computation of N -point DFT of x(n), how many of the following evaluations are
required?
(i) complex additions (iii) real multiplications (v) trigonometric functions
(ii) complex multiplications (iv) real additions [Jan’19] (06)

43. Explain the disadvantages of direct computation of DFT and advantage of FFT. [Jan’19] (04)

44. Find the number of complex multiplications and additions required to compute the 128-point DFT
using
(i) Direct method

3
 (ii) FFT
(iii) What is the speed improvement factor
(iv) Number of real registers needed
(v) Number of trigonometric functions needed [Jan’19] (06)

Module III
45. Find the number of complex additions and complex multiplications required for 128-point DFT
computation using i) Direct method, ii) FFT method. What is the speed improvement factor?
[Model] (03)

46. Derive the radix-2 decimation in time FFT algorithm and draw the signal flow graph for eight point
DFT computation. [Model, Jan’19] (08)

47. Find the 8-point DFT of the sequence x(n) = {1, 1, 1, 1, 0, 0, 0, 0} using radix-2 DIT FFT algo-
rithm. [Jan’19] (08)

48. Find the 8-point DFT of the sequence x(n) = {1, 2, 3, 4, 4, 3, 2, 1} using DIT-FFT radix-2 algo-
rithm. [Jan’19] (10)

49. Given the 8-point sequence x(n) = { √12 , 1, √12 , 0, − √12 , −1, − √12 , 0}, compute the DFT of the
↑
sequence using DIT-FFT algorithm. [Jul’18] (06)

50. Determine the IDFT of X(k) = {4, 1 − j2.414, 0, 1 − j0.414, 0, 1 + j0.414, 0, 1 + j2.414} using
inverse radix 2 DIT-FFT algorithm. [Jul’19] (08)

51. First five points of 8-point DFT of a real valued sequence is given by
X(k) = {0↑ , 2 + 2j, −4j, 2 − 2j, 0} .
Determine the remaining points. Hence find the sequence x(n) using radix-2 DIT-FFT algorithm.
[Jan’19] (10)

52. A designer is having a number of 8-point FFT chips. Show explicitly how he should interconnect
three chips in order to compute a 24-point DFT. [Jul’18] (06)

53. Develop decimation-in-time FFT algorithm and obtain the signal flow diagram forN = 8. [Jul’19] (08)

54. Develop the radix-2 decimation in frequency FFT algorithm for N = 8 and draw the signal flow
graph. [Jul’18] (10)

55. Find the 4-point real sequence x(n), if its DFT samples are
X(0) = 6, X(1) = −2 + j2, X(2) = −2
Use DIF-FFT algorithm. [Model] (05)

56. Compute the eight point DFT of the sequence x(n) = { 12 , 12 , 12 , 21 , 0, 0, 0, 0} using the in-place
radix-2 decimation in frequency FFT algorithm. [Model] (08)

57. Compute the DFT of the following sequence using DIF-FFT algorithm x1 (n) = {1, 1, 1, 0, 0, 1, 1, 1}.
Using the result thus obtained, find the DFT of the sequence x2 (n) = {1, 1, 1, 1, 1, 0, 0, 1}. Take
N = 8. [Jul’19] (12)

58. Find the 4-point circular convolution of x(n) and h(n) given below, using radix-2 DIF-FFT algo-
rithm: x(n) = {1, 1, 1, 1}, h(n) = {1, 0, 1, 0}. [Jan’18, Jan’19] (10, 06)

59. Explain the Goertzel algorithm and obtain the direct form II realization. [Model, Jul’18] (08, 06)

4
60. Given x(n) = {1, 0, 1, 0}, find X(2) using Goertzel algorithm. [Jan’18] (06)

61. What are chirp signals? Mention the application of chirp-z transform. [Jul’18] (04)

62. What is chirp-z transform? Mention its applications. [Jan’19, Jul’19] (06, 04)

Module IV
63. A linear time-invariant digital IIR filter is specified by the following transfer function:
(z − 1)(z − 2)(z + 1)z
H(z) =  1 1
z − 12 − 21 j z − 14 j z + 41 j

 
   
z− 2
+ 2
j

Realize the system in the following forms:

(i) direct form-I (ii) direct form-II [Jan’18] (12)

64. Obtain a cascade realization for the system function given below:
3 [Model] (04)
(1 + z −1 )
H(z) =
1 − 14 z −1 1 − z −1 + 21 z −2

65. Obtain the cascade realization for a system described by

[Model] (05)
1 + 14 z −1
H(z) =
1 + 21 z −1 1 + 21 z −1 + 14 z −2

66. Obtain the parallel realization of the system function

[Model] (05)
(1 + z −1 )(1 + 2z −1 )
H(z) =
1 + 12 z −1 1 − 21 z −1 1 + 18 z −1

67. Realize the system given by the difference equation:

y(n) = −0.1y(n − 1) − 0.72y(n − 2) + 0.7x(n) − 0.252x(n − 2)
Use parallel form. Is this system stable? Determine its impulse response. [Jul’19] (08)

68. Obtain the direct form-I and cascade form realization of the system function:
[Jul’18] (08)
1 + 31 z −1
H(z) =
1 − 15 z −1 1 − 43 z −1 + 81 z −2

69. Obtain direct form-I, direct form-II, cascade and parallel form of realization for the following
system: y(n) = 0.75y(n − 1) − 0.125y(n − 2) + 6x(n) + 7x(n − 1) + x(n − 2).
[Jul, 18, Jan’19, Jul’19] (12, 08)

70. Derive an expression for the order, cut-off frequency and poles of a low pass Butterworth filter.
[Jan’18] (08)

71. Determine the order and cut off frequency of Butterworth analog highpass filter to meet the spec-
ifications: Maximum passband attenuation = 2 dB, Minimum stop band attenuation = 20 dB,
Passband edge frequency = 200 rad/s, stopband edge frequency = 100 rad/s. [Model] (05)

72. A Butterworth low pass filter has to meet the following specifications:
(i) Pass band gain, kp = −1 dB at Ωp = 4 rad/s

5
 (ii) Stop band attenuation greater than or equal to 20 db at Ωs = 8 rad/s
Determine the transfer function Ha (s) of the Butterworth filter to meet the above specifications.
[Jan’18] (08)

73. Explain Analog to Analog transformation. [Jan’19] (04)

74. Design an analog lowpass Butterworth filter for the following specifications:
0.8 ≤ |Ha (s)| ≤ 1 for 0 ≤ Ω ≤ 0.2π, |Ha (s)| ≤ 0.2 for 0.6π ≤ Ω ≤ π. [Jan’19] (08)

75. Explain the design of IIR filter by Impulse invariance technique. [Model] (06)

76. Find H(z) for the given transfer function

s+a
H(s) =
(s + a)2 + b2
using impulse invariant transformation. [Jan’19] (08)
77. Obtain H(z) using impulse invariance method for the following analog filter with 5 Hz sampling
frequency
2 [Jul’19] (06)
Ha (s) =
(s + 1)(s + 2)
78. A third-order Butterworth low pass filter has the transfer function
1
H(s) =
(s + 1)(s2 + s + 1)

Design H(z) using impulse invariance technique. [Jan’18] (10)

79. Convert the analog filter with system function
s + 0.1
Ha (s) =
(s + 0.1)2 + 9
into a digital IIR filter by means of the impulse invariance method. [Jul’18] (08)
80. Design an IIR digital filter that when used in the prefilter–A/D–H(z)–D/A structure will SATISFY
the following equivalent analog specifications:
(i) low pass filter with -1 dB cutoff at 100π rad/s
(ii) stop band attenuation of 35 dB or greater at 1000π rad/s
(iii) monotonic stop band and pass band
(iv) sampling rate of 2000 samples/s [Jul’19] (10)

81. Design a digital low pas Butterworth filter using bilinear transformation to meet the specifications:

(i) −3 dB cut-off frequency at 0.5π rad

(ii) −15 dB at 0.75π rad.
Obtain H(z) assuming T = 1 s. [Model] (06)

82. Design a digital low pass Butterworth filter using bilinear transformation to meet the following
specifications:
−3 dB ≤ |H(ω)| ≤ −1 dB for 0 ≤ ω ≤ 0.5π
[Jul’18] (10)
|H(ω)| ≤ −10 dB for 0.7π ≤ ω ≤ π
83. Design a digital lowpass filter using bilinear transformation to satisfy the following
(i) Monotonic pass and stop band
(ii) -3 dB cut-off of 0.5π rad

6
 (iii) Magnitude down at least 15 dB at 0.75π rad [Jan’19] (08)
84. What are the characteristics of Chebyshev filters? Define its magnitude response and list the
properties of polynomial for type I Chebyshev filters. [Model] (04)
85. Compare Butterworth and Chebyshev filters. [Jan’19] (04)
86. List the advantages and disadvantages of IIR filters. [Jan’18] (06)

Module V
87. Realize the linear phase FIR filter for the impulse response
1 1 1
h(n) = δ(n) + δ(n − 1) − δ(n − 2) + δ(n − 3) + δ(n − 4)
4 2 4
using direct form. [Model] (03)
88. Realize a linear phase FIR filter with the impulse response
1 1 1 [Jul’19] (06)
h(n) = δ(n) + δ(n − 1) − δ(n − 2) + δ(n − 3) + δ(n − 4)
4 8 4
89. Realize an FIR filter with impulse response h(n) given by
 n
1
h(n) = [u(n) − u(n − 4)]
2
using direct form-I. [Jul’18, Jan’19] (06, 04)
90. Obtain the linear phase realization of FIR filter with impulse response [Jul’18] (06)

1 1 1 1
h(n) = δ(n) − δ(n − 1) + δ(n − 2) + δ(n − 3) − δ(n − 4) + δ(n − 5)
2 4 4 2
91. Consider an FIR lattice filter with coefficients K1 = 0.65, K2 = −0.34 and K3 = 0.8. Find its
impulse response and draw the direct form structure. [Model] (07)
92. Consider a 3-stage FIR lattice structure with coefficients K1 = 0.65, K2 = −0.34 and K3 = 0.8.
Evaluate its impulse response by tracing a unit impulse δ(n) at its input through the lattice struc-
ture. Also, draw its direct form-I structure. [Jul’19] (10)
93. Describe the frequency sampling realization of FIR filter. [Model] (07)
94. Determine the filter coefficients of an FIR filter for the desired frequency response
(
e−j2ω , |ω| < π/4
Hd (ω) =
0, π/4 ≤ |ω| ≤ π

Use rectangular window function. Find the frequency response H(ω) of the filter. [Model] (06)
95. A filter is to be designed with the following desired frequency response:
(
0, −π/4 < ω < π/4
Hd (ω) = −j2ω
e , π/4 < |ω| < π
Find the frequency response of the FIR filter designed using rectangular window defined below:
(
1, 0 ≤ n ≤ 4 [Jan’18] (08)
WR (n) =
0, otherwise

7
 96. A low pass filter is to be designed with the following desired frequency response:
(
e−j2ω , |ω| < π/4
Hd (ω) =
0, π/4 < |ω| < π

Determine the filter coefficients hd (n) and h(n) if W (n) is a rectangular window defined as
(
1, 0 ≤ n ≤ 4
WR (n) = [Jul’18] (06)
0, otherwise

97. Determine the impulse response of an FIR filter to meet the specifications: Passband edge fre-
quency of 1.5 kHz, Stopband edge frequency of 2 kHz, Sampling frequency of 8 kHz. Use the
Hamming window function. [Model] (06)

98. Compare the different window functions used in FIR filter design. [Model] (03)

99. Explain the following terms:

(i) Rectangular window
(ii) Bartlett window
(iii) Hamming window
(iv) Hanning window [Jan’18, Jul’19] (08)

100. Write equations of any four different windows used in design of FIR filters. [Jan’19] (10)

101. What are the advantages and disadvantages of the window technique for designing FIR filter?
[Jul’18] (04)

102. The desired frequency response of a low pass filter is given by

(
e−j3ω , |ω| < 3π/4
Hd (ω) =
0, 3π/4 < |ω| < π.

Determine the frequency response of the FIR filter if Hamming window is used with N = 7.
[Jul’18] (10)

103. The desired frequency response of a low pass filter is given by

(
e−j3ω , |ω| < 3π/4
Hd (ω) =
0, 3π/4 < |ω| < π.

Find the impulse response h(n) using Hamming window. Determine the frequency response of
FIR filter. Consider N = 7. [Jul’18] (10)

104. Design the symmetric FIR low pass filter whose desired frequency response is given as
(
e−j2ω for |ω| ≤ ωc
Hd (ω) =
0 otherwise

The length of the filter should be 7 and ωc = 1 radian/sample. Use rectangular window. [Jan’19] (06)