0% found this document useful (0 votes)
26 views8 pages

Digital Signal Processing Exam Key

Uploaded by

wikk891
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
26 views8 pages

Digital Signal Processing Exam Key

Uploaded by

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

Scheme of Valuation/Answer Key

(Scheme of evaluation (marks in brackets) and answers of problems/key)

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

FIFTH SEMESTER [Link] DEGREE EXAMINATION, DECEMBER 2020

Course Code: EC301

Course Name: DIGITAL SIGNAL PROCESSING

Max. Marks: 100 Duration: 3 Hours

PART A

Answer any two full questions, each carries 15 marks. Marks

1 a) N point Sampling with brief explanation and eqn----3marks (3 )

b) X(k)={1.5, 0, 2+0.5j, 0, 0.5, 0, 2-0.5j, 0 }----2marks (12 )


Flowgraph -----5marks
Input X(k) in bit reversed order------1mark
1st and 2nd stage output –--- 2 marks
Ans:[6/8, 0, -2/8, 2/8, 6/8, 0, -2/8, 2/8] -----2marks
2 a) Let Z(k)=DFT{1+2j, 2+j, 3+2j, 1+j}=[7+6j, -2-j, 1+2j, -2+j] ------ 4marks (7)
1
X(k)= (Z(k)+Z∗ (N − k) ) ---- 2marks for eqns
2
1
Y(k)= (Z(k)- Z∗ (N − k))
2𝑗

X(k) and Y(k) ------ 1mark


X(k) = [7, -2-j, 1, -2+j]
Y(k) = [6, 0, 2, 0]
b) Ans (8)
X(k)=[ 6, 2, -2, 2] -------2 marks
X(k)Y(k)=G(k)=DFT{g[n]}=[36, 2-2j, 0, 2+2j]-----2marks
𝐺(𝑘)
Y(k)= = [6, 1-j, 0, 1+j] ------ 3marks (if eqn X(k)Y(k)=G(k) is correct 1mark can be given)
𝑋(𝑘)

Second sequence y(n)= IDFT{Y(k)}=[2, 2, 1, 1] ----- 1 mark


3 a) h(n)={1 3 1}; x(n)={1 2 1 2 1 2 1 2 1 2 1}---2marks 9
Steps---5 marks
x1(n)=[0 0 1 2 1]; h(n)=[1 3 1 0 0]
y1[n]=[5 1 1 5 8]

x2(n)=[2 1 2 1 2]; h(n)=[1 3 1 0 0]


y2[n]=[9 9 7 8 7]

x3(n)=[1 2 1 2 1]; h(n)=[1 3 1 0 0]


y3[n]=[6 6 8 7 8]

x4 (n)=[2 1 2 1 0]; h(n)=[1 3 1 0 0]


y4 [n]=[3 7 7 8 5]

x5 (n)=[1 0 0 0 0]; h(n)=[1 3 1 0 0]


y5 [n]=[1 3 1 0 0 0]

y[n]=[1 5 8 7 8 7 8 7 8 7 8 5 1] Answer---2marks
7 1 7
b) Using Parsevals theorem �𝑘=0 |𝑥(𝑛)|2 = 8 �𝑘=0 |𝑋(𝑘)|2 ----2marks 6

1 7 1
8
�𝑘=0 |𝑋(𝑘)|2 = 8 x25 = 3.125----1mark
7 𝑗2𝜋𝑛𝑘
1
𝑥(𝑛) = � 𝑋(𝑘)𝑒 8
8 𝑘=0
7
1 1 7 1 7
𝑥(4) = � 𝑋(𝑘)𝑒 𝑗𝜋𝑘 = �𝑘=0 X(k) cos(𝜋𝑘) = �𝑘=0 X(k)(−1)k---2marks
8 𝑘=0 8 8

1
𝑥(4) = [𝑋(0) − 𝑋(1) + 𝑋(2) − 𝑋(3) + 𝑋(4) − X(5) + X(6) − X(7)]= 0.375+j0.25 ----
8

1mark

PART B

