Scribd
Upload
19 views2 pages

QP 2017-1

Uploaded by

nithya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
19 views2 pages

QP 2017-1

Uploaded by

nithya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

REG NO

7. Two parallel connected discrete time impulse responses h1(n) and h2 (n)
can be replaced by single equivalent discrete time system with the
SRM UNIVERSITY - Ramapuram Campus impulse response
DEPARTMENT OF EEE
CYCLE TEST-I (a) h1(n) * h2 (n) (b) h1 (n) + h2 (n) (c) h1 (n) - h2 (n)
15EE1023-Discrete Transforms & Signal Processing
Time: 3hrs Max. Mark: 75 Date: (d) h1 (n) *[ h1 (n)+ h2 (n)]

PART - A (15 x1 = 15Marks) 8. DIT algorithm divides sequence into


Answer ALL Questions
(a) positive & negative sequence (b) Even & Odd samples
1. The process of conversion of continuous time signal into discrete time
(c) Upper higher & lower spectrum (d) Small & Large sample
signal is known as
9. In an N point sequence, if N=16, the total number of complex additions
(a) Aliasing (b) Sampling (c) Convolution (d) Corelation and multiplications using radix-2 FFT are

2. For energy signals, energy will be finite and average power will be (a) 64 & 80 (b) 80 & 64 (c) 64 & 32 (d) 24 & 12

(a) Infinite (b) finite (c) zero (d) cannot be defined 10. If X(k) is DFT of x(n) then what is the DFT of X*(n)

3. The unit step signal U (n) delayed by 3 units of time is denoted as (a) X(N-K) (b) X* (K) (c) X* (N-K) (d) X* (-K)

(a) U(n+3) (b) U(n-3) (c) U(3-n) (d) U (3+n) 11. DFT is applied to

4. If x (n) =an U (n) is the input signal, then particular solution yp (n) will (a) (a) Infinite sequences (b) Finite Discrete sequences
be
(b) (c) Continuous infinite signals (d) Continuous finite Signals
(a) Kn an U(n) (b) K an U(n) (c)K1 an U(n) + K2 an U(n) (d) K a-nu(n)
(c) 12. Calculate DFT of x(n)={1,0,1,0}
5. An LTI discrete system is casual if and only if (d) (a)X(k)={2,0,2,0} (b) X(k)={ 1,0,1,0}
(a) h(n) ±0,n<0 (b) h(n) =0,n<0 (c) h(n) ±∞,n<0 (d) h(n) ±0,n>0 (e) (c) X(k)={2,0,1,0} (d) X(k)={1,0,2,0}
6. Which of the following system is causal? (f) 13. If x (n) and X (k) are N point DFT pair, then X(k+n)=?
(a) h(n) = n(1/2)n u(n+1) (b) y(n) = X2 (n) –X(n+1) (g) (a)X(-k) (b) -X(k) (c) X(k) (d) X(N-k)
(c) y(n) = X(-n) + X(2n-1) (d) h(n) = = n(1/2)n u(n)
14. The even part of signal x(n)=3ejπn/5 is OR
25. Determine the impulse response h(n) for the system
(a) jsin πn/5 (b) sin πn/5 (c) jcos πn/5 (d) cos πn/5 y(n)+y(n-1)-2y(n-2) = x(n-1)+2x(n-2)

15. The DFT of product of two discrete time sequence x1 (n) and x2 (n) is 26. Compute the eight point DFT of the sequence using radix-2 DIT FFT
X(n) = {0.5,0.5,0.5,0.5,0,0,0,0}
(a) 1/N[X1 (k)  X2 (k)] (b) 1/N[X1 (k) X2 (k)] OR
27. Compute the eight point DFT of the sequence using radix-2 DIF FFT
(c) 1/N[X1 (k)  X2* (k)] (d) [X1 (k) * X2 (k)]
X(n) = {1 for 0≤ n ≤ 7}
PART-B(6*4=24)(answer any 6)
28. Find the IDFT of the sequence
16. Test the stability of system X(k)= {4,1-j2.414,0,1-j0.414,0,1+j0.414,0,1+j2.414} using DIF
Algorithm
(1) y (n) = cos[x(n)] (2) Y(n) = nx(n) OR
29. Find the circular convolution of the following sequences
17. Determine the convolution sum of two sequences
(1) X(n) ={1,1,2,1} h (n) = {1,2,3,4}
X(n) ={3,2,1,2},h(n) = {1,2,1,2}
(2) X(n) = {1,2,3,1} h(n) = {4,3,2,2}
18. Define antialiasing and anti-imaging filtering

19. What are the differences & similarities between DIT and DIF?

20. Find the inverse DFT of Y(k) = {1,0,1,0}

21. Write any four properties of DFT

22. Check whether the following system is causal and Time variant

(1) y(n)=x(n2 ) (2) y(n) = ax(n)+bx(n-1)

23. If the first eight samples of 14 point DFT are {12,-1+3j,3+j4,1-j5,

-2+j2, 6+j3,-2-j3,10}.Determine the remaining samples of X(k)

PART-C (12 x 3 = 36 Marks)

24. Determine the solution of difference equation


Y (n) = 5/6y (n-1)-1/6 y(n-2)+x(n) for x(n) = 2n u(n)

You might also like