cs331 digital signal processing nov dec 2004

4
K 1099 B.E./B.Tech. EGREE EXAMINATION. NOVEMBER/DECEMBER 004. Fifth Semester Computer Science and Engineering CS 331 - DIGITAL SIGNAL PROCESSING Time : Three hours Maximum: 100 marks Answer ALL questions. PARTA-(10x2=20marks) 1. When a discrete-time signal is said to be symmetric or antisymmetric? 2. Define correlation. 3. State Parseval's elation. 4. Determine the discrete time Fourier transform of the sequence x(n) = {1, 1, 1, 1). r 5. What do you understand by linear phase response? 6. What is Gibbs phenomenon? 7. What are the three quantization errors due to finite word length, registers in digttal filters? 8. What are the advantages and disadvantages of bilinear transformation? 9. What is an interpolator? 10. What is known as   w   w   w  .    M   a   a   n   a   v   a    N  .   c   o   m

Upload: chandru-sekar

Post on 03-Jun-2018

215 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: CS331 Digital Signal Processing Nov Dec 2004

8/12/2019 CS331 Digital Signal Processing Nov Dec 2004

http://slidepdf.com/reader/full/cs331-digital-signal-processing-nov-dec-2004 1/4

K 1099

B.E./B.Tech. EGREE EXAMINATION.NOVEMBER/DECEMBER 004.

Fifth Semester

Computer Science and Engineering

CS 331 - DIGITAL SIGNAL PROCESSING

Time : Three hours Maximum: 100 marks

Answer ALL questions.

PA RTA - ( 1 0 x 2 = 2 0 m a r k s )

1. When a discrete-time signal is said to be symmetric or antisymmetric?

2. Define correlation.

3. State Parseval's elation.

4. Determine the discrete time Fourier transform of the sequence

x(n) = {1 , 1 ,1 , 1 ) .

r 5. What do you understand by linear phase response?

6. What is Gibbs phenomenon?

7. What are the three quantization errors due to finite word length, registers in

digttal filters?

8. What are the advantages and disadvantages of bilinear transformation?

9. What is an interpolator?

10. What is known as periodogram?

w w w .

M a a n a

v a N .

c o m

Page 2: CS331 Digital Signal Processing Nov Dec 2004

8/12/2019 CS331 Digital Signal Processing Nov Dec 2004

http://slidepdf.com/reader/full/cs331-digital-signal-processing-nov-dec-2004 2/4

PA RT B - ( 5 x 1 6 = 8 0 m a r k s )

11. (i) How to obtain linear convolution from circular convoiution? Explain with

an example. (8 )

(ii) Find the N-point DFT of the following signals :

( 1 ) x ( n ) = 6 (n n o )

Q ) x ( n ) = o n

12. (a) Find the cross-correlation of two finite length sequences.

(i) Finite length sequences

x ( n ) = { 7 , 2 , 1 , L 1 ;( n ) = { 1 , 1 , 2 , I 1

(8 )

( 8 ) v

(ii) For the given impulse lesponse determine whether the system

is stable and causal h (n ) = 6(n) + sintm h\n) = n2 u(, -1). (8)

Or

(b) (i) Evaluate the fourier transform of the system rvhose unit sample

response

h ( n ) - - 1 f o r 0 < n < N - 1

0 elsewhere. (8)

(ii) Describe the odd and even symmetry property of the fourier

transform. (S) v

13. (a) Design an ideal band pass filter with a frequency response.

H s k r ' ) = 1 f o r r d 4 < l w l < 3 n / 4= 0 otherwise

Find the values of h(n) for N = 11 and plot the frequency esponse. (16)

Or

K 1099

w w w .

M a a n a

v a N .

c o m

Page 3: CS331 Digital Signal Processing Nov Dec 2004

8/12/2019 CS331 Digital Signal Processing Nov Dec 2004

http://slidepdf.com/reader/full/cs331-digital-signal-processing-nov-dec-2004 3/4

Page 4: CS331 Digital Signal Processing Nov Dec 2004

8/12/2019 CS331 Digital Signal Processing Nov Dec 2004

http://slidepdf.com/reader/full/cs331-digital-signal-processing-nov-dec-2004 4/4

(b) (i) Describe he use of DFT in power spectrum estimation. (8 )

(ii) Explain the design and implementation of filters in sampling rate

conversion. ( 8 )

K 1099

w w w .

M a a n a

v a N .

c o m