DSP - QP-2nd Edition PDF
DSP - QP-2nd Edition PDF
com
KINGS
COLLEGE OF ENGINEERING
QUESTION BANK
SIGNALS
PART – A (2 MARKS)
1. Define even and odd signals.
2. State the disadvantages of digital signal processing over analog process.
3. Check whether the following system is time-variant y(n)=nx2(n).
4. What are the different types of signal representation?
5. Define DFT pair.
6. Define the following (a) System (b) Discrete-time system
7. List the merits and demerits of DSP:
8. When discrete time signals called as periodic signals?
9. Write properties of convolution.
10. What is static and dynamic system?
11. What are the classification of discrete-time systems?
12. What is linear and non-linear system?
13. State sampling theorem.
14. What is an anti-aliasing filter?
PART – B
5. Determine the values of power and energy of the following signals. Find whether the
signals are power, energy or neither energy nor power signals.
i) x(n) = (1/3)n u(n) ii) x(n) = ej((π/2)n + (π/4)
iii) x(n) = sin (π/4)n iv) x(n) = e2n u(n) (16)
(b) Determine if the system described by the following input-output equations are
linear or non-linear.
i) y(n) = x(n) + (1 / (x(n-1)) ii) y(n) = x2(n) iii) y(n) = nx(n) (12)
8. (a) Determine the stability of the system y(n) – (5/2)y(n-1) + y(n-2) = x(n) – x(n-1) (8)
(b) Briefly explain about quantization. (8)
9. (a) Explain the principle of operation of analog to digital conversion with a neat
diagram. (8)
(b) Explain the significance of Nyquist rate and aliasing during the sampling of
continuous time signals. (8)
10. (a) List the merits and demerits of Digital signal processing. (8)
(b) Write short notes about the applications of DSP. (8)
UNIT – II
PART – A (2 MARKS)
1. Define Z-transform.
2. What is meant by Region of convergence?
3. What are the properties of ROC?
4. List the properties of z-transform.
5. Explain the linear property of z-transform.
6. Explain the time-shifting property of z-transform.
7. What are the different methods of evaluating inverse z-transform?
8. What are the properties of frequency response H(eiω) of an LTI system?
9. What is the necessary and sufficient condition on the impulse response of stability?
10. Distinguish between Linear convolution and circular convolution.
11. How will you obtain linear convolution from circular convolution?
12. What is meant by sectioned convolution?
13. What are the two methods used for te sectional convolution?
14. Distinguish between Overlap add and Overlap save method.
15. Distinguish between DFT and DTFT.
16. Distinguish between Fourier series and Fourier transform.
PART – B
1. (a) Obtain the transfer function and impulse response of the LTI system defined by
y(n-2)+5y(n-1)+6y(n)+x(n) (8)
(b) State and prove convolution property of discrete time fourier transform. (8)
(c) Find the z-transform and ROC of the anticausal sequence (4)
X(n) = {-3,-2,-1,0,1}
3. (a) Determine the z-transform and ROC of the signal i) x(n) = anu(n) and
ii) x(n) = -bnu(-n-1) (12)
(b) Find the stability of the system whose impulse response h(n) = (2)nu(n) (4)
6. Find the inverse z-transform of x(z) = (z2+z) / (z-1)(z-3), ROC: z > 3. Using (i) Partial
fraction method, (ii) Residue method and (iii) Convolution method. (16)
7. (a) Determine the unit step response of the system whose difference equation is
y(n)-0.7y(n-1)+0.12y(n-2) = x(n-1)+x(n-2) if y(-1) = y(-2) = 1. (8)
(b) Find the input x(n) of the system, if the impulse response h(n) and the output y(n)
as shown below. (8)
h(n) = {1,2,3,2} y(n) = {1,3,7,10,10,7,2}
8. (a) Determine the convolution sum of two sequences x(n) = {3,2,1,2}, h(n) = {1,2,1,2}
(8)
(b) Find the convolution of the signals
x(n) = 1 n = -2,0,1
= 2 n = -1
=0 elsewhere
h(n) = δ(n)-δ(n-1)+ δ(n-2)- δ(n-3) (8)
9. (a) Determine the output response y(n) if h(n) = {1,1,1,1}; x(n) = {1,2,3,1} by using
i) Linear convolution ii) Circular convolution and iii) Circular convolution with zero
padding. (12)
(b) Explain any twp properties of Discrete Fourier Transform. (4)
10. Using linear convolution find y(n) = x(n)*h(n) for the sequences x(n) = (1,2,-1,2,3,-2,
-3,-1,1,1,2,-1) and h(n) = (1,2).Compare the result by solving the problem using
i) Over-lap save method and ii) Overlap – add method. (16)
11. For the sequences given below, find the frequency response, plot magnitude
response, phase response and comment. (16)
i) x(n) = 1 for n = -2,-1,0,1,2
=0 otherwise
12. (a) Calculate the frequency response for the LTI systems representation
i) h(n) = [1/n]n u(n) ii) h(n) = δ(n) – δ(n-1) (8)
(b) Find the frequency response of the system having impulse response
h(n) = [1/2] { (1/2)n + (-1/4)n } u(n) (8)
13. Determine the frequency response (H(ejω)) for the system and plot magnitude
response and phase response. y(n)+[1/4]y(n-1) = x(n)-x(n-1) (16)
14. (a) A discrete – time system has a unit sample response h(n) given by
h(n) = [1/2] δ(n) + δ(n-1) + [1/2] δ(n-2). Find the system frequency response H(ejω);
Plot magnitude and Phase response. (12)
UNIT – III
3. What is FFT?
7. What are the differences and similarities between DIF and DIT algorithm?
11. Draw the flow graph of a two point DFT for a decimation-in-time decomposition.
12. Draw the flow graph of a two point radix-2 DIF FFT.
13. Draw the basic butterfly diagram for DIT algorithm.
PART – B
1. Describe the decimation in time [DIT] radix-2 FFT algorithm to determine N-point
DFT. (16)
2. An 8-point discrete time sequence is given by x(n) = {2,2,2,2,1,1,1,1}. Compute the
8-point DFT of x(n) using radix-2 FFT algorithm. (16)
3. (a) Compute the 4-point DFT and FFT-DIT for the sequence x(n) = {1,1,1,3} and
What are the basic steps for 8-point FFT-DIT algorithm computation? (12)
(b) What is the advantage of radix-2 FFT algorithm in comparison with the classical
DFT method? (4)
4. (a) Perform circular convolution of the two sequences graphically x1(n) = {2,1,2,1}
and x2(n) = {1,2,3,4} (6)
(b) Find the DFT of a sequence by x(n) = {1,2,3,4,4,3,21} using DIT algorithm. (10)
5. (a) Explain the decimation in frequency radix-2 FFT algorithm for evaluating N-point
DFT of the given sequence. Draw the signal flow graph for N=8. (12)
(b) Find the IDFT of y(k = {1,0,1,0} (4)
6. (a) Find the circular convolution of the sequences x1(n)= {1,2,3} and x2(n) = {4,3,6,1}
(8)
(b) Write the properties of DFT and explain. (8)
7. (a) Draw the 8-point flow diagram of radix-2 DIF-FFT algorithm. (8)
(b) Find the DFT of the sequence x(n) = {2,3,4,5} using the above algorithm. (8)
8. (a) What are the differences and similarities between DIT and DIF FFT algorithms?
(6)
(b) Compute the 8-point IDFT of the sequence x(k) = {7, -0.707-j0.707, -j,
0.707-j0.707, 1, 0.707+j0.707, j, -0.707+j0.707} using DIT algorithm. (10)
9. (a) Compute the 8-point DFT of the sequence x(n) = {0.5,0.5,0.5,0.5,0,0,0,0} using
radix-2 DIT algorithm. (8)
(b) Find the IDFT of the sequence x(k) = {4,1-j2.414,0,1-j0.414,0,1+j.414,0,1+j2.414}
using DIF algorithm. (8)
10. Compute the 8-point DFT of the sequence
x(n) = 1, 0 ≤ n ≤ 7
0, otherwise by using DIT,DIF algorithms. (16)
UNIT – IV
PART – A (2 MARKS)
18. What is the necessary and sufficient condition for linear phase characteristic in FIR
filter?
19. Define IIR filter.
20. What are the methods available for designing analog IIR filter?
21. What are the methods available for designing analog IIR filter?
22. Mention the importance of IIR filter:
23. Mention the two properties of Butterworth low pass filter.
24. Write the properties of chebyshev type-I filter:
25. What is aliasing? Why it is absent in bilinear transformation ?
26. How one can design digital filter from analog filter ?
27. What is bilinear transformation?
28. What is warping effect?
29. Write merits and demerits of bilinear transformation.
30. What is the main advantage of direct-form II realization when compared to direct-
form I realization?
31. What is the main disadvantage of direct-form realization?
32. What is the advantage of cascade realization?
PART – B
1. Describe the impulse invariance and bilinear transformation methods used for
designing digital IIR filters. (16)
2. (a) Obtain the cascade and parallel realization of the system described by
y(n) = -0.1y(n-1)+0.2y(n-2)+3x(n)+3.6x(n-1)+0.6x(n-2) (10)
(b) Discuss about any three window functions used in the design of FIR filters. (6)
3. Determine the direct form II and parallel form realization for the following system.
y(n) = -0.1y(n-1)+0.72y(n-2)+0.7x(n)-0.252x(n-2) (16)
4. An analog filter has a transfer function H(s) = (10 / s2+7s+10). Design a digital filter
equivalent to this impulse invariant method. (16)
5. For the given specifications design an analog Butterworth filter,
0.9 ≤ H(jΩ) ≤ 1 for 0 ≤ Ω ≤ 0.2π
H(jΩ) ≤ 0.2 for 0.4π ≤ Ω π (16)
6. Design a digital Butterworth filter satisfying the constraints
0.707 ≤ H(ejω) ≤ 1 for 0 ≤ ω ≤ π/2
H(ejω) ≤ 0.2 for 3π ≤ ω ≤ π
With T = 1 sec using Bilinear transformation. (16)
7. Design a chebyshev filter for the following specification using impulse invariance
method. 0.8 ≤ H(ejω) ≤ 1 for 0 ≤ ω ≤ 0.2π
H(ejω) ≤ 0.2 for 0.6π ≤ ω ≤ π (16)
8. (a) Write the expressions for the Hamming, Hanning, Bartlett and Kaiser windows.(6)
(b) Explain the design of FIR filters using windows. (10)
= -j for 0 ≤ ω ≤ π
Using blackman window for N=11.Plot the frequency response. (16)
UNIT – V
PART – A (2 MARKS)
PART – B
2. Explain the various addressing modes and salient features of TMS320C54X. (16)
6. Discuss in detail the various quantization effects in the design of digital filters. (16)
7. Find the effect of co-efficient quantization on pole locations of the given second
order IIR system, when it is realized in direct form I and in cascade form. Assume a
word length of 4 bits through truncation. (16)
***************************