2006 Anna University B.E digital signal processing -it department Question paper

Course: B.E

University: Anna University

B.E / B.Tech, DEGREE EXAMINATION , MAY / JUNE 2006
Fourth Semester (IT)
Computer Science and EngineeringVII
IT 1252 DSP
(Regulation 2004)
Time: 3 hours Maximum : 100 marks
Answer ALL Questions
PART A – (10 X 2 = 20 marks)
1. What is meant by aliasing? How can it be avoided?
2. Is the system y(n) =In{x9n)} is linear and time invariant?
3. Define DFT pair.
4. Differentiate b/w DIT and DIF FFT algorithms.
5. Find the transfer function for normalized Butterworth filter of order 1 by
determing the pole values.
6. What does ‘frequency warping’ mean?
7. State the advantages of FIR filter over FIR filter.

8. List out the different forms of structural realizations available for realizing a FIR
system.
9. Bring out the difference between fixed point and floating point arithmetic.
10. How will you avoid cycle oscillations due to overflow in addition?
PART B – (5 X 16 = 80 marks)
11. (i) With a neat diagram , explain the analysis and synthesis part of a vocoder
in detail.
11 (ii) The system is characterized by the difference equation
y(n) = 0.75 y(n1)
+ 5x(n) . The input signal x(n) has a range of 6v
to +6v
represented by 8 bits. Find the quantization step signal, variance of the error
signal, variance of the error signal and variance of the quantization noise at the
output.
12.(a) (i)Find the output response of the system given the input signal

12.(a) (ii) Define correlation and bring out the difference between convolution and
correlation.
12.(b).(i) Determine the Z
transform of the signal. ) 1 ( ) ( ) ( - - - = n u b n u a n x n n b>a
and plot the ROC.
12.(b)(ii) Find the steady state value given.
12.(b)(ii) Find the system function of the system described by y(n) = 0.75
y (n1)
+0.125 y (n2)
= x (n) –x(n1)
and plot the poles and zeros of H(z).
13.(a)(i) Using DFTIDFT
method, perform circular convolution of the two
sequences x(n) = { 1, 2, 0, 1} and h(n) = {2, 2, 1, 1 }.
13.(a) (ii) State & prove the circular convolution property of DFT.
13.(b)(i) Determine the number of complex Multiplications and additions involved in
Npoint
Radix 2 and Radix4FFTT
Algorithm .

13.(b)(ii) Compute the 8point
DFT of the given data sequence
{ } 0 , 0 , 0 , 0 , 2
1 , 2
1 , 2
1 , 2
1 ) ( = n x using radix 2
decimation in Time FFT
Algorithm.
14.(a) (i)Connect the analog Filter with system
function. [ { } 9 ) 1 . 0 ( / ) 1 . 0 ( ) ( 2 + + + = S S S H a into a digital IIR filter using
impulse invariance method.(Assume T=0.1 sec)
14.(a) (ii) Obtain the direct form I, canonic form and parallel form realization
structures for the system given by the difference equation.

14.(b) Design and realize a digital Butterworth filter using bilinear transformation to meet
the following requirements.
1 ) ( 707 . 0 £ £ jw e H 2 0 p w £ £
2 . 0 ) ( £ jw e H p w p £ £ 2 3
15. (a) (i) Determine the filter coefficient h(n) of length M=15 obtained by sampling its
frequency response as .

15.(a)(ii) Obtain the transversal and linear phase relazation for a filter given by
h(n) ={0.5, 2.88, 3.404, 2.88, 0.5}
H(z) = 0.5+2.88Z 1

15.(b) Design a digital filter with p p £ £ = w e H jw
d 2
1 ) (
o otherwise
using Hamming Window with N=7. Draw the frequency response

Return to question paper search

Fresher Jobs

Resources

Colleges

2006 Anna University B.E digital signal processing -it department Question paper

Next Question Paper: digital signal processing-it department

Previous Question Paper: internet programming -it department

Related Question Papers:

Categories