Professional Documents
Culture Documents
DSP Previous Papers
DSP Previous Papers
of Questions: 10
B.E. SIXTH
-I Roll No. :0701....
SEMESTER UECU (GNG) / RGPV (N) EXAMINATION JUNE, 2016
(Branch: Electronics & Communication Engineering)
EC 6003 / EC-603(N) DIGITAL SIGNAL
PROCESSING
Time Three Hours Maximum Marks 70/ 100
Note Min. Pass Marks
Attempt all questions. All 22/35
questions carry equal marks.
I(a) Verify various systems
properties for the following systems:
) yln] = R*N10 x[k] (ii) y{n] = 2k=no n # 0
) By direct evolution of convolution sum determine the unit step response of LTI
impulse respense is h[n] a-"ul-n] =
<a <1
a
system whose
OR
2(a) Determine the
homogeneous response of the system i.e.
the system characterized possible outputs if
by the following difference x[n]=0 for all n for
yln] -
5y[n 1] + 6y[n
equation
2]
-
2x[n
-
1]
graph representation using 1 order
system
parallel form structure for the
following
H(z) = 1+22+2
1-0.75z-1+0.125z-2
3a) State the properties of ROC for Z
transform.
Ab) Determine the Z transform of the
sequence x{n] ={ OSnN - 1
N n
OR
4(a) Determine inverse Z transform of the following: (i) X(z) =
lzl >
/2
(ii) Xl) = lzl <
/2
(iii) X) =
(b) Verify differentiation in izi>/2
frequency property of Z-transform.
rol 0 n o SN-1
(c) xn= to nodd 0<n < N - 1 n even
0 S n0
SGL¥-1
(d) xn] =
{a",
0 Otherwise
OR
Ba) Define DFT ofa sequence.
6) Verify circular convolution
property of DFT.
7Explain decimation in time
FFT algorithm for N=8.
OR
8 Explain "Decomposition for "N' composite number FFT algorithm.
Explain design of digital ilter using impulse invariance method.
time system with impulse Consider a causal continuous
response he(t) and system function
S + a
H(s) =
(s + a)2 + b2
Use impulse invariance to determine H,(2) for a discrete-time system such that
OR
hi[n] =
he[nT]
10 Explain design of digital filter using windowing.
Total No. of Questions 05
Roll No.:0701 Lk..Lo21.
B.E. SIXTH SEMESTER EXAMINATION
(Branch: Electronics &CommunicationDECEMBER,
2019
EC 6003 DIGITAL Engineering)
SIGNAL PROCESSINGS
Time Three Hours
Maximum Marks 70
Note Attempt all Min. Pass Marks
questions as per given internal choice. 22
1(a) Consider the following length 7sequence defined for -3 ns3 06
x[n] =[3
yn] =
2
0 1 4 5 2]
[0 7 1 -3 4 9 2] wwwt , ,S
Generate the following wln] = [-54 3 6 5 0 1]
sequence:
) u[n] x[n] +y[n]] =
P.T.O.
2
De 9
I/2//
3(b) Find the periodic convolution of the following
for n = 0,2
sequence of period 5 each: 08
for n =1
(i) n]= , for n = 3 and
3 for n =4
for n = 0
for n = 1,3
(ii) hn]= for n = 2
for n = 4
OR
Verify circular convolution
property of DFT. 08
4(a) Explain Goertzel's Algorithm.
06
OR
Explain decomposition of 'N' composite number fft algorithm. 06
4(b) Explain decimation in time fft algorithm for N 8.
08
OR
Explain decimation in frequency fft algorithm for N =
8. 08
5(a) Consider continuous-time system with system function
a
Hc(s) the output of
the
= 06
system yc(t) is related to the input
time system is obtained
xc (t) by yc(t) Sxe(r)dr. Suppose a discrete
=
OR
2(a) Determine the homogenous response of the following LTI causal system described
by
yn-5yn -1] +6y[n -2] = 2x[n -1]
(b) For each of the
following impulse
stable. responses of LTI system indicate whether or not the system is
() h[n] = 4"u[n]
i) h[n) =
u{n] u{n 10]
-
-
(iii) hn] =
3" u[-n 1] -
() 1-2
(ii) (Z-1)2
(ii)
(- (iv) 2
5
Computer the DFT of the
following finite
Nis even. length sequences considered to be of
length N where
(i) x[n] = 6 [n]
(ii) x{n] 6[n - no)
=
0< no N -
1
n even
ii) 0 n s N -1
xlo n odd
SSN-1
(iv)x{n]= 0nsN -1
Otherwise
P.T.O.
I/2/
6
Define DFT of a
OR
sequence and find N =
6 pt circular
convolution of the
following
xn
3 4 5 6
hn
0
2
1 Explain in detail
decimation in time
FFT algorithm for N 8.
8 OR
Explain FFT algorithm using decomposition for N' composite number.
9
Explain design of digital filters
using impulse invariant method.
OR
10 Design of digital filters
using method of windowing.
PSP Suh 17
Total No. of Questions 10 Roll No.:0701..2ou3
B.E. SIXTH SEMESTER UECU (GING) EXAMINATION JUNE, 2017
(Branch:Electronics&Communication Engineering)
EC 6003 DIGITAL SIGNAL
PROCESSING
Time Three Hours Maximum Marks 70/100
Note Attempt all questions. All Min. Pass Marks 22/35
questions cany equal marks.
For each of the
following systems, determine whether the system is (i) Stable (ii) Causal
(iii) Linear (iv) Time invariant
(a) TCx[n]) =
g{n]x[n] with gln] given
(6) T(x}n]) Zk=n, x[k]
=
n#0
(c) Txln] x\n no= -
OR
2(a) Determine the
homogenous response of the following LTI causal
system described by
yn]- 5yn -1] +6y{n
(b) For each of the -2] 2x[n 1 = -
stable.
following impulse responses LTI system indicate
of
whether or not the system is
) h[n] = 4"u{n]
(ii) n] =
u{n] -u{n - 10]
(ii) h[n] =
3" u[-n -
1]
3(a) Define z transform and write
properties of ROC.
(b) Determine the z transform of the
sequence
xn = 0SngN-1
N Nn
OR
Answer by inspection
which one of the
sequence, clearly state your reasons in each following z
transforms could be Z T of
case. a causal
() 1-2-1)
(i) (2-1)2
(iii)
(iv)
5
Computer the DFT of the
Nis even. following finite length sequences considered to be of
(i) xn) = ö{n
iength N where
(i) xn ô[n -nol=
0 Sno
(ii) neven N-1
0nsN - 1
0 n odd
(Giv) xn= 0S msN -
1
0
0nN 1
Otherwise
P.T.O.
/2/
6
Define DFT of a OR
sequence and find N =
6 pt
6 circular.convolution of the following
xn
2 3 4 5 6
hn
23
7
Explain in detail decimation in time FFT
algorithm for N 8.
8 Explain FFT OR
algorithm using decomposition for 'N'
composite number.
9 Explain design of digital filters
using impulse invariant method.
10
Design of digital filters using method of OR
windowing.
DSP
un 7
Total No. of Question 10 Roll No.:0701...4..3.
B.E. SIXTH SEMESTER UECU (G/NG) EXAMINATION JUNE, 2015
(Branch: Electronics & Communication Engineering)
EC-6003 DIGITAL SIGNAL PROCESSING
Time Three Hours Maximum Marks 70/100
Note Attempt one question from Min. Pass Marks 22/35
each unit. All questions carry equal marks.
ua) For each of the
following system, determine whether not the
or
system is (i) stable (i1) causal
(ii) linear (iv) shift invariant
(t) Tx n) =
f) Tx [n- ax{n}tb
k = no
Justify your answer
For the system characterized by the following equation
y [n] =
ay [n-1] + x[n
Obtain unit sample
response. Assume initial rest conditions use
method of recursion.
OR
2(a) Consider the discrete time linear
casual
equation. system defined by the following difference
.
3) Define DFT of a
sequence and find DFT of the foliowing sequence.
X [n]
x2 n] =
[ 1,2,3,4]
Explain decimation in time FFT algorithm for N-8
8 OR
Explain decomposition for N
composite number FFT algorithm.
9
Explain design ofdigital filter using bilinear
transformation.
Explain design of digital filter
OR
S n i5
eLoKoNnde
oUal