Answer any two full questions, each carries 15 marks.


4 a) 𝟂p, 𝟂s in rad ----1mark ( 10)
Calculation of Ωp, Ωs in rad/sec---2mark
Order N-------2marks
Cut-off frequency---- 1mark
Normalized transfer function----1mark
Denormalized transfer function H(s)----1 mark
Bilinear transformation eqn -----1mark
H(z)------1 mark (if substitution is correct 1 mark can be given.)
b) Ans:High Pass since put z=1 (or w=0), then H(z)=0 ( 5)
And when z=-1(or w=pi), then H(z)=1 ------ 5(Reason-3marks, HP—2marks)
5 a) Steps—4marks, Ans—1marks (5)
(𝑠 + 0.2)
𝐻(𝑠) =
(𝑠 + 0.2)2 + 32
1 − 𝑒 −0.2 cos (3)𝑧 −1 1 + 0.8105𝑧 −1
ℎ(𝑛) = =
1 − 2𝑒 −0.2 cos(3) 𝑧 −1 + 𝑒 −0.4 𝑧 −2 1 + 1.621𝑧 −1 + 0.6703 𝑧 −2
b) 3 properties ----3marks (3)
Magnitude response equation
Monotonic frequency response
Roll of rate -20N db/decade or -6N db/octave
c) Steps—5marks,Eqn for h(n)---2marks (7)

6 a) Hamming window to be used since 50 dB SB attenuation. ---1 marks (10)

Filter order-----1 mark, Window equation---2mark,

hd(n) values ----2marks, w(n)-----2marks, h(n)---2marks


6 b Atleast 2 comparisons-----5marks (5)

PART C

Answer any two full questions, each carries 20 marks.


7 a) 𝐻(𝑧) 0.7𝑧 2 − 0.252 ( 8)
=
𝑧 𝑧(𝑧 + 0.9)(𝑧 − 0.8)

𝐻(𝑧) 0.35 0.205 0.1441


= + +
𝑧 𝑧 (𝑧 + 0.9) (𝑧 − 0.8)

0.205 0.1441
Or 𝐻(𝑧) = 0.35 + (1+0.9𝑧−1 ) + (1−0.8𝑧−1 )

Steps --- 5marks

Structure---3marks

b) Direct form II structure----5 marks (8)

Coefficients when represented in Q7 format ------ 2 marks


Numerator coefficients --- 0.09375, 0.1484375, -0.25

Denominator coefficients -- 0.9921875, 0.2109375, -0.65625

Structure with modified coefficients --- 1mark

c) Block diagram—2 marks, Explanation---2marks (4)

8 a) Input quantization error with explanation related to rounding and truncation,----3.5marks (7)

DSP computational errors-coefficient quantization, product quantization, product round-off, overflow


error etc with explanations, --------3.5marks

b) x(n)={1 3 2 5 2 8 5 1 9} (8)

y(n)={1 0 0 3 0 0 2 0 0 5 0 0 2 0 0 8 0 0 5 0 0 1 0 0 9}---4marks

Block diagram-----2 marks (Upsampler followed by a LPF)

Cut-off frequency of filter—π/12 ------1marks

Explanation –need for interpolation filter—to cancel the images in the spectra (with diagram)—
1marks

c) Truncation---1.5marks, (5)

Rounding ---1.5marks,

Example for each---2marks

9 a) Limit cycle oscillation and its reason (product quantization)---3marks, example---1mark (4)

b) Steps------3marks(1mark for each- finding A1,B1; A2,B2; A3,B3) (8)

13𝑧 −1 5𝑧 −2 1𝑧 −3
𝐻(𝑧) = 1 + 24
+ 8
+ 3
------------- 3marks

Structure-----2marks

c) 0.28𝑧 −1 + 0.32𝑧 −2 + 0.04𝑧 −3 (8)


𝐻(𝑧) =
0.5 + 0.3𝑧 −1 − 0.12𝑧 −2 + 0.2𝑧 −3

Direct form 1---5marks, Transposed----3marks

You might also like