Professional Documents
Culture Documents
Week2 3 Lecture4 6and7 9 220307051227
Week2 3 Lecture4 6and7 9 220307051227
• Signals
• Classification of Signals
• Other Classifications
– even / odd signals,
– One-dimensional / Multi-dimensional
1 𝑡≥0
𝑢 𝑡 =
0 𝑡<0
• Observe that
𝑡
1 𝑡≥0
𝛿 𝜏 𝑑𝜏 = = 𝑢(𝑡)
−∞ 0 𝑡<0
• Which also results into
𝑑𝑢
= 𝛿(𝑡)
𝑑𝑡
308201- Communication Systems 18
Sinusoids
• Therefore, x, x = x 2
• The length of the component of g along x is g cos 𝜃, but it is also
c𝑥.
c 𝑥 = g cos 𝜃
• Multiplying both sides by 𝑥
c𝑥 2
= g x cos 𝜃 = g, x
g, x g. x
c= =
x, x x2
• When g, x = 0, we say that g and x are orthogonal to each other
𝜋
i.e., geometrically, 𝜃 =
2
308201- Communication Systems 22
Signals as vectors
t1 t1
dEe
• Minimizing error energy would mean putting dc
0
• Which would eventually give
t2
g (t ) x(t )dt 1 2
t
Ex t1
c
t1
t2
g (t ) x(t )dt
(t )dt
2
x
t1
𝐠(𝐭) ~ 𝐜 𝐬𝐢𝐧 𝐭
Objective: Select c so that the energy of the error signal is minimum. As we already know that
this condition holds for
1 t2
c= g t x t dt
Ex t1
Let, x(t) = sin t
2π
So, Ex = 0
sin2 t dt = π
t2 π 2𝜋
1 1 1 4
c= g t sin 𝑡 dt = sin 𝑡 dt + − sin 𝑡 dt =
𝜋 t1 𝜋 0 𝜋 π 𝜋
4
Therefor, g(t) ~ sin t
𝜋
308201- Communication Systems 25
Energy of orthogonal signals
𝑧 2 = 𝑥 2+ 𝑦 2 (Pythagorean Theorem)
• If signals 𝑥(𝑡) and 𝑦(𝑡) are orthogonal and if 𝑧(𝑡) = 𝑥(𝑡) + 𝑦(𝑡) then
𝐸𝑧 = 𝐸𝑥 + 𝐸𝑦
• Proof?
≅ 𝑐𝑛 𝑥𝑛 (𝑡)
𝑛=1
• If the approximation error is zero for any 𝑔(𝑡) then the set of signals
𝑥1 𝑡 , 𝑥2 𝑡 , … , 𝑥𝑁 (𝑡) is complete. In general, the set is complete when 𝑁 → ∞.
𝑔 𝑡 = 𝑐𝑛 𝑥𝑛 (𝑡)
𝑛=1
𝐸𝑔 = 𝑐1 2 𝐸1 + 𝑐2 2 𝐸2 + ⋯
∞
= 𝑐𝑛 2 𝐸𝑛
𝑛=1
• In vector space, the square of the length of vector is equal to the
sum of the squares of the lengths of its orthogonal components.
– Parseval’s theorem is the statement of this fact when applied to
signals.
0 𝑚≠𝑛
cos 𝑛𝑤0 𝑡 cos 𝑚𝑤0 𝑡 𝑑𝑡 = 𝑇0
𝑇0 𝑚=𝑛≠0
2
0 𝑚≠𝑛
sin 𝑛𝑤0 𝑡 sin 𝑚𝑤0 𝑡 𝑑𝑡 = 𝑇0
𝑇0 𝑚=𝑛≠0
2
𝑇
sin 𝑛𝑤0 𝑡 cos 𝑚𝑤0 𝑡 𝑑𝑡 = 0 for all 𝑚 and 𝑛
0
• 𝑇0
means integral over an interval from 𝑡 = 𝑡1 to 𝑡 = 𝑡1 + 𝑇0 for
any value of 𝑡1 .
308201- Communication Systems 37
Trigonometric Fourier series
𝑔 𝑡 , cos 𝑛𝑤0 𝑡
𝑎𝑛 =
cos 𝑛𝑤0 𝑡 , cos 𝑛𝑤0 𝑡
𝑔 𝑡 , sin 𝑛𝑤0 𝑡
𝑏𝑛 =
sin 𝑛𝑤0 𝑡 , sin 𝑛𝑤0 𝑡
• Therefore
𝑡1 +𝑇0
𝑡1
𝑔 𝑡 cos 𝑛𝑤0 𝑡 𝑑𝑡
𝑎𝑛 = 𝑡1 +𝑇0
cos 2 𝑛𝑤 𝑡𝑑𝑡
𝑡1 0
As
𝑡1 +𝑇0 𝑡1 +𝑇0
𝑡1
cos 2 𝑛𝑤 𝑡𝑑𝑡
0 = 𝑇0 2 and 𝑡1
sin2 𝑛𝑤 𝑡𝑑𝑡
0 = 𝑇0 2
We get
𝑡1 +𝑇0
1
𝑎0 = 𝑔(𝑡)𝑑𝑡
𝑇0 𝑡1
𝑡1 +𝑇0
2
𝑎𝑛 = 𝑔(𝑡) cos 𝑛𝑤0 𝑡 𝑑𝑡 𝑛 = 1,2,3
𝑇0 𝑡1
𝑡1 +𝑇0
2
𝑏𝑛 = 𝑔(𝑡) sin 𝑛𝑤0 𝑡 𝑑𝑡 𝑛 = 1,2,3
𝑇0 𝑡1
308201- Communication Systems 39
Exponential Fourier Series
𝑔 𝑡 = 𝐷𝑛 𝑒 𝑗𝑛𝑤0 𝑡
𝑛=−∞
• Where
1
𝐷𝑛 = 𝑔(𝑡)𝑒 −𝑗𝑛𝑤0 𝑡 𝑑𝑡
𝑇0 𝑇0
𝑃𝑔 = 𝐷𝑛 2
𝑛=−∞