Professional Documents
Culture Documents
x(t) = sin(t) +
0.2cos(2t) +
0.1sin(5t)
In general:
∞
𝑥 𝑡 = 𝑎𝑘 𝑒 𝑗𝑘𝑤0 𝑡
𝑘=−∞
𝛼1 𝛼2
𝑘 = −2 ⇒ 𝑎−2 = − 𝑘=1 ⇒ 𝑎1 =
2𝑗 2
𝛼2 𝛼1
𝑘 = −1 ⇒ 𝑎−1 = 𝑘=2 ⇒ 𝑎2 =
2 2𝑗
𝑥 𝑡 = 𝑎𝑘 𝑒 𝑗𝑘𝜔0𝑡
𝑘=−∞
1 𝑗𝜔0 𝑡 −𝑗𝜔0 𝑡
𝑥 𝑡 = 1 + cos 𝑤0 𝑡 = 1 + 2 (𝑒 +𝑒 )
1 1
𝑎0 = 1 𝑎1 = 2 𝑎−1 = 2
𝑎𝑘 = 0 for 𝑘 ≠ ∓1,0
𝑥 𝑡 = 1 + cos 𝑤0 𝑡 + sin(𝑤0 𝑡)
1 𝑗𝑤0 𝑡 −𝑗𝑤0 𝑡 1 𝑗𝑤0 𝑡 −𝑗𝑤0 𝑡
=1+ 𝑒 +𝑒 + (𝑒 −𝑒 )
2 2𝑗
1
1 𝑗𝑤0 𝑡 1 −𝑗𝑤0 𝑡 (𝑗 = −𝑗)
=1+ 1−𝑗 𝑒 + (1 + 𝑗)𝑒
2 2
1 1
𝑎0 = 1 𝑎1 = (1 − 𝑗) 𝑎−1 = (1 + 𝑗)
2 2
1 𝑇 −𝑗𝑘𝑤0 𝑡
=> 𝑎𝑘 = 𝑥 𝑡 𝑒 𝑑𝑡
𝑇 0
i.e. the output signal is the same as the input signal, multiplied by the
constant “gain” lk (which may be complex)
= 𝑒 𝑠𝑡 ℎ 𝜏 𝑒 −𝑠𝜏 𝑑𝜏 = 𝑧𝑛 ℎ 𝑘 𝑧 −𝑘
−∞ 𝐻 𝑠 𝑘=−∞ 𝐻 𝑧
e𝑠𝑘𝑡 Eigenfunctions.
𝐻(𝑠𝑘 ) Eigenvalues
k
T T
dt
jn0t j ( k n )0 t T is the fundamental
x(t )e a e dt
0 0
k period of x(t)
T
ak e j ( k n )0t dt
0
k
Therefore
T
an 1
T 0 x(t )e jn0t dt
e
2T1 jk0t jk0t T1
a0 1dt
1 ak 1
T dt 1
jk0T e
T T1
T1
T T1
2 e jk0T1 e jk0T1
k0T 2j these
coefficients
2 sin(k0T1 ) / k0T
are real
April 14
sin(k T ) / k
F. Y. Vural & S. Kalkan0- CEng
1 384 16
Example 3: Periodic Step Signal
For this example, instead of plotting both the magnitude and
METU Computer Engineering
T=4T1
T=8T1
T=16T1
Error of approximation:
Approx. to 𝑥(𝑡): 𝑥𝑁 𝑡 = 𝑁
𝑎
𝑘=−𝑁 𝑘 𝑒 𝑗𝑘𝑤0 𝑡
𝑒𝑁 𝑡 = 𝑥 𝑡 − 𝑥𝑁 (𝑡)
𝐸𝑁 = 𝑇 𝑒𝑁 𝑡 2 𝑑𝑡
The coefficients that minimize 𝐸𝑁 are given by:
1 𝑇 −𝑗𝑘𝑤0 𝑡
𝑎𝑘 = 𝑇 0
𝑥 𝑡 𝑒 𝑑𝑡
If N ↑, then 𝐸𝑁 ↓ (if 𝑥(𝑡) has a Fourier S. Repr.)
𝑥𝑁 𝑡 = 𝑁 𝑎
𝑘=−𝑁 𝑘 𝑒 𝑗𝑘𝑤0 𝑡
1 𝑇 −𝑗𝑘𝑤0 𝑡
𝑎𝑘 = 𝑇 0
𝑥 𝑡 𝑒 𝑑𝑡
Problems in convergence:
𝑎𝑘 may not be bounded.
Even if 𝑎𝑘 are bounded, their combination might not be
bounded.
Luckily, every continuous periodic signal has a
Fourier series representation.
i.e., when 𝑁 → ∞ , 𝐸𝑁 → 0.
This is also true for many discontinuous signals.
April 14 F. Y. Vural & S.20/16
Kalkan - CEng 384
Convergence of Fourier Series
Not every periodic signal can be represented as an
METU Computer Engineering
T
x(t ) dt
Condition 2.
Example:
Condition 3.
Example:
At a discontinuity,
there is ripple whose
magnitude does not
change no matter what N
becomes.
The width of the ripple
shrinks with N.
Linearity:
Given two signals 𝑥(𝑡) and 𝑦(𝑡) with:
ℱ𝒮
𝑥 𝑡 𝑎𝑘
ℱ𝒮
y 𝑡 𝑏𝑘
The linear combination of the signals:
ℱ𝒮
𝑧 𝑡 = 𝐴𝑥 𝑡 + 𝐵𝑦 𝑡 𝑐𝑘
where 𝑐𝑘 = 𝐴𝑎𝑘 +𝐵𝑏𝑘
Time-Shifting:
ℱ𝒮
𝑥 𝑡 − 𝑡0 𝑒 −𝑗𝑘𝑤0 𝑡0 𝑎𝑘
Time Reversal:
What happens to the coefficients when we reverse time?
i.e., what is the relation bw the coefficients of 𝑥(−𝑡) and
𝑥(𝑡)?
∞ −𝑗𝑘𝑤0 𝑡 = ∞ 𝑗𝑚𝑤0 𝑡
𝑥 −𝑡 = 𝑘=−∞ 𝑎𝑘 𝑒 𝑚=−∞ 𝑎−𝑚 𝑒
ℱ𝒮 ℱ𝒮
𝑥 𝑡 𝑎𝑘 𝑥 −𝑡 𝑎−𝑘
In fact:
If x(t) is even: 𝑎−𝑘 = 𝑎𝑘
If x(t) is odd: 𝑎−𝑘 = −𝑎𝑘
April 14 F. Y. Vural & S. Kalkan - CEng 384 27
Properties of CT Fourier Series
METU Computer Engineering
Time Scaling:
What happens to the coefficients when we scale time?
i.e., what is the relation bw the coefficients of 𝑥(𝛼𝑡) and
𝑥(𝑡)?
∞
𝑥 𝛼𝑡 = 𝑎𝑘 𝑒 𝑗𝑘(𝛼𝑤0)𝑡
𝑘=−∞
Multiplication:
Given two signals 𝑥(𝑡) and 𝑦(𝑡) with:
ℱ𝒮
𝑥 𝑡 𝑎𝑘
ℱ𝒮
𝑦 𝑡 𝑏𝑘
Derivative
Given two signals 𝑥(𝑡) with:
ℱ𝒮
𝑥 𝑡 𝑎𝑘
Then:
𝑑𝑥 𝑡 ℱ𝒮
𝑗𝑘𝜔0 𝑎𝑘
𝑑𝑡
∞
1 2 𝑑𝑡 2
𝑥 𝑡 = 𝑎𝑘
𝑇 𝑇 𝑘=−∞
𝑥 𝑛 = 𝑎1 𝜙1 𝑛 + ⋯ +𝑎𝑁 𝜙𝑁 [𝑛]
Fourier coefficients
Spectral coefficients
Synthesis equation:
𝑥𝑛 = 𝑎𝑘 𝑒 𝑗𝑘𝑤0𝑛
𝑘=<𝑁>
Analysis equation:
1 2𝜋
−𝑗𝑘( )𝑛
𝑎𝑘 = 𝑥[𝑛]𝑒 𝑁
𝑁
𝑛=<𝑁>
Linearity:
Given two DT signals 𝑥[𝑛] and 𝑦[𝑛] with:
ℱ𝒮
𝑥[𝑛] 𝑎𝑘
ℱ𝒮
𝑦[n] 𝑏𝑘
The linear combination of the signals:
ℱ𝒮
𝑧[𝑛] = 𝐴𝑥[𝑛] + 𝐵𝑦[𝑛] 𝑐𝑘
where 𝑐𝑘 = 𝐴𝑎𝑘 +𝐵𝑏𝑘
Time-Shifting:
ℱ𝒮
𝑥[𝑛 − 𝑛0 ] 𝑒 −𝑗𝑘𝑤0 𝑛0 𝑎𝑘
Multiplication:
Given two DT signals 𝑥[𝑛] and 𝑦[𝑛] with:
ℱ𝒮
𝑥[𝑛] 𝑎𝑘
ℱ𝒮
𝑦[n] 𝑏𝑘
First Difference:
Given a DT 𝑥[𝑛] with:
ℱ𝒮
𝑥[𝑛] 𝑎𝑘
1 2 2
𝑥𝑛 = 𝑎𝑘
𝑁
𝑛=<𝑁> 𝑛=<𝑁>