Fourier Transform and Applications
- Part 1

ECE generic        Han Q. Le (c)

Lect_3340_Fourier_background_review_part1_1.gif              Lect_3340_Fourier_background_review_part1_2.gif   

1. Introduction: numerical discovery approach

1.1 Run the app demo

We have made music and see a sound note can be a “fairly” periodic function:

Lect_3340_Fourier_background_review_part1_3.gif

sound signal                                               Fourier transform
Lect_3340_Fourier_background_review_part1_4.gif      Lect_3340_Fourier_background_review_part1_5.gif
zoom in to see the periodic signal
Lect_3340_Fourier_background_review_part1_6.gif

What is most remarkable is that the Fourier spectrum shows many peaks that have periodic spacing. It means that the sound signal can be written as:
                                       Lect_3340_Fourier_background_review_part1_7.png     (1.1.1)
where f is the fundamental frequency found below:
Lect_3340_Fourier_background_review_part1_8.gif

and p are the number of peaks that are above the “fuzzy” noise floor.

Are those peaks are really regularly spaced? We can check by plotting:

Lect_3340_Fourier_background_review_part1_9.gif

Lect_3340_Fourier_background_review_part1_10.gif

1.2 Construction of the signal

Let’s use Eq. (1.1.1) to reconstruct the signal. Since the signal is over a long duration with some slight variation, we’ll choose a narrow interval as show below:

Lect_3340_Fourier_background_review_part1_11.gif

Over this range of signal:

Lect_3340_Fourier_background_review_part1_12.gif

Best-fitted fundamental frequency (Hz)    522.146

Lect_3340_Fourier_background_review_part1_13.gif

Let’s look at the Fourier components:

Lect_3340_Fourier_background_review_part1_14.gif

Here are the Fourier component Lect_3340_Fourier_background_review_part1_15.png:

Lect_3340_Fourier_background_review_part1_16.gif

Lect_3340_Fourier_background_review_part1_17.png

Now, we just apply the formula:
                                       Lect_3340_Fourier_background_review_part1_18.png     (1.1.1)

One more thing: we don’t have to sum from -p to p like the equation says. Because the signal is real, we can just add the positive p components and take the Real part.

So, this is the synthesize signal:

Lect_3340_Fourier_background_review_part1_19.gif

Let’s plot our synthesized signal (yellow) to compare with the original (green):

Lect_3340_Fourier_background_review_part1_20.gif
Lect_3340_Fourier_background_review_part1_21.gif

Pretty close, given that we use a mere 9 components out of 515. This what they sound like:

Lect_3340_Fourier_background_review_part1_22.gif   Lect_3340_Fourier_background_review_part1_23.gif

2. Fourier’s theorem: an example

2.1 Discussion

Is it true that any periodic function can be expressed as a sum of harmonics with frequencies that are integral multiples of the fundamental frequency? Yes, that is exactly what Fourier’s theorem says,...

which means that we can represent a periodic function as a series, known as Fourier’s series
                        Lect_3340_Fourier_background_review_part1_24.png  ; Lect_3340_Fourier_background_review_part1_25.png   (2.1.1)
where T is the period, and the Fourier series coefficient is obtained as
                                  Lect_3340_Fourier_background_review_part1_26.png                                          (2.1.2)

It is quite easy to construct a periodic function. All we have to do is to define it over one period, and repeat it. In programming language,we use modulo function so that the variable repeating itself after each period.

Consider as an example this simple function:
         Lect_3340_Fourier_background_review_part1_27.png   for t ∈[-0.5,0.5]
which can also be written as:
         Lect_3340_Fourier_background_review_part1_28.png

2.2 An example

2.2.1 Plot the function

                                  

2.2.2 Obtain Fourier coefficients

Let’s apply Fourier’s theorem to it. The Fourier’s theorem says first, we should obtain the coefficient:
                     Lect_3340_Fourier_background_review_part1_30.png

Lect_3340_Fourier_background_review_part1_31.gif

Lect_3340_Fourier_background_review_part1_32.png 0<σ1≤1
Lect_3340_Fourier_background_review_part1_33.png σ1>1
0 True

Hence, the Fourier coefficient is:  Lect_3340_Fourier_background_review_part1_34.png

But we can simplify it a bit:

Lect_3340_Fourier_background_review_part1_35.png

Lect_3340_Fourier_background_review_part1_36.png

Lect_3340_Fourier_background_review_part1_37.png

Lect_3340_Fourier_background_review_part1_38.png

Lect_3340_Fourier_background_review_part1_39.png

Lect_3340_Fourier_background_review_part1_40.png

Hence, the Fourier coefficient is:

Lect_3340_Fourier_background_review_part1_41.png

or

Lect_3340_Fourier_background_review_part1_42.png

Why do we use Sinc function? just for this simple reason

Lect_3340_Fourier_background_review_part1_43.png

Lect_3340_Fourier_background_review_part1_44.png

Lect_3340_Fourier_background_review_part1_45.png

Lect_3340_Fourier_background_review_part1_46.png

2.2.3 Apply the Fourier’s theorem numerically

Code

                                   

3. Fourier signal synthesis

Can we use Fourier’s theorem to synthesize a signal? Certainly!

3.1 Example 1: signal synthesis concept

                                                          

3.2 Example 2

                              penguin.gif

4. Basic concept of Fourier analysis for a LTI system

Lect_3340_Fourier_background_review_part1_50.gif

A periodic signal can be decomposed into a sum of its Fourier components

Lect_3340_Fourier_background_review_part1_51.gif

With known system response, we know the output of each component. Remember this?

Lect_3340_Fourier_background_review_part1_52.gif
Lect_3340_Fourier_background_review_part1_53.gif

All we have to do is to add them up! See illustration below

4.1 Illustration of passive RC with Bode plots

4.2 Illustration of passive RC with Fourier analysis

                       

To be continued to Part 2 - Fourier integral transform

Created with the Wolfram Language