Scribd
Upload
37 views

EE5130: Digital Signal Processing

This document contains the answer key for Tutorial 2 of the digital signal processing course EE5130. It provides answers to 20 problems, covering topics such as signal properties, Fourier analysis, linear time-invariant systems, convolution, and discrete-time signals and systems. Key concepts addressed include signal periodicity, system characteristics, convolution sums, and filtering operations.

Uploaded by

SHUBHAM ANAND VERMA EE20M540
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
37 views

EE5130: Digital Signal Processing

This document contains the answer key for Tutorial 2 of the digital signal processing course EE5130. It provides answers to 20 problems, covering topics such as signal properties, Fourier analysis, linear time-invariant systems, convolution, and discrete-time signals and systems. Key concepts addressed include signal periodicity, system characteristics, convolution sums, and filtering operations.

Uploaded by

SHUBHAM ANAND VERMA EE20M540
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

EE5130: Digital Signal Processing

Tutorial 2 Answer Key

1. (a) sin(0.4πn − θ ± π ), (b) cos(0.3πn + θ ) (c) cos(0.9549πn − θ ), (d) sin(0.3πn − θ )


2. (a) ω1 = 0, (b) ω1 = π, (c) ω1 = π, (d) ω1 = 0.8π (phase changes sign), (e) ω1 =
0.9549π (phase changes sign), (f) ω1 = 0.8π (phase changes sign)
3. θ = ω0 N ± 2πk
4. 0
5. • ω ∈ [−π, π ]
(a) ω = 0.2π, θ, (b) ω = 0, 0, (c) ω = −1.95, 0, (d) ω = −0.7π, 0.
• ω ∈ [0, 2π )
(a) and (b) are same as before, (c) ω = 2π − 1.95, 0, (d) ω = 1.3π, 0.
6. (a) 1, (b) 20, (c) 10, (d) 5, (e) 20, (f) 2, (g) 20, (h) 5, (i) not periodic.
7. 0.16π, 0.24π.
8. (a) N = 11 for k = 1 to 5, (b) the (k, N ) pairs for k = 1 to 6 are (1, 12), (2, 6), (3, 4),
(4, 3), (5, 12), (6, 2). If k = 0, the signal is DC whose period is 1.
9. (i) non-memoryless, time-variant, linear, non-causal, stable; (ii) non-memoryless, time-
variant, linear, non-causal, stable; (v) non-memoryless, time-variant, linear, non-causal,
stable.
10. (a) non-linear, time-invariant, (b) linear, time-variant, (c) incrementally linear time-
variant.
11. (a) linear, causal, time-invariant (b) non-linear, time-variant, causal, (c) non-linear, time-
variant, causal, (d) non-linear, time-invariant, causal, (e) incrementally linear, time-
variant, causal, (f) non-linear, time-invariant, causal, (g) non-linear, time-invariant,
causal, (h) non-linear, time-invariant, non-causal, (i) non-linear, time-invariant, causal.
1 1
12. a − n −1 u [ n ] + −1 bn+1 u[−n − 1]
a −1−b a −b
13. Proof.
14. (a) (n + 1) u[n], (b) does not exist.
15. (a) φxw [k ] = x [k ] ∗ w[−k ], (b) φxw [k ] = φwx [−k ]), φxx [k ] = φxx [−k ], (c) shifted triangle,
triangle centred at k = 0.
16. (a) y[n] = 0.8n u[n], (b) When x [n] = 0.5 u[n], output is same as 0.5 u[n] ∗ 0.8n u[n].

EE5130 DSP Page 1 of 2 CSR


17.  
x [0] x [−1] x [−2] ... x [− N + 2] x [− N + 1]
 x [1] x [0] x [−1] ... x [− N + 3] x [− N + 2]
 x [2] x [1] x [0] ... x [− N + 4] x [− N + 3]
 
X=
 . . . ... . . 

 . . . ... . . 
x [ N − 1] x [ N − 2] x [ N − 3] ... x [1] x [0]
T
y = [y[0] y[1] y[2] ... y[ N − 1]]

T
h = [h[0] h[1] h[2] ... h[ N − 1]]
↓
18. h = {1, 1, 2}
↓ ↓ ↓
19. {1, 3, 1} ∗ {1, 2, 2} = {1, 5, 9, 8, 2}. 131 × 122 = 15982.
20. 
 0 if n < 0,
2 − 2 −n if 0 ≤ n ≤ 9,
y[n] =
 2−n (210 − 1) if n ≥ 10

EE5130 DSP Page 2 of 2 CSR

You might also like