Enrolment No.

/Seat No_______________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE- SEMESTER–VII (NEW) EXAMINATION – WINTER 2024
Subject Code:3171003 Date:22-11-2024
Subject Name: Digital Signal Processing
Time:10:30 AM TO 01:00 PM Total Marks:70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
4. Simple and non-programmable scientific calculators are allowed.

MARKS
Q.1 (a) Without explicitly solving for 𝑋(𝑧), find the region of convergence of the z- 03
transform of following sequence: 𝑥[𝑛] = 2𝑛 𝑢[−𝑛]
(b) Use the z-transform to perform the convolution of the following two sequences: 04
1 𝑛
ℎ[𝑛] = { 2)
( 𝑓𝑜𝑟 0 ≤ 𝑛 ≤ 2
0 𝑒𝑙𝑠𝑒
𝑥[𝑛] = 𝛿[𝑛] + 𝛿[𝑛 − 1] + 4𝛿[𝑛 − 2]

(c) Find the inverse of each of the following z-transform: 07

1
𝑋(𝑧) = ; |𝑧| > 1
(1 − 𝑧 )(1 − 𝑧 −2 )
−1

Q.2 (a) Compute the convolution 𝑦[𝑛] = 𝑥[𝑛] ∗ ℎ[𝑛]. 03

where, 𝑥[𝑛] = {1,1,0,1,1} and ℎ[𝑛] = {1, −2, −3,4}

(b) The first nonzero value of a finite-length sequence 𝑥[𝑛] occurs at index 𝑛 = −6 and has 04
a value 𝑥[−6] = 3 and the last nonzero value occurs at index 𝑛 = 24 and has a value
𝑥[24] = −4. What is the index of the first nonzero value in the convolution
𝑦[𝑛] = 𝑥[𝑛] ∗ 𝑥[𝑛]
and what is its value? What about the last nonzero value?
(c) For following system, determine whether the system is (1) Memoryless (2) Causal 07
(3) Stable (4) Time Invariant and (5) Linear : 𝑇(𝑥[𝑛]) = 𝑒 𝑥[𝑛]

OR
(c) For following system, determine whether the system is (1) Memoryless (2) Causal 07
(3) Stable (4) Time Invariant and (5) Linear : 𝑇(𝑥[𝑛]) = (cos 𝜋𝑛) 𝑥[𝑛]
Q.3 (a) Figure 1 shows pole- zero plots for two different LTI systems 𝐻1 (𝑧) and 𝐻2 (𝑧). 03
Based on these plots, state whether or not each system is all-pass system.
(b) For each of the following system functions, state whether or not it is a minimum 04
phase system. Justify your answers.
1
(1−2𝑧 −1 )(1+ 𝑧 −1 )
2
(1) 𝐻1 (𝑧) = 1 −1 1
(1−3𝑧 )(1+3𝑧 −1)

1
1−3𝑧 −1
(2) 𝐻2 (𝑧) = 𝑗 𝑗
(1−2𝑧 −1 )(1+2𝑧 −1 )

1
 (c) Consider the causal linear shift-invariant filter with system function: 07
1 + 0.875𝑧 −1
𝐻(𝑧) =
(1 + 0.2𝑧 −1 + 0.9𝑧 −2 )(1 − 0.7𝑧 −1 )
Draw a signal flowgraph for this system using:
1) Direct form I
2) A cascade of first- and second-order systems realized in transposed direct
form II
OR
Q.3 (a) Figure 2 shows pole- zero plots for two different LTI systems 𝐻3 (𝑧) and 𝐻4 (𝑧). 03
Based on these plots, state whether or not each system is all-pass system.
(b) When the input to an LTI system is 𝑥[𝑛] = (1)𝑛 𝑢[𝑛] + 2𝑛 𝑢[−𝑛 − 1], the 04
3
1 𝑛 2 𝑛
corresponding output is 𝑦[𝑛] = 5 (3) 𝑢[𝑛] − 5 (3) 𝑢[𝑛].
Is the system stable? Is it causal?
(c) Consider the causal linear shift-invariant filter with system function: 07
1 + 0.875𝑧 −1
𝐻(𝑧) =
(1 + 0.2𝑧 −1 + 0.9𝑧 −2 )(1 − 0.7𝑧 −1 )
Draw a signal flowgraph for this system using:
1) Direct form II
2) A cascade of first- and second-order systems realized in direct form II
Q.4 (a) Compare IIR and FIR filters. 03
(b) Write down pros and cons of digital filters. 04
(c) Design FIR filter (low pass) using rectangular window with passband gain of 07
unity, cutoff frequency of 200 Hz, sampling frequency of 1kHz. Assume the length
of impulse response as 7.
OR
Q.4 (a) How can one ensure that the results obtained from circular convolution match 03
those obtained from linear convolution when applied to two given time sequences?
(b) Write down difference between DFT and DTFT. 04
(c) The transfer function of analog filter is 𝐻𝑎 (𝑠) = 3 07
(𝑠+2)(𝑠+3)
with T=0.1 sec. Design
the digital IIR filter using Bilinear Transformation.

Q.5 (a) What is the difference between circular convolution and linear convolution? 03
(b) Determine the following sequence: 𝑦[𝑛] = 𝑥[𝑛] * ℎ[𝑛] 04
Where 𝑥[𝑛] = {1,2,3,1} and ℎ[𝑛] = {4,3,2,2}

(c) Derive DIT FFT flow graph for N=4 and hence find DFT of 𝑥[𝑛] = {1,2,3,4}. 07
OR
Q.5 (a) Write down properties of twiddle factor 𝑊𝑁 . 03

(b) Compute the DFT of the sequence which is expressed as follows: 04

1
𝑥[𝑛] = {4 , 0≤𝑛≤2
0, 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
(c) Obtain DFT of the following sequence: 07
1 1 1 1
𝑥[𝑛] = { , , . , 0,0,0,0}
2 2 2 2
Using the decimation in frequency FFT algorithm.

2
 Figure: 1

Figure: 2
*****************