0% found this document useful (0 votes)
297 views4 pages

2022 Set A PYQ Paper - Digital Signal Processing PYQ Paper For Sem V Uploaded by Navdeep Raghav (DU Academic Corner)

Uploaded by

sanjeev singh
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)
297 views4 pages

2022 Set A PYQ Paper - Digital Signal Processing PYQ Paper For Sem V Uploaded by Navdeep Raghav (DU Academic Corner)

Uploaded by

sanjeev singh
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
You are on page 1/ 4

[This question paper contains 4 printed pages]

Sr. No. of Question Paper : --- Your Roll No…………….


Unique Paper Code :
Name of the Paper : Digital Signal Processing
Name of the Course : B.Sc. (Hons.) Electronics (CBCS)
Semester :V
Maximum Marks : 75
Duration : 3.0 Hours

Instructions for Candidates


1. Write your Roll No. on the top immediately on receipt of this question paper
2. Attempt FIVE questions in all.
3. All questions carry equal marks
4. Use of Scientific non-programmable calculator is allowed

1. (a) What are the basic elements of DSP systems? Mention some of the DSP
applications?
(b) Determine whether the following signals are power or energy signals
i. 𝑥[𝑛] = 𝑛 𝑢[𝑛]
ii. 𝑥[𝑛] = 𝑗

(c) Determine the odd and even parts of a unit step signal.

(d) Determine whether or not the following signal is periodic. In case the signal is
periodic, specify its fundamental period.
nπ nπ
𝑥[𝑛] = 2 cos + cos
4 4
(3+6+3+3=15)
2. (a) For each system determine whether the following systems are memoryless,
stable, causal, linear or time-invariant.
i. 𝑦[𝑛] = ∑ 𝑥[𝑘]
ii. 𝑦[𝑛] = 𝑥[𝑛 ]
(b) Compute the convolution of following pair of signals
𝑥[𝑛] = ℎ[𝑛] = 𝑢[𝑛]
2

(c) Find the DTFT of the following finite duration sequence

𝑥[𝑛] = 𝑛 = 0,2,4 …
0 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
(5+5+5=15)

3. (a) Check whether the corresponding LTI system with system function
−1 − 0.4𝑧
𝐻(𝑧) =
1 − 2.8 𝑧 + 1.6 𝑧
is stable and causal, if the ROC is
(i) |z| > 2
(ii) |z| < 0.8
(iii) 0.8 < |z| < 2
(b) Determine system function from given flow graph. Also write impulse

response of the system.

(c) State and prove convolution property of z-transform.


(6+5+4=15)
4. (a) Determine z-transform of the given signal and sketch pole-zero pattern.
1 1
𝑥[𝑛] = (𝑛 + 𝑛 ) 𝑢[𝑛 − 1]
2 3
(b) A causal discrete-time LTI system is described by
3 1
𝑦[𝑛] − 𝑦[𝑛 − 1] + 𝑦[𝑛 − 2] = 𝑥[𝑛]
4 8
where x[n] and y[n] are the input and the output of the system, respectively.
Determine the system function H(z) and impulse response h[n] of the system.
(c) Draw the signal flow graph for the direct form II implementation of the LTI
system with system function
3

5 1
1+ 𝑧 + 𝑧
𝐻(𝑧) = 6 6
1 1
1− 𝑧 − 𝑧
2 2
(4+6+5 = 15)

5. (a) A finite length sequence x[n] is as shown in Figure below:

Sketch the sequences


x1[n]= x[((n-2))4], 0 ≤ n ≤ 3

x2[n]= x[((-n))4], 0 ≤ n ≤ 3

(b) Determine the Inverse DFT (IDFT) of


X(k) = {3, (2+j), 1, (2-j)}.
(c) Consider two four-point sequences x[n] and h[n]
3πn
𝑥[n] = cos , n = 0,1,2,3
8

h[n] = , n = 0,1,2,3

Find the circular convolution by multiplying the DFTs of x[n] and h[n] and
performing an Inverse DFT.
(4+4+7 = 15)

6. (a) Compute the 8-point DFT of the sequence

x[n] = {1,2,3,2,1,2,3,2}

using radix-2 decimation-in-time algorithm. Indicate the initial values,

intermediate values and the final DFT coefficients on the flow graph itself.

(b) Using DIF-FFT algorithm, find the 4-point DFT of sequence


4

(10+5=15)

7. (a) What are advantages and disadvantages of digital filters?

(b) A Low pass filter is to be designed with the following desired frequency
response
𝜋 𝜋
𝑒 − ≤𝜔 ≤
𝐻 𝑒 = 4 4
𝜋
0 − ≤ |𝜔| ≤ 𝜋
4
Determine the filter coefficients ℎ(𝑛) if the window function is defined as
1 0≤𝑛≤4
𝑤[𝑛] =
0 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
Determine and plot the frequency response 𝐻(𝑒 ) of the designed filter.
(5+10=15)

You might also like