Fourier Analysis by HOA
Fourier Analysis by HOA
By H. Ali (HOA)
FOURIER SERIES
A Fourier series is an expansion of a periodic function f(x) in terms of an infinite sum of sines and cosines. Fourier
Series makes use of the orthogonality relationships of the sine and cosine functions.
The formula of Fourier series is given as:
∞
Now, from the formula of Fourier series, it is clear that, in order to find the series, we need to first know the values
of 𝑎0 , 𝑎𝑛 and 𝑏𝑛 . So, let’s find their values.
For an:
For bn:
For a0:
Fourier Series:
∞
−1 ; −𝜋 < 𝑡 < 0
Example 22: If 𝑓(𝑡) = { & 𝑓(𝑡) is periodic over –π to π, find the Fourier series of 𝑓(𝑡).
+1 ; 0 < 𝑡 < 𝜋
1
= [[𝑡]0−𝜋 + [𝑡]𝜋0 ]
2𝜋
1
= (−𝜋 + 𝜋)
2𝜋
=0
1 sin 𝑛𝑡 0 sin 𝑛𝑡 𝜋
= [− [ ] +[ ] ]
𝜋 𝑛 −𝜋 𝑛 0
1
= ×0
𝜋
=0
Lastly, from Euler’s Formula,
1 𝜋
𝑏𝑛 = ∫ 𝑓(𝑡) sin 𝑛𝑡 𝑑𝑡
𝜋 −𝜋
1 0 𝜋
= [∫ (−1) sin 𝑛𝑡 𝑑𝑡 + ∫ (1) sin 𝑛𝑡 𝑑𝑡]
𝜋 −𝜋 0
1 cos 𝑛𝑡 0 cos 𝑛𝑡 𝜋
= [[ ] +[ ] ]
𝜋 𝑛 −𝜋 𝑛 0
1 1 cos 𝑛𝜋 cos 𝑛𝜋 1
= [ − − + ]
𝜋 𝑛 𝑛 𝑛 𝑛
2
= (1 − cos 𝑛𝜋)
𝑛𝜋
2
= [1 − (−1)𝑛 ]
𝑛𝜋
Note: If a Fourier series contains only sin θ or cos θ, then the series is called “Half Range Fourier Series.”
We can understand it clearly seeing the chart below:
Example 23: If 𝑓(𝑡) = 𝑡 − 𝑡 2 ; & 𝑓(𝑡) is periodic over –π to π, find the Fourier series of 𝑓(𝑡).
1 𝜋2 𝜋2 𝜋3 𝜋3
= [ − − − ]
2𝜋 2 2 3 3
𝜋2
=−
3
∫(𝑡 − 𝑡 2 ) cos 𝑛𝑡 𝑑𝑡
∫(𝑡 − 𝑡 2 ) sin 𝑛𝑡 𝑑𝑡
cos 𝑛𝑡 cos 𝑛𝑡
= (𝑡 − 𝑡 2 ) (− ) − ∫ [(1 − 2𝑡) (− )] 𝑑𝑡
𝑛 𝑛
cos 𝑛𝑡 1
= (𝑡 − 𝑡 2 ) (− ) + [(1 − 2𝑡) ∫ cos 𝑛𝑡 𝑑𝑡 − ∫ {(−2) ∫ cos 𝑛𝑡 𝑑𝑡} 𝑑𝑡]
𝑛 𝑛
cos 𝑛𝑡 1 sin 𝑛𝑡 sin 𝑛𝑡
= (𝑡 − 𝑡 2 ) (− ) + [(1 − 2𝑡) ( ) − ∫ {(−2) ( )} 𝑑𝑡]
𝑛 𝑛 𝑛 𝑛
cos 𝑛𝑡 1 sin 𝑛𝑡 2𝑡 sin 𝑛𝑡 2 cos 𝑛𝑡
= (𝑡 − 𝑡 2 ) (− )+ [ − + ]
𝑛 𝑛 𝑛 𝑛 𝑛2
𝑡 cos 𝑛𝑡 𝑡 2 cos 𝑛𝑡 sin 𝑛𝑡 2𝑡 sin 𝑛𝑡 2 cos 𝑛𝑡
=− + + − +
𝑛 𝑛 𝑛2 𝑛2 𝑛3
From equation (ii),
𝜋
1 𝑡 cos 𝑛𝑡 𝑡 2 cos 𝑛𝑡 sin 𝑛𝑡 2𝑡 sin 𝑛𝑡 2 cos 𝑛𝑡
𝑏𝑛 = [− + + − + ]
𝜋 𝑛 𝑛 𝑛2 𝑛2 𝑛3 −𝜋
Practice Problems
0 ; −𝜋 ≤ 𝑥 < 0 1
1. If 𝑓(𝑥) = { , find the Fourier series of 𝑓(𝑥) and hence evaluate ∑∞
𝑛=1 .
𝑥 ; 0≤𝑥<𝜋 𝑛2
−1 ; −𝜋 ≤ 𝑥 < 0 𝜋 1 1
2. If 𝑓(𝑥) = { ; find the Fourier series of 𝑓(𝑥) and hence deduce =1−3+5−
+1 ; 0 ≤ 𝑥 ≤ 𝜋 4
1 1
+ − ⋯……………
7 9
𝜋2 cos 2𝑛𝑥
4. If 0 < 𝑥 < 𝜋, show that 𝑥(𝜋 − 𝑥) = − ∑∞
𝑛=1 ( )
6 𝑛2
2 − 𝑥, 0 < 𝑥 < 4
6. Expand 𝑓(𝑥) = { in a Fourier series of period 8.
𝑥 − 6, 4 < 𝑥 < 8
7. If 𝑓(𝑥) = 𝑥 2 & 𝑓(𝑥) is periodic over 2π, find the Fourier series of 𝑓(𝑥) and hence evaluate
1
∑∞𝑛=1 2.
(2𝑛−1)
0 ; −𝜋 ≤ 𝑥 < 0
8. If 𝑓(𝑥) = { & 𝑓(𝑥) is periodic over 2π, find the Fourier series of 𝑓(𝑥).
sin 𝑥 ; 0 ≤ 𝑥 ≤ 𝜋
−𝑥 ; −𝜋 ≤ 𝑥 < 0
9. If 𝑓(𝑥) = { ; find the Fourier series of 𝑓(𝑥).
+𝑥 ; 0 ≤ 𝑥 ≤ 𝜋
10. Sketch 3 cycles of the function represented by:
1
0 ; −1 ≤ 𝑡 ≤ − 2
1 1
𝑓(𝑡) = cos 3𝜋𝑡 ; − 2 ≤ 𝑡 ≤ 2 and 𝑓(𝑡) = 𝑓(𝑡 + 2)
1
0 ; 2≤𝑡≤1
{
Find the Fourier Series of the above function (up to 5 terms at least).
11. Find the constant term 𝑎0 in the Fourier series corresponding to 𝑓(𝑥) = 𝑥 − 𝑥 3 in (−𝜋, 𝜋). And
what kind of function is it? Draw a graph.
+𝜋 +𝜋
12. Using ∫−𝜋 sin 𝑛𝑥 𝑑𝑥 = 0 and ∫−𝜋 cos 𝑛𝑥 𝑑𝑥 = 0, where 𝑚, 𝑛 𝜖 ℤ. Prove the following identities:
2𝜋 𝑖𝑓 𝑛 = 𝑚 = 0
𝜋
a) ∫−𝜋cos 𝑛𝑥 cos 𝑚𝑥 𝑑𝑥 = { 𝜋 𝑖𝑓 𝑛 = 𝑚 ≠ 0
0 𝑖𝑓 𝑛 ≠ 𝑚
𝜋 𝑖𝑓 𝑛 = 𝑚 = 0
𝜋 𝜋
b) ∫0 cos 𝑛𝑥 cos 𝑚𝑥 𝑑𝑥 = {2 𝑖𝑓 𝑛 = 𝑚 ≠ 0
0 𝑖𝑓 𝑛 ≠ 𝑚
𝜋 𝜋 𝑖𝑓 𝑛 = 𝑚
c) ∫−𝜋 sin 𝑛𝑥 sin 𝑚𝑥 𝑑𝑥={
0 𝑖𝑓 𝑛 ≠ 𝑚
𝜋
𝜋 𝑖𝑓 𝑛 = 𝑚
d) ∫0 sin 𝑛𝑥 sin 𝑚𝑥 𝑑𝑥 = {2
0 𝑖𝑓 𝑛 ≠ 𝑚
𝜋
e) ∫−𝜋 sin 𝑛𝑥 cos 𝑚𝑥 𝑑𝑥 = 0
13. Draw sketches and determine the Fourier Series for the following functions:
𝑥
a) 𝑠(𝑥) = 𝜋 , 𝑓𝑜𝑟 − 𝜋 < 𝑥 < 𝜋
b) 𝑠(𝑥) = 3|sin 𝑥|, 𝑓𝑜𝑟 0 ≤ 𝑥 ≤ 2𝜋
2 sin 𝑥 𝑓𝑜𝑟 0 ≤ 𝑥 < 𝜋
c) 𝑠(𝑥) = {
0 𝑓𝑜𝑟 𝜋 ≤ 𝑥 ≤ 2𝜋
1 𝑓𝑜𝑟 0 ≤ 𝑥 ≤ 𝜋
d) 𝑠(𝑥) = {
0 𝑓𝑜𝑟 𝜋 ≤ 𝑥 ≤ 2𝜋
𝐴𝑥
e) 𝑠(𝑥) = 𝐴 − 𝑓𝑜𝑟 0 ≤ 𝑥 < 𝑃
𝑃
COMPLEX FORM OF FOURIER SERIES
From MAT215 we know that,
𝑒 𝑖𝜃 = cos 𝜃 + 𝑖 sin 𝜃 … … … … (𝑖)
𝑒 −𝑖𝜃 = cos 𝜃 − 𝑖 sin 𝜃 … … … … (𝑖𝑖)
Adding equation (i) and (ii),
𝑒 𝑖𝜃 + 𝑒 −𝑖𝜃 = cos 𝜃 + 𝑖 sin 𝜃 + cos 𝜃 − 𝑖 sin 𝜃
𝑒 𝑖𝜃 + 𝑒 −𝑖𝜃 = 2 cos 𝜃
𝑒 𝑖𝜃 + 𝑒 −𝑖𝜃
∴ cos 𝜃 =
2
Subtracting equation (i) and (ii),
𝑒 𝑖𝜃 − 𝑒 −𝑖𝜃 = cos 𝜃 + 𝑖 sin 𝜃 − cos 𝜃 + 𝑖 sin 𝜃
𝑒 𝑖𝜃 + 𝑒 −𝑖𝜃 = 2𝑖 sin 𝜃
𝑒 𝑖𝜃 + 𝑒 −𝑖𝜃
∴ sin 𝜃 =
2𝑖
−𝑖(𝑒 𝑖𝜃 + 𝑒 −𝑖𝜃 )
=
2
𝑖𝑒 −𝑖𝜃 − 𝑖𝑒 𝑖𝜃
∴ sin 𝜃 =
2
Now, from the Fourier Series,
∞
= ∑ 𝑐𝑛 𝑒 𝑖𝑛𝑡
𝑛=−∞
∞
𝑓(𝑡) = ∑ 𝑐𝑛 𝑒 𝑖𝑛𝑡
𝑛=−∞
So, in summary, the necessary formulae for Complex Form of Fourier series are:
Fourier Series:
∞
𝑓(𝑡) = ∑ 𝑐𝑛 𝑒 𝑖𝑛𝑡
𝑛=−∞
The complex form of Fourier series is algebraically simpler and more symmetric. This is why, in Engineering
Mathematics, the complex form of Fourier Series is most commonly used.
We will understand it even more clearly after completing the Parseval’s Theorem.
−1 ; −𝜋 < 𝑡 < 0
Example 24: If (𝑡) = { & 𝑓(𝑡) is periodic over 2π, find the Fourier series of 𝑓(𝑡) using the
+1 ; 0 < 𝑡 < 𝜋
complex form.
𝑓(𝑡) = ∑ 𝑐𝑛 𝑒 𝑖𝑛𝑡
𝑛=−∞
From Euler’s Formula,
𝜋
1
𝑐𝑛 = ∫ 𝑓(𝑡) ∙ 𝑒 −𝑖𝑛𝑡 𝑑𝑡
2𝜋
−𝜋
0 𝜋
1
= [ ∫(−1)𝑒 −𝑖𝑛𝑡 𝑑𝑡 + ∫ 1 ∙ 𝑒 −𝑖𝑛𝑡 𝑑𝑡]
2𝜋
−𝜋 0
−𝑖𝑛𝑡 0 𝜋
1 𝑒 𝑒 −𝑖𝑛𝑡
= (− [ ] +[ ] )
2𝜋 −𝑖𝑛 −𝜋 −𝑖𝑛 0
1 1 𝑒 𝑖𝑛𝜋 𝑒 −𝑖𝑛𝜋 1
= {( − )−( − )}
2𝜋 𝑖𝑛 𝑖𝑛 𝑖𝑛 𝑖𝑛
1
= (1 − 𝑒 𝑖𝑛𝜋 − 𝑒 −𝑖𝑛𝜋 + 1)
2𝑖𝑛𝜋
1
= {2 − (𝑒 𝑖𝑛𝜋 + 𝑒 −𝑖𝑛𝜋 )}
2𝑖𝑛𝜋
1
= (2 − 2 cos 𝑛𝜋)
2𝑖𝑛𝜋
1
= (1 − cos 𝑛𝜋)
𝑖𝑛𝜋
𝑖
=− {1 − (−1)𝑛 }
𝑛𝜋
𝑓(𝑡) = ∑ 𝑐𝑛 𝑒 𝑖𝑛𝑡
𝑛=−∞
∞
𝑖
= ∑ − {1 − (−1)𝑛 }𝑒 𝑖𝑛𝑡
𝑛𝜋
𝑛=−∞
∞
𝑖
= ∑ {(−1)𝑛 − 1}𝑒 𝑖𝑛𝑡
𝑛𝜋
𝑛=−∞
(Ans.)
Practice Problem
1. If 𝑓(𝑡) = 𝑡 − 𝑡 2 ; & 𝑓(𝑡) is periodic over 2π, find the Fourier series of 𝑓(𝑡) using the complex form.
PARSEVAL’S IDENTITY
We know, the Fourier series dealing with real numbers is given as:
∞
The Parseval’s theorem deals with the square of the Fourier series, i.e., {𝑓(𝑡)}2. It is like the Pythagoras
Theorem for Fourier series.
Before we know about the Parseval’s identity, it is important to recall some of the basic integral concepts.
𝜋 0 𝑤ℎ𝑒𝑛, 𝑚 ≠ 𝑛
1. ∫−𝜋 sin 𝑛𝑥 ∙ sin 𝑚𝑥 𝑑𝑥 = {
𝜋 𝑤ℎ𝑒𝑛, 𝑚 = 𝑛
𝜋 0 𝑤ℎ𝑒𝑛, 𝑚 ≠ 𝑛
2. ∫−𝜋cos 𝑛𝑥 ∙ cos 𝑚𝑥 𝑑𝑥 = {
𝜋 𝑤ℎ𝑒𝑛, 𝑚 = 𝑛
𝜋
3. ∫−𝜋 sin 𝑛𝑥 ∙ cos 𝑚𝑥 𝑑𝑥 = 0
= ∫ {𝑎0 2 + 2𝑎0 ∑(𝑎𝑛 cos 𝑛𝑡 + 𝑏𝑛 sin 𝑛𝑡) + (∑(𝑎𝑛 cos 𝑛𝑡 + 𝑏𝑛 sin 𝑛𝑡)) } 𝑑𝑡
−𝜋 𝑛=1 𝑛=1
𝜋 𝜋 ∞ 𝜋 ∞ 2
= 𝑎0 2 [𝑡]𝜋−𝜋 + 2𝑎0 ∫ ∑(𝑎𝑛 cos 𝑛𝑡 + 𝑏𝑛 sin 𝑛𝑡) 𝑑𝑡 + ∫ (∑(𝑎𝑛 cos 𝑛𝑡 + 𝑏𝑛 sin 𝑛𝑡))
−𝜋 𝑛=1 −𝜋 𝑛=1
∞
= 2𝜋𝑎0 2 + 2𝑎0 ∙ 0 + ∫ (∑(𝑎𝑛 cos 𝑛𝑡 + 𝑏𝑛 sin 𝑛𝑡)) ∙ ( ∑ (𝑎𝑚 cos 𝑚𝑡 + 𝑏𝑚 sin 𝑚𝑡)) 𝑑𝑡
−𝜋 𝑛=1 𝑚=1
𝜋 ∞ ∞
∙ 𝑏𝑚 sin 𝑚𝑡)} 𝑑𝑡
∞ ∞
= 2𝜋𝑎0 + ∑ 𝑎𝑛 𝜋 + ∑ 𝑏𝑛 2 𝜋
2 2
𝑛=1 𝑛=1
∞
= 2𝜋𝑎0 2 + ∑(𝑎𝑛 2 𝜋 + 𝑏𝑛 2 𝜋)
𝑛=1
𝜋 ∞
−𝜋 𝑛=1
𝝅 ∞
𝟏
∴ ∫ {𝒇(𝒕)}𝟐 𝒅𝒕 = 𝟐𝒂𝟎 𝟐 + ∑(𝒂𝒏 𝟐 + 𝒃𝒏 𝟐 )
𝝅
−𝝅 𝒏=𝟏
FOURIER TRANSFORMATION
Fourier Transformation is a mathematical model which helps to transform the signals between two different
domains, such as transforming signal from frequency domain to time domain or vice versa. The generalization of
the complex Fourier series is known as the Fourier transformation. The term “Fourier transformation” can be used
in the mathematical function, and it is also used in the representation of the frequency domain. The Fourier
transformation helps to extend the Fourier series to the non-periodic functions, which helps us to view any
functions in terms of the sum of simple sinusoids. Fourier transformation has many applications in Engineering
and Physics, such as signal processing, RADAR, and so on.
The formulas for both types of Fourier Transformations are given as:
∞
Soln.: We know,
∞
= 0 + ∫ 𝑓(𝑡)𝑒 𝑖𝜔𝑡 𝑑𝑡 + 0
−1
1
= ∫ 1 ∙ 𝑒 𝑖𝜔𝑡 𝑑𝑡
−1
1
𝑒 𝑖𝜔𝑡
=[ ]
𝑖𝜔 −1
𝑒 𝑖𝜔𝑡 𝑒 −𝑖𝜔𝑡
= −
𝑖𝜔 𝑖𝜔
1 𝑒 𝑖𝜔 − 𝑒 −𝑖𝜔
= ( )
𝜔 𝑖
1
= × 2 sin 𝜔
𝜔
2 sin 𝜔
=
𝜔
2 sin 𝜔
∴ 𝐹(𝜔) =
𝜔
Now,
∞
1
𝐼. 𝐹. 𝑇. {𝐹(𝜔)} = 𝑓(𝑡) = ∫ 𝐹(𝜔) ∙ 𝑒 −𝑖𝜔𝑡 𝑑𝜔
2𝜋
−∞
∞
1 2 sin 𝜔 −𝑖𝜔𝑡
𝑜𝑟, 𝑓(𝑡) = ∫ ∙𝑒 𝑑𝜔
2𝜋 𝜔
−∞
∞
1 sin 𝜔 −𝑖𝜔𝑡
= ∫ ∙𝑒 𝑑𝜔
𝜋 𝜔
−∞
1 ∞ sin 𝜔
𝑇ℎ𝑒𝑟𝑒𝑓𝑜𝑟𝑒, 𝑓(0) = 1 = 𝜋 ∫−∞ 𝑑𝜔 [𝐴𝑠 𝑔𝑖𝑣𝑒𝑛 𝑐𝑜𝑛𝑑𝑖𝑡𝑖𝑜𝑛 𝑠𝑎𝑦𝑠, 𝐴𝑡 𝑡 = 0, 𝑓(𝑡) = 1]]
𝜔
∞
sin 𝜔
𝑜𝑟, ∫ 𝑑𝜔 = 𝜋
𝜔
−∞
∞
sin 𝜔
𝑜𝑟, 2 ∫ 𝑑𝜔 = 𝜋
𝜔
0
∞
sin 𝜔 𝜋
𝑜𝑟, ∫ 𝑑𝜔 =
𝜔 2
0
∞
sin 𝑡 𝜋
𝑇ℎ𝑒𝑟𝑒𝑓𝑜𝑟𝑒, ∫ 𝑑𝑡 =
𝑡 2
0
(Ans.)
Soln.: We know,
∞
= 0 + ∫ 𝑓(𝑡)𝑒 𝑖𝜔𝑡 𝑑𝑡 + 0
−1
1
2𝑒 𝑖𝜔 2𝑒 −𝑖𝜔 2𝑒 𝑖𝜔 2𝑒 −𝑖𝜔
=0− − + −
𝜔2 𝜔2 𝑖𝜔 3 𝑖𝜔 3
2 𝑖𝜔 −𝑖𝜔
2 (𝑒 𝑖𝜔 − 𝑒 −𝑖𝜔 )
=− (𝑒 − 𝑒 ) + ∙
𝜔2 𝜔3 𝑖
2 2
= − 2 ∙ 2 cos 𝜔 + 3 ∙ 2 sin 𝜔
𝜔 𝜔
4 sin 𝜔 4 cos 𝜔
= −
𝜔3 𝜔2
4 sin 𝜔
= 2( + cos 𝜔)
𝜔 𝜔
(Ans.)