QUESTION BANK

Name of Subject: EC8553 Discrete Time Signal processing

UNIT I
DISCRETE FOURIER TRANSFORM

1. Perform circular convolution of the sequence using DFT and IDFT technique
x1(n) = {2, 1,2,1} x2 (n) = {0,1,2,3}
2. Compute the DFT of the sequence x(n) = {1,1,1,1,1,1,0,0}
3. From the first principles obtain the signal flow graph for computing 8 – point DFT using
radix-2 DIT FFT algorithm. Using the above compute the DFT of sequence
x(n) = {0.5,0.5,0.5,0.5,0,0,0,0}
4. State and prove the circular convolution property of DFT. Compute the circular
convolution of x(n) = {0,1,2,3,4} and h(n) = {0,1,0,0,0}
5. Perform circular convolution of the sequence using DFT and IDFT technique
x1(n) = {1,1,2,1} x2 (n) = {1,2,3,4}
6. Compute the DFT of the sequence x(n) = {1,1,1,1,1,1,0,0}
7. From the first principles obtain the signal flow graph for computing 8 – point DFT using
radix-2 DIF-FFT algorithm. An 8 point sequence is given by x(n)={2,2,2,2,1,1,1,1}
compute its 8 point DFT of x(n) by radix-2 DIF-FFT
8. Compute 5 point circular convolution of x1(n) = δ (n) +δ (n-1)-δ (n-2) - δ (n-3) and
x2(n) = δ(n) – δ (n-2)+ δ (n-4)
9. Explain any five properties of DFT.
10. Derive DIF – FFT algorithm. Draw its basic butterfly structure and compute the DFT
x(n) = (-1)n using radix 2 DIF – FFT algorithm.
11. Perform circular convolution of the sequence using DFT and IDFT technique
x1(n) = {0,1,2,3} x2 (n) = {1,0,0,1}
12. Compute the DFT of the sequence x (n) = 1/3 δ (n) – 1/3 δ (n-1) +1/3 δ (n -2)
13. From the first principles obtain the signal flow graph for computing 8 – point DFT using
radix-2 DIT - FFT algorithm. Using the above compute the DFT of sequence
x(n) = 2 sin nπ/ 4 for 0 ≤ n ≤ 7
14. What is circular convolution? Explain the circular convolution property of DFT and
compute the circular convolution of the sequence x(n)=(2,1,0,1,0) with
 itself
15. Perform circular convolution of the sequence using DFT and IDFT technique
x1(n) = {0,1,2,3} x2 (n) = {1,0,0,1}
16. i) Compute the DFT of the sequence x (n) = (-1)n
ii) What are the differences and similarities between DIT – FFT and DIF – FFT
algorithms?
17. From the first principles obtain the signal flow graph for computing 8 – point DFT using
radix-2 DIT - FFT algorithm. Using the above compute the DFT of sequence
x(n) = cos nπ / 4 for 0 ≤ n ≤ 7
18. Compute 4-point DFT of the sequence x (n) = (0, 1, 2, 3)
19. Compute 4-point DFT of the sequence x (n) = (1, 0, 0, 1)
20. Explain the procedure for finding IDFT using FFT algorithm
21. Compute the output using 8 point DIT – FFT algorithm for the sequence
x(n) = {1,2,3,4,5,6,7,8}
22.Determine the 8-point DFT of the sequence x(n) = {0,0,1,1,1,0,0,0}
23. Find the circular convolution of x(n) = 1,2,3,4} and h(n) = {4,3,2,1}
24. Determine the 8 point DFT of the signal x(n) = {1,1,1,1,1,1,0,0}. Sketch its
magnitude and phase.

