This is the third part of the series on Fourier Series and Fourier Transform. In the
first two parts, we have discussed the Fourier Series. From this part onwards, we will
forcus on the Fourier Transform. In a nutshell, Fourier transform could be thought of
as the extension of Fourier Series to the continuous domain, which means that we could
extend the Fourier Series to the functions which are not periodic.
Review of Fourier Series
For a periodic function f(x) with period 1 (you can normalize the period to 1 by scaling the x-axis), we can write it as a Fourier Series:
f(x)=n=−∞∑∞cne2πinx
where cn is the Fourier coefficient, which is the projection of f(x) onto the basis e2πinx:
cn=⟨f(x),e2πinx⟩=∫01f(x)e−2πinxdx
where cn is the Fourier coefficient, which is the projection of f(x) onto the basis e2πinx.
Conside a square wave of period 1, which is defined as:
f(x)={1−10≤x<2121≤x<1
We have calculated the Fourier coefficients of the square wave in the previous part:
f(x)=n is odd∑πin2e2πinx=−∞∑∞πi(2k+1)2e2πi(2k+1)x=−∞∑∞πi(2k+1)2(e2πi(2k+1)x−e−2πi(2k+1)x)=k=0∑∞π(2k+1)4sin[2π(2k+1)x]=π4k=0∑∞2k+11sin[2π(2k+1)x]
The above formula shows the fourier coefficients of the square wave is zero for even n and non-zero for odd n. And each component of the Fourier Series is a sine wave with frequency 2k+1. The following figure shows how the square wave is constructed by the Fourier Series.
This gives us a hint that we can use Fourier Series to decompose a periodic function into a series of sine waves with different frequencies. Now, we want to extend this idea to the non-periodic functions.
We now define the Fourier Transform of a function f(t) as:
f^(s)=∫−∞∞f(t)e−2πistdt
For any s∈R, we can define a function gs(t)=e−2πist. Then, we can write the Fourier Transform as:
f^(s)=⟨f(t),gs(t)⟩
which is the projection of f(t) onto the basis gs(t). Moreover, for any s∈R, integrating f(t) against the complex-valued function gs(t) gives us a complex-valued function f^(s) of s.
The inverse Fourier Transform is defined as:
f(t)=∫−∞∞f^(s)e2πistds
Now, let’s check an example. Consider the triangle function, defined by
∧(t)={1−∣t∣0∣t∣≤1∣t∣>1
For the Fourier transform,
F[∧(t)]=∫−∞∞∧(t)e−2πistdt=∫−11(1−∣t∣)e−2πistdt=∫−10(1+t)e−2πistdt+∫01(1−t)e−2πistdt
Now, let’s consider the first integral:
A(s)=∫−10(1+t)e−2πistdt
Let u=−t, then du=−dt. Then, we have:
A(s)=∫10(1−u)e2πisu(−du)=∫01(1−u)e2πisudu
This gives us:
A(−s)=∫01(1−u)e−2πisudu
Thus,
F[∧(t)]=A(s)+A(−s)
Now, let’s consider the first integral:
A(s)=∫−10(1+t)e−2πistdt=[(1+t)−2πise−2πist]−10−∫−10−2πise−2πistdt=2πis1−−2πis1∫−10e−2πistdt=2πis1−[−4π2s21e−2πist]−10=2πis1−4π2s21+4π2s21e2πis=−2πis1+4π2s21(1−e2πis)
Then
F[∧(t)]=A(s)+A(−s)=−2πis1+4π2s21(1−e2πis)−2πi(−s)1+4π2(−s)21(1−e−2πis)=(πssinπs)2=sinc2(πs)
Here is the graph of the Fourier transform of the triangle function:
As you can see, we are transofrming a function from the time domain to the frequency domain. Both functions are continuous.
After introducing the Fourier transform, we will list some properties of the Fourier transform.
- linearity: F[af(t)+bg(t)]=aF[f(t)]+bF[g(t)]
- time shift: F[f(t−t0)]=e−2πist0F[f(t)]
- stretch: F[f(at)]=∣a∣1F[f(t)]
- derivative: F[f′(t)]=2πisF[f(t)]
Convolution