SRM University 2007 B.Tech Electronics and Communications Engineering BANK : EC303 – DIGITAL SIGNAL PROCESSING - Question Paper

43. In which FFT algorithm, the output is bit reversed.
44. Why FIR filters are always stable?
45. What is shift –invariant system?
46. Check whether system y (n) = x (n) + two x (n-1) is linear.
47. Define step-response of a system.
48. Give the relationship ranging from input and output of a system whose impulse response is h (n).
49. Check for stability (1). y(n) =cos x(n) (2). y(n) = x(n) en
50. Give the inverse z – transform formula.
51. What is FFT?
52. Define circular convolution of signals.
53. List the advantages of FIR systems over IIR systems.
54. Define linearity of a system.
55. For what value of n, can we write twiddle factor WnkN as WkN/6
56. What is an LTI system?
57. A system is characterized by y (n) = x (n) + n.x (n-1) is the system linear.
58. Give the formula for the discrete convolution.
59. State the shifting property of DFT.
60. Test whether the system defined by y (n) = n.x (n) is linear shift invariant.
61. Compute the DFT of the sequence whose values for 1 period is provided by x (n) = {1, 1, -2, -2}.
62. What are energy and power signal?
63. Define periodic and aperiodic signals.
64. Show whether the system, y (n) = n x (n) is (a) Linear (b) Time Varying.
65. Check for stability (1) y(n) = a x(n) (2) y(n) = ax(n)
66. What is meant by discrete convolution?
67. What is the basic operation of the decimation in-time algorithm?
68. What do you meant by radix?
69. Mention the most general form of the z-transform of the FIR system.
70. Mention the general form of the z-transform of the IIR system.
71. Check whether the system characterized by y (n) = two x (n) + 1/ x (n-1) is linear.
72. Test whether the system defined by y (n) = n.x2(n) is linear, shift invariant system.
73. Compute the DFT of the causal three sample averages with impulse response
h(n) = {1/5 ; for –1 ? n ? 1
0 ; otherwise
74. What is meant by decimation in frequency FFT algorithm?
75. Distinguish ranging from linear and circular convolution.
76. Calculate the number multiplications needed in the computation of DFT and FFT with 32 point sequence.
77. Calculate the DFT of the sequence x (n) = (1/4)n for N = 16.
78. Test the linearity of the system defined by y (n) = x (n) + 1/ x (n-1).
79. State Parseval’s energy theorem.
80. What are the various classification of discrete-time signals?
81. What are the various classification of discrete-time systems?

Earning:   Approval pending.