B r100EcT303122203

Reg No.: Name:

APJ ABDUL KALAM TECIIN
B.Tech Degree 55 (R, S) / 55 (PT) (R, S) Examination

Course Code: ECT 303

Course Name: DIGITAL SIGNAL PROCESSING
Max. Marks: 100 Duration:3 Hours

PART A
(Answer all qaestions; each question carries 3 marks) Mark

I State and prove Parseval's theorem. 3

2 Obtain linear convolution of the sequences x(n) = {L,2,3} & h(n) = 3

{-L, -2} using circular convolution.

3 Find the number of comple* multiplications involved in the calculation of a 64- 3
point DFT using (i) direct computation (ii) radix-2 FFT algorithm
4 What is twiddle factor ? 3

5 Derive the mapping between s and z in bilinear transformation. 3

6 Given the specification pass band affenuation is I dB , stop band attenuation is 30 3

dB, pass band edge frequency 200 rad/sec and stop band edge frequency 600
radlsec . Determine the order of the Butterworth Analog filter?
,7
Draw the direct form realization of FIR system. 3
8 Why antialiasing filter is used in decimating systems? 3
9 What are the different stages in pipelining? 3

t0 Compare Von Neumann and Harvard architecture. 3

PART B.;
(Answer onefull questionfrom eoch module, each question carries 11 marks)

Module -l
ll a) Consider the length -12 sequence defined for 0< n< 12 is x(n) : {3, -1, 2,4, -3, -
2,0, !, -4,6,2,5| with a l2-point DFT .Evaluate the following functions of Xft)
without computing DFT:

a. X(0)
b.. x(6)

Page 1 of 3
 rt

r100EcT303122203

c' r;:'xg) .
d. Il1, tx(k)12
b) State and prove time shifting property of DFT. 6
12 a) Find the convolution of x(n) = {1,2,3,4,5,6,7,8,9} and h(n) : {2, 4, 6} using 7
overlap add method.
b) Find the 4-DFT ofthe sequence {1, l, l, 0} and plot lX(K)1. 7
Module -2
13 a) Given (n) = (n + l) f or0 S n < 7. Find (k) using DIT- FFT argorithm. g

D Compare DIT and DIF algorithms. 6

,I
14 a) Explain how a 2N point DFT of a 2N point real-valued sequence can be found by 6
computing a single N point DFT.
b) Find the IDFT of the sequence X(k) -- {4,L - j2.4L4,0 ,L - j0.4L4,0,\ + 8
j0.414,0,L + j2.4L4) using DIF - FFT algorithm
Module -3
15 a) Design a Butterworth filter using bilinear transformation. g

Specifications of desired LPF are

0.9<lH(w)l <1; 0<w<nlz

la(w)l <0.2, 3n/4 <wSII
T = L sec,Ap= 0.9,As = O.Z,wp =
X,*, = 3II /4
b) Derive equations for magnitude and phase responses of FIR filter whose impulse 6
response is symmetric and length N even.

16 a) ,lwl s 3n /4 l0
The desired frequency response of LpF is Hd.(w) = Ife-siwo, else
Determine the frequency response of FIR filter if hamming window is used.
' (N=7) *
b) Convert the analog filter H(s) given below in to a second order Butterworth 4

. digital filter using impulse invariance technique.

H(s)=+
sz+rF2s+1
Module -4
17 a) When is a cascade form realization preferred in FIR filters? 7
Obtain cascade realization with minimum number of multipliers for the system
function'

Page 2 of3
 r100EcT303122203

rL L -\/ t
,<r> =,(i* z-L" * i "-,)(t *
f "-' * r-,)
b) How upsampling and downsampling affect the frequency spectrum cif a signal 7
x(n) with frequency spectrum X(d') ? Explain the need of low pass filter prior to
downsampling
18 a) What are multirate DSP systems? Give the output of decimation by M system in 4
time domain.
b) Obtain the cascade and parallel form realization for the system l0
y(n) - -0.1y(n- 1) + O.2y(n-2) + 3 r(n) +3.6x(n- 1) + O.6x(n-2)
. Module -5
19 a) Explain the effects of coefficient quantization in IIR and FIR filters. 7
b) What are the main features of a DSP processor? Give the significance of MAC 7
unit in a DSP processor.
20 a) Draw the block diagram of TMS320C67XX and briefly explain the function of l0
each block.

b) Write a short note on finite word lenglh effects in DSP systems. 4

:t:f *

Page 3 of 3