You are on page 1of 5

School of Electronics Engineering

Winter Semester _ 2020-21


ECE2006– DIGITAL SIGNAL PROCESSING – ETH
CONTINUOUS ASSESMENT TEST (CAT)-1
Date: 13.03.2021 Marks: 30 Duration: 60 Min
SLOT: G2
Each Question carries 10 marks
Q.N Question CO
o
1 For the given signal x[n] with z-transform X(z), CO
1
2 − 2.05𝑧 −1
𝑋(𝑧) =
1 − 2.05𝑧 −1 + 𝑧 −2

The two circles through the poles at z = 0.8 and z = 1.25 divide the z-plane into the
three regions I, II, III, as shown in Fig. Derive the three possible inverse z-transforms
corresponding to the three ROC choices. And also prove which one is stable.

Answer:
[OR]
2 For the given signal x[n] with z-transform X(z),
1 1 CO
𝑋(𝑧) = −1
+ 1
1 − 0.8𝑧 1 − 1.25𝑧 −1

The two circles through the poles at z = 0.8 and z = 1.25 divide the z-plane into the
three regions I, II, III, as shown in Fig. Derive the three possible inverse z-transforms
corresponding to the three ROC choices. And also prove which one is stable.
ANSWER:
3 Consider the given DTFT pair, CO
1 1
{0.8𝑛 𝑢[𝑛]} ↔
(1 − 0.8𝑒 −𝑗𝜔 )
Compute the following using the properties of DTFT,
a. 𝑥[𝑛] = 0.8𝑛 𝑢[𝑛 − 2]
b. 𝑥[𝑛] = 0.8𝑛 𝑢[𝑛] cos(0.1𝜋𝑛)
c. 𝑥[𝑛] = 𝑛 × 0.8𝑛 𝑢[𝑛]
d. 𝑥[𝑛] = 0.8−𝑛 𝑢[−𝑛]
0.8𝑛 𝑓𝑜𝑟 0 ≤ 𝑛 ≤ 5
e. 𝑥[𝑛] = {
0 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒

ANSWER

[OR]
4 Consider 𝑋 = {1, 𝑗, −1, −𝑗}, 𝐻 = {0, 1, −1, 1} are the DFTs of two sequences 𝑥[𝑛] CO
2
and ℎ[𝑛]. Using the properties of the DFT (do not compute the sequences),
determine the following,
a. 𝐷𝐹𝑇{𝑥[(𝑛 − 1)4 ]}
b. 𝐷𝐹𝑇{(−1)𝑛 𝑥[𝑛]}
c. 𝐷𝐹𝑇{(𝑗 )𝑛 𝑥[𝑛]}
d. 𝐷𝐹𝑇{𝑦[𝑛]}, 𝑤ℎ𝑒𝑟𝑒 𝑦[𝑛] = 𝑥[𝑛] ∗ ℎ[𝑛]
e. 𝐷𝐹𝑇{𝑥[(−𝑛)4 ]}
ANSWER:

5 Consider two sequences, 𝑥(𝑛) = [1,2,2,3], ℎ(𝑛) = [2,3,1,3]. Find 𝑦[𝑛] = 𝑥[𝑛] ∗ CO
2
ℎ[𝑛] through their DFT computation using DIT –FFT algorithm and also verify the
answer using Inverse DIT-FFT algorithm.
[OR]
6 Consider two sequences, 𝑥(𝑛) = [1,2,3,4], ℎ(𝑛) = [1,3,2,1]. Find 𝑦[𝑛] = 𝑥[𝑛] ∗ CO
2
ℎ[𝑛] through their DFT computation using DIF –FFT algorithm and also verify the
answer using Inverse DIF-FFT algorithm.

------------------------------------------------ ALL THE BEST ---------------------------------------------

You might also like