UNIT - IV
DESIGN OF DIGITAL FILTERS
1. With suitable examples, describe the realization of linear phase FIR filters
2. Convert the following analog transfer function H(s) = (s+0.2) / [(s+0.2)2 + 4] into
equivalent digital transfer function H (z) by using impulse invariance method assuming
T= 1 sec.
3. Convert the following analog transfer function H(s) = 1 / (s+2) (s+4) into equivalent digital
transfer function H (z) by using bilinear transformation with T = 0.5 sec.
4. Convert the following analog transfer function H(s) = (s+0.1) / [(s+0.1)2 + 9] into
equivalent digital transfer function H (z) by using impulse invariance method assuming
T= 1 sec.
5. Convert the following analog transfer function H(s) = 2/ (s+1) (s+3) into
equivalent digital transfer function H (z) by using bilinear transformation with T = 0.1
sec.Draw the diect form – II realization of digital filter.
6. Design a high pass filter of length 7 samples with cut off frequency of 2 rad / sec
using Hamming window. Plot its magnitude and phase response.
7. For the constraints
0.8 ≤ H(ω) ≤ 1.0 , 0 ≤ ω ≤ 0.2π
H(ω) ≤ 0.2, 0.6 π ≤ ω ≤ π
With T= 1 sec determine the system function H(z) for a Butterworth filter using
bilinear transformation.
8. For the constraints
0.7 ≤ H(ω) ≤ 1.0 , 0 ≤ ω ≤ π/2
H(ω) ≤ 0.2, 3π/4 ≤ ω ≤ π
With T= 1 sec, design a Butterworth filter.
9. Explain the quantization effects in design of digital filters.
10. Discuss about the window functions used in design of FIR filters
11. Obtain the cascade and parallel realization of system described by difference equation
y(n) = -0.1 y(n-1) + 0.2 y(n-2) + 3x(n) +3.6 x(n-1) + 0.6 x(n-2) (10)
12. Design a digital Butterworth filter satisfying the following constraints with T= 1 sec,
using Bilinear transformation.
0.707 ≤ H (ω) ≤ 1.0, 0 ≤ ω ≤ π/2
H (ω) ≤ 0.2, 3π/4 ≤ ω ≤ π (16)
13. Design a digital Chebyshev filter satisfying the following constraints with T= 1 sec,
using Bilinear transformation.
0.707 ≤ H (ω) ≤ 1.0, 0 ≤ ω ≤ π/2
H (ω) ≤ 0.2, 3π/4 ≤ ω ≤ π (16)
14. Draw and explain cascade form structure for a 6th order FIR filter.
15. Explain impulse invariance method of digital filter design.
16. Derive an expression between s- domain and z- domain using bilinear transformation.
Explain frequency warping.
17. Draw the structure for IIR filter in direct form – I and II for the following transfer
Function H (z) = (2 + 3 z-1) (4+ 2 z-1 +3 z-2) / (1+0.6 z-1) (1+ z-1+0.5 z-2)
18. Design a filter with
Hd(ω) = e-j2ω - π/4 ≤ ω ≤ π/4
= 0 π/4 ≤ ω ≤ π
Using a Hamming window with N= 7
23. Discuss about frequency transformations in detail.
24. Design a LPF with
Hd(ω) = e-j3ω - 3π/4 ≤ ω ≤3π/4
= 0 3π/4 ≤ ω ≤ π
Using a Hamming window with N= 7
25. Using the bilinear transformation and a low pass analog Butterworth prototype,
design a low pass digital filter operating at a rate of 20 KHz and having pass band
extending to a 4 KHz with a maximum pass band attenuation of 0.5 dB and stop band
starting at 5KHzwith a minimum stop band attenuation of 10 dB.
26. Using the bilinear transformation and a low pass analog Chebyshev type I prototype,
design a low pass digital filter operating at a rate of 20 KHz and having pass band
extending to a 4 KHz with a maximum pass band attenuation of 0.5 dB and stop band
starting at 5KHzwith a minimum stop band attenuation of 10 dB.
27. Obtain the cascade realization of linear phase FIR filter having system function
H(z) = ( 1+1/2 z-1 + z-2) (2 + ¼ z-1 +2z-2) using minimum number of multipliers.
28. Design an ideal Hilbert transformer having frequency response
H(ejω) = j for -π ≤ ω ≤ 0
= -j for 0≤ ω ≤ π
for N=11, using i. rectangular window
ii. Blackmann window
29. Obtain the direct form – I, direct form – II, cascade and parallel form of realization
for the system y(n) = -0.1 y9n-1) + 0.2 y(n-2) + 3 x(n) + 3.6 x (n-1) + 0.6 x(n-2)
30. Using Bilinear transformation and a low pass analog Butterworth prototype, design a low
pass digital filter operating at the rate of 20k Hz and having pass band extending to 4 kHz
with maximum pass band attenuation of 10 dB and stop band starting at 5 kHz with a
minimum stop band attenuation of 0.5 dB
31. Using Bilinear transformation and a low pass analog Chebyshev type I prototype, design
a low pass digital filter operating at the rate of 20k Hz and having pass band extending to 4
kHz with maximum pass band attenuation of 10 dB and stop band starting at 5 kHz with a
minimum stop band attenuation of 0.5 dB
32. Design a low pass filter using Hamming window for N=7 for the desired frequency
Response
D (ω) = ej3ω for -3π / 4 ≤ ω ≤3π / 4
= 0 for 3π / 4 ≤ ω ≤ π
33. Design an ideal differentiator for N=9 using Hanning and triangular window
 UNIT V
DIGITAL SIGNAL PROCESSOR
1.Explain various addressing modes of a DSP processor ( Immediate, Indirect,
Register, Memory mapped register, Direct, Circular)
2.Explain in detail about the architectural details of DSP processors with its
advantages and disadvantages.
● Von Neumann Architecture
● Harvard Architecture
● MAC Unit
● Pipelining
3.Draw and explain architecture of TMS320C54x and TMS320C50 processor
4. Explain Von Neumann, Harvard architecture and modified Harvard architecture for the
computer.
5. Write short notes on auxiliary registers
6. Write short notes on circular addressing mode
7. Write short notes on memory mapped register addressing
8. Explain the advantages and disadvantages of VLIW architecture
9. Draw the block diagram of Harvard architecture and explain