SRM University 2007 B.Tech Electronics and Communications Engineering BANK Digital Signal Processing - Question Paper

38. Determine H(Z) when the response of the system characterized by
h (n) = (1/2)n u(n)
39. Determine the DFT of the sequence
h(n) = 1/4 ; for 0 ? n ? 2
0 ; otherwise

40. Given x(n) = {0, 1, 2, 3}, obtain X (k) using DIT – FFT algorithm.


PART-B
1. Calculate the DFT of (1/4)n , for N=8.
2. Determine the response of the system whose input x(n) and impulse response h(n) are provided by x(n)={1,2,3,1}; h(n)={1,2,1,-1} using graphical method.
3. Determine the response of the system whose input and impulse response are

4. Find the convolution of the signals
one ; n=-2, 0,1
x(n) = two ; n= -1
0 ; elsewhere
h(n) = d(n)- d(n-1)+ d(n-2)- d(n-3).

5. Determine impulse response for the system defined by 2nd order difference formula y(n)-4y(n-1)+4y(n-2)= x(n-1).
6. a) obtain the circular convolution of the finite duration sequences x1(n)={1, -1, -2, 3,-1}, x2(n)={1,2,3}.
b) Perform the circular convolution of the sequences x1(n)={1,1,2,1}, x2(n) = {1,2,3,4} using concentric circle method.
7. Compute the DFT of the sequence x(n) = one ; 0? n ? 7
0 ; otherwise
using the DIT-FFT algorithm.

8. Compute the 8-point DFT of the sequence
x(n) = {0.5, 0.5, 0.5, 0.5, 0, 0, 0, 0} using DIT-FFT algorithm.
9. Compute the 8-point DFT of the sequence x(n) = {1, 1, 1, 1, 1, 1, 1, 1} using DIF-FFT algorithm.
10. Compute the 8-point DFT of the sequence
x(n) = {0.5, 0.5, 0.5, 0.5, 0, 0, 0, 0} using DIF-FFT algorithm.
11. Compute the 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-FFT algorithm.
12. Given x(n)={ 1, 2, 3, 4, 4, 3, 2, 1} obtain X(K) using DIT-FFT algorithm.
13. Given x(n)= 2n and N=8. obtain X(K) using DIT-FFT algorithm.
14. Given x(n)= n +1 and N=8. obtain X(K) using DIT-FFT algorithm.
15. Given x(n)={0, 1, 2, 3, 4, 5, 6, 7}. obtain X(K) using DIF-FFT algorithm
16. Compute the 8-point DFT of the sequence
x(n) = {1, 1, 1, 1, 0, 0, 0, 0} using DIT-FFT algorithm.
17. Given X(K)= { 20, -5.828- j2.414, 0, -0.172-j0.414, 0, -0.172 + j0.414, 0, -5.828 + j2.414}.Find x(n)
18. Find the DFT of the sequence x(n)={1, 1, 1, 1, 0, 0, 0, 0} using DIT-FFT algorithm.
19. Find the DFT of the sequence x(n)={2, 2, 2, 2, 1, 1, 1,1} using DIT-FFT algorithm.

Earning:   Approval pending.