Fundamentals of Digital Signal Processing

AEIE 3104
1. Consider the analog signal, 𝑥(𝑡) = 3 𝑠𝑖𝑛40𝜋𝑡 – 𝑠𝑖𝑛 100𝜋𝑡 + 2 𝑐𝑜𝑠50𝜋𝑡. Determine
the minimum sampling frequency and the sampled version of analog signal at this
frequency. Sketch the waveform and show the sampling points.Comment on the
result.
2. Consider the analog signals 𝑥1 (𝑡) = 4 𝑐𝑜𝑠 2𝜋(30𝑡), 𝑥2 (𝑡) = 4 𝑐𝑜𝑠 2𝜋(5𝑡). Find a
sampling frequency so that 30 𝐻𝑧 signal is an alias of 5 𝐻𝑧 signal.
3. Consider the analog signal 𝑥(𝑡) = 2 𝑠𝑖𝑛 80𝜋𝑡. If the sampling frequency is 60 𝐻𝑧,
find the sampled version of discrete time signal 𝑥(𝑛). Also find an alias frequency
corresponding to 𝐹𝑠 = 60 𝐻𝑧.
4. Determine whether following signals are periodic or not. If periodic find the
fundamental period.
5𝜋𝑛
a. 𝑥(𝑛) = cos ( 9 + 1)
𝑛
b. 𝑥(𝑛) = sin ( 9 − 𝜋)
𝜋
c. 𝑥(𝑛) = sin 8 𝑛2
7𝜋𝑛
d. 𝑥(𝑛) = 𝑒 𝑗 4
3𝜋𝑛
5𝜋𝑛
e. 𝑥(𝑛) = 2 cos 3 + 3𝑒 𝑗 4
5. Determine the even and odd parts of the signals
a. 𝑥(𝑛) = 3𝑛
𝜋
b. 𝑥(𝑛) = 4𝑒 𝑗 5 𝑛
6. Determine whether the following signals are energy or power signals
1 𝑛
a. 𝑥(𝑛) = (4) 𝑢(𝑛)
𝜋
b. 𝑥(𝑛) = sin ( 3 𝑛)
c. 𝑥(𝑛) = 𝑢(𝑛)
7. Determine if the system described by the following input-output equations is linear
or non-linear
1
a. 𝑦(𝑛) = 𝑥(𝑛) + 𝑥(𝑛−1)
b. 𝑦(𝑛) = 𝑥 2 (𝑛)
c. 𝑦(𝑛) = 𝑛𝑥(𝑛)
8. Determine if the following systems are time-invariant or time variant
a. 𝑦(𝑛) = 𝑥(𝑛) + 𝑥(𝑛 − 1)
b. 𝑦(𝑛) = 𝑥(−𝑛)
c. 𝑦(𝑛) = 𝑥(𝑛) − 𝑏 𝑥(𝑛 − 1)
d. 𝑦(𝑛) = 2𝑛𝑥(𝑛)
e. 𝑦(𝑛) = 𝑥(𝑛) + 𝐵
f. 𝑦(𝑛) = 𝑛𝑥 3 (𝑛)
g. 𝑦(𝑛) = ∑𝑀 𝑁
𝐾=0 𝑏𝑘 𝑥(𝑛 − 𝑘) − ∑𝐾=1 𝑎𝑘 𝑦(𝑛 − 𝑘)
9. Represent the sequence 𝑥(𝑛) = {−3, 4, −3, −5,4,6} as sum of shifted unit impulses.
↑
10. Test the stability of the system whose impulse response
1 𝑛
a. ℎ(𝑛) = (2) 𝑢(𝑛)
 Fundamentals of Digital Signal Processing
AEIE 3104
b. ℎ(𝑛) = 4𝑛 𝑢(−𝑛)
c. ℎ(𝑛) = 0.2𝑛 𝑢(−𝑛) + 3𝑛 𝑢(𝑛)
11. Determine the convolution sum of two sequences 𝑥(𝑛) = {3,2,1,2} and ℎ(𝑛) =
{1, 2, 1,2} using
↑
a. Graphical Method
b. Tabular Method
12. Find the convolution signals
2 𝑓𝑜𝑟 𝑛 = −2,0,1
𝑥(𝑛) = {−1 𝑓𝑜𝑟 𝑛 = −1
0 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
ℎ(𝑛) = 𝛿(𝑛 + 1) + 𝛿(𝑛) − 𝛿(𝑛 − 1) + 𝛿(𝑛 − 2)
13. Find the convolution of two finite duration sequences
ℎ(𝑛) = 𝑎𝑛 𝑢(𝑛) 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑛
𝑥(𝑛) = 𝑏 𝑛 𝑢(𝑛) 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑛
i) when 𝑎 ≠ 𝑏
ii) when 𝑎 = 𝑏
14. Compute the convolution of the following sequences
a. 𝑥(𝑛) = ℎ(𝑛) = {1, 2, −1}
↑
b. 𝑥(𝑛) = 𝑢(𝑛 − 1); ℎ(𝑛) = 3𝑛 𝑢(−𝑛 − 1)
1 𝑛
c. 𝑥(𝑛) = 𝑢(𝑛); ℎ(𝑛) = 5 (− 2) 𝑢(𝑛)
15. Determine the range of values of "𝑎" and "𝑏" for the stability of LTI system with
𝑏𝑛 ; 𝑛 < 0
impulse response, ℎ(𝑛) = { 𝑛
𝑎 ;𝑛 ≥ 0
16. Determine the impulse response for the cascade of two LTI systems having impulse
1 𝑛 1 𝑛
responses ℎ1 (𝑛) = (3) 𝑢(𝑛) and ℎ2 (𝑛) = (2) 𝑢(𝑛)
17. Determine the overall impulse response of the interconnected discrete time systems
shown below

18. Determine the overall impulse response of the interconnected discrete time systems
shown below
 Fundamentals of Digital Signal Processing
AEIE 3104

19. Perform cross-correlation of the sequences, 𝑥(𝑛) = {1, 2, 3,4} and 𝑦(𝑛) = {4, 5, 2}.
↑ ↑
20. Determine the autocorrelation sequence for 𝑥(𝑛) = {2, 4, 3,1}.
↑
21. For a given linear combination of sequences 𝑎1 𝑥(𝑛) + 𝑎2 𝑦(𝑛 − 𝑙) where 𝑎1 and 𝑎2
are constant and 𝑙 is time shift deduce the normalized expression for cross
correlation coefficient 𝜌𝑥𝑦 (𝑙).
22. Determine the Z-transform and their ROC of the following discrete time signals
i) 𝑥(𝑛) = 𝑢(𝑛)
ii) 𝑥(𝑛) = 0.3𝑛 𝑢(𝑛) + 0.8𝑛 𝑢(−𝑛 − 1)
iii) 𝑥(𝑛) = cos 𝑛𝜃 𝑢(𝑛)
1 𝑛−1
iv) 𝑥(𝑛) = (3) 𝑢(𝑛 − 1)
v) 𝑥(𝑛) = 𝑛𝑎𝑛 𝑢(𝑛)
1 𝑛 1 𝑛−1
vi) 𝑥(𝑛) = (− 5) 𝑢(𝑛) + 5 (2) 𝑢(−𝑛 − 1)
1 1
vii) 𝑥(𝑛) = 2 𝛿(𝑛) + 𝛿(𝑛 − 1) − 3 𝛿(𝑛 − 2)
1 𝑛
viii) 𝑥(𝑛) = (𝑛 + 0.5) (3) 𝑢(𝑛)
𝑑
23. If 𝑍{𝑥(𝑛)} = 𝑋(𝑧) then prove that 𝑍{𝑛𝑥(𝑛)} = − 𝑧 𝑑𝑧 𝑋(𝑧)
24. If 𝑍{𝑥(𝑛)} = 𝑋(𝑧) then prove that 𝑍{𝑥(𝑛 − 𝑚)}𝑧 −𝑚 𝑋(𝑧)
25. If 𝑍{𝑥(𝑛)} = 𝑋(𝑧) then prove that 𝑍{𝑥(𝑛 + 𝑚)}𝑧 𝑚 𝑋(𝑧)
26. If 𝑋+ (𝑧) = 𝑍{𝑥(𝑛)} then prove that 𝑍{𝑥(𝑛 − 𝑚)} = 𝑧 −𝑚 {𝑋+ (𝑧) + ∑𝑚
𝑘=1 𝑥(−𝑘) 𝑧 }
𝑘

27. If 𝑋+ (𝑧) = 𝑍{𝑥(𝑛)} then prove that 𝑍{𝑥(𝑛 + 𝑚)} = 𝑧 𝑚 {𝑋+ (𝑧) − ∑𝑚−1
𝑘=0 𝑥(𝑘) 𝑧
−𝑘 }

28. If 𝑍{𝑥(𝑛)} = 𝑋(𝑧) then prove that 𝑍{𝑎𝑛 𝑥(𝑛)} = 𝑋(𝑎−1 𝑧)

29. If 𝑍{𝑥(𝑛)} = 𝑋(𝑧) then prove that 𝑍{𝑎𝑛 𝑥(𝑛)} = 𝑋(𝑎−1 𝑧)
30. If 𝑍{𝑥(𝑛)} = 𝑋(𝑧) then prove that 𝑍{𝑥(−𝑛)} = 𝑋(𝑧 −1 )
31. If 𝑍{𝑥(𝑛)} = 𝑋(𝑧) and 𝑍{ℎ(𝑛)} = 𝐻(𝑧) then prove that 𝑍{𝑥(𝑛) ∗ ℎ(𝑛)} = 𝑋(𝑧)𝐻(𝑧)
32. If 𝑍{𝑥(𝑛)} = 𝑋(𝑧) and 𝑍{𝑦(𝑛)} = 𝑌(𝑧) then prove that
∞

𝑍{𝛾𝑥𝑦 (𝑚)} = ∑ 𝑥(𝑛)𝑦(𝑛 − 𝑚)

−∞
33. If 𝑍{𝑥1 (𝑛)} = 𝑋1 (𝑧) and 𝑍{𝑥2 (𝑛)} = 𝑋2 (𝑧), then prove that
 Fundamentals of Digital Signal Processing
AEIE 3104
1 𝑧
𝑍{𝑥1 (𝑛)𝑥2 (𝑛)} = ∮ 𝑋1 (𝑉)𝑋2 ( ) 𝑣 −1 𝑑𝑣
2𝜋𝑗 𝑐 𝑣
34. If 𝑍{𝑥1 (𝑛)} = 𝑋1 (𝑧) and 𝑍{𝑥2 (𝑛)} = 𝑋2 (𝑧), then prove the Parseval’s relation that
∞
1 1
∑ 𝑥1 (𝑛)𝑥2∗ (𝑛) = ∮ 𝑋1 (𝑉)𝑋2∗ ( ∗ ) 𝑧 −1 𝑑𝑧
2𝜋𝑗 𝑐 𝑧
−∞
35. Find the initial value, 𝑥(0) and final value, 𝑥(∞) of the following 𝑧-domain signal
1
a. 𝑋(𝑧) = 1−𝑧 −2
2−4𝑧 −1
b. 𝑋(𝑧) = 1+2𝑧 −1−3𝑧 −2
1−3𝑧 −1
c. 𝑋(𝑧) = 1−3.6𝑧 −1 +1.8𝑧 −2
36. Find the pole-zero plot for the system described by difference equation and discuss
5 1
on stability of the system. 𝑦(𝑛) = 6 𝑦(𝑛 − 1) − 6 𝑦(𝑛 − 2) + 𝑥(𝑛) − 𝑥(𝑛 − 1)
1+3z−1
37. Find the inverse 𝑧-transform of 𝑋(𝑧) = 1+3z−1+2z−2 for ROC |𝑧| > 2.
z(z2 −4z+5)
38. Find the inverse 𝑧-transform of 𝑋(𝑧) = (z−3)(z−1)(z−2) for ROC
a. 2 < |𝑧| < 3
b. |𝑧| > 3
c. |𝑧| < 1
1
39. Determine the causal signal 𝑥(𝑛) having the 𝑧-transform 𝑋(𝑧) = (1−2𝑧 −1 )(1−𝑧 −1)2
z3 +z2
40. Find the inverse 𝑧-transform of 𝑋(𝑧) = (z−1)(z−3) for ROC |𝑧| > 3.
1
41. Using Cauchy integral method find the inverse 𝑧-transform of 𝑋(𝑧) = (z−1)(z−2) for
ROC 1 < |𝑧| < 2.
3+2𝑧 −1 +𝑧 −2
42. Determine the inverse 𝑍-transform of the function, 𝑋(𝑧) = 1−3𝑧 −1 +2𝑧 −2 by the
following three methods and prove that the inverse Z-transform is unique.
a. Residue Method
b. Partial Fraction Expansion Method
c. Power Series Expansion Method (Long division method)
43. IF 𝐷𝐹𝑇{𝑥1 (𝑛)} = X1 (k) and 𝐷𝐹𝑇{𝑥2 (𝑛)} = X2 (k), then prove that 𝐷𝐹𝑇{𝑎1 𝑥1 (𝑛) +
𝑎2 𝑥2 (𝑛)} = 𝑎1 X1 (k) + 𝑎2 X2 (k)
−j2πkm
44. If 𝐷𝐹𝑇{𝑥(𝑛)} = X(k) then prove that 𝐷𝐹𝑇 {𝑥((𝑛 − 𝑚))𝑁 } = X(k)e N .
45. If 𝐷𝐹𝑇{𝑥(𝑛)} = X(k) then prove that 𝐷𝐹𝑇{𝑥(𝑁 − 𝑛)} = X(N − k).
1
46. If 𝐷𝐹𝑇{𝑥(𝑛)} = X(k) then prove that 𝐷𝐹𝑇{𝑥1 (𝑛)𝑥2 (𝑛)} = N [X1 (k) ∗ X2 (k)]
47. If 𝐷𝐹𝑇{𝑥1 (𝑛)} = 𝑋1 (𝑘) and 𝐷𝐹𝑇{𝑥2 (𝑛)} = 𝑋2 (𝑘), then by convolution property,
𝐷𝐹𝑇{𝑥1 (𝑛) ⊛ 𝑥2 (𝑛)} = 𝑋1 (𝑘)𝑋2 (𝑘).
48. If 𝐷𝐹𝑇{𝑥(𝑛)} = X(k) and 𝐷𝐹𝑇{𝑦(𝑛)} = Y(k) then prove that
∞

𝐷𝐹𝑇{𝛾̅𝑥𝑦 (𝑚)} = 𝐷𝐹𝑇 [∑ 𝑥(𝑛)𝑦 ∗ ((𝑛 − 𝑚))𝑁 ] = 𝑋(𝑘)𝑌 ∗ (𝑘)

−∞
49. Find the relation between DFT and Z transform
 Fundamentals of Digital Signal Processing
AEIE 3104
50. Compute 4-point DFT of causal three sample sequence given by
1; 0 ≤ 𝑛 ≤ 2
𝑥(𝑛) = {
0; 𝑒𝑙𝑠𝑒
51. Compute the DFT of the sequence, 𝑥(𝑛) = {0, 1, 2, 1}. Sketch the magnitude and
phase spectrum
52. Compute circular convolution of the following two sequences using DFT. 𝑥1 (𝑛) =
{ 0, 1, 0, 1 } and 𝑥2 (𝑛) = { 1, 2, 1, 2 }
53. Find the IDFT of the sequence 𝑋(𝑘) = {5,0,1 − 𝑗, 0,1,0,1 + 𝑗, 0}
54. Find the circular convolution of two finite duration sequences 𝑥1 (n) = {1,2,3,4} and
𝑥2 (n) = {1, −1, −2,2} using
a. Concentric circle method
b. DFT-IDFT method
c. Matrix method
55. Compute linear convolution of the following two sequence using DFT
𝑥(𝑛) = {1,2,3} and ℎ(𝑛) = {2,5}
56. Find the output 𝑦(𝑛) of a filter whose impulse response is ℎ(𝑛) = {1,1,1} and input
signal 𝑥(𝑛) = {3, −1,0,1,3,2,0,1,2,1} using overlap-save method and overlap-add
method.
57. Compute DFT of a sequence (−1)𝑛 for 𝑁 = 4.
58. For the 𝑥1 (𝑛), 𝑥2 (𝑛) and 𝑁 given compute 𝑥1 (𝑛) ⊛ 𝑥2 (𝑛)
𝑥1 (𝑛) = 𝛿(𝑛) + 𝛿(𝑛 − 1) − 𝛿(𝑛 − 2) − 𝛿(𝑛 − 3);
𝑥2 (𝑛) = 𝛿𝑛 − 𝛿𝑛 − 2 + δ𝑛 − 4;
𝑁=5
59. If 𝑥(𝑛) is an even length sequence with an 𝑁 −point DFT 𝑋(𝑘), then determine the
𝑁 −point DFT of the following in terms of 𝑋(𝑘).
𝑁
a. 𝑦(𝑛) = 𝑥(𝑛) − 𝑥 (𝑛 − 2 )
𝑁
b. 𝑦1 (𝑛) = 𝑥(𝑛) + 𝑥 (𝑛 − 2 )
60. If 𝑥(𝑛) denotes a finite length sequence of length 𝑁, show that 𝑥((−𝑛))𝑁 =
𝑥((𝑁 − 𝑛))𝑁
61. Find the DFT of a sequence 𝑥(𝑛) = {1,2,3,4,4,3,2,1} using (i) DIT algorithm and (ii)
DIF algorithm
62. Find the DFT of a sequence 𝑥(𝑛) = {2,1,2,1} using (i) DIT algorithm and (ii) DIF
algorithm.
63. Compare DIT and DIF algorithm. Define Twiddle factor.