Professional Documents
Culture Documents
Anharmonic Waves
∞ ∞
∫ ∫
1
f (t) = F(ω) exp(iωt) dω F (ω ) = f (t ) exp(−iωt ) dt
2π
−∞ −∞
What do we hope to achieve with the
Fourier Transform?
We desire a measure of the frequencies present in a wave. This will
lead to a definition of the term, the “spectrum.”
Time
It will be nice if our measure also tells us when each frequency occurs.
Lord Kelvin on Fourier’s theorem
Lord Kelvin
Joseph Fourier, our hero
Fourier was
obsessed with the
physics of heat and
developed the
Fourier series and
transform to model
heat-flow problems.
Anharmonic waves are sums of sinusoids.
Consider the sum of two sine waves (i.e., harmonic
waves) of different frequencies:
Here, we write a
square wave as
a sum of sine waves.
Any function can be written as the
sum of an even and an odd function
E(-x) = E(x)
E ( x ) ≡ [ f ( x ) + f ( − x )] / 2
O ( x ) ≡ [ f ( x ) − f ( − x )] / 2
O(-x) = -O(x)
f ( x) = E ( x) + O ( x)
Fourier Cosine Series
Because cos(mt) is an even function (for all m), we can write an even
function, f(t), as:
∑
1
f(t) = F cos(mt)
π m
m =0
And where we’ll only worry about the function f(t) over the interval
(–π,π).
The Kronecker delta function
⎧1 if m = n
δ m,n ≡⎨
⎩0 if m ≠ n
Finding the coefficients, Fm, in a Fourier Cosine Series
∑
∞
1
Fourier Cosine Series: f (t ) = Fm cos( mt )
π
m=0
To find Fm, multiply each side by cos(m’t), where m’ is another integer, and integrate:
π π
∑∫
∞
∫
1
f (t) cos(m' t) dt = Fm cos(mt) cos(m' t) dt
π
−π m= 0 −π
π
∫
⎧π if m = m '
But: cos( mt ) cos( m ' t ) dt = ⎨ ≡ π δ m,m '
⎩ 0 if m ≠ m '
−π
π
∑
∞
∫
1
So: f (t ) cos(m ' t ) dt = Fm π δ m,m ' Å only the m’ = m term contributes
π
−π m=0
∫
Dropping the ‘ from the m:
Fm = f (t ) cos(mt ) dt Å yields the
coefficients for
−π any f(t)!
Fourier Sine Series
∑
∞
1
f (t) = Fm′ sin(mt)
π
m= 0
where we’ll only worry about the function f(t) over the interval (–π,π).
Finding the coefficients, F’m, in a Fourier Sine Series
∑
∞
1
Fourier Sine Series: f (t) = Fm′ sin(mt)
π
m= 0
To find Fm, multiply each side by sin(m’t), where m’ is another integer, and integrate:
π ∞ π
∑
1
∫
−π
f (t ) sin(m ' t ) dt =
π ∫ F ′ sin(mt ) sin( m ' t ) dt
m =0 −π
m
But:
π
⎧π if m = m '
∫
−π
sin(mt ) sin(m ' t ) dt = ⎨
⎩ 0 if m ≠ m '
≡ π δ m ,m '
π ∞
So:
∑
1
∫ f (t ) sin(m ' t ) dt
−π
=
π
F′ π δ
m =0
m m,m ' Å only the m’ = m term contributes
∞ ∞
1 1
f (t ) =
π
∑ m =0
Fm cos(mt ) +
π
∑ m =0
Fm′ sin(mt )
where
Fm =
∫ f (t) cos(mt) dt and Fm′ =
∫ f (t) sin(mt) dt
We can plot the coefficients of a Fourier Series
Fm vs. m
.5
0 5 10 25
15 20 30
m
We really need two such plots, one for the cosine series and another
for the sine series.
Discrete Fourier Series vs.
Continuous Fourier Transform
Fm vs. m
Let the integer
m become a F(m)
real number
and let the
coefficients,
Fm, become a
function F(m).
Again, we really need two such plots, one for the cosine series and
another for the sine series.
The Fourier Transform
Consider the Fourier coefficients. Let’s define a function F(m) that
incorporates both cosine and sine series coefficients, with the sine
series distinguished by making it the imaginary component:
F(m) ≡ Fm – i F’m =
∫ f (t) cos(mt) dt − i
∫ f (t) sin(mt) dt
∫
The Fourier
F (ω) = f (t) exp(−iω t ) dt
Transform
−∞
∑ ∑
1 1
f (t ) = Fm cos(mt ) + Fm' sin( mt )
π m=0
π m =0
∞ Inverse
1
f (t ) =
∫ F (ω) exp(iωt ) dω Fourier
2π Transform
−∞
The Fourier Transform and its Inverse
F (ω ) =
∫ f (t ) exp(−iωt ) dt
−∞
FourierTransform
∞
1
f (t ) =
2π ∫ F (ω ) exp(iω t ) d ω
−∞
Inverse Fourier Transform
E (t ) → Y {E (t )} or: E (t ) → E% (ω )
2
Y {E (t )}
1
= [exp( − iω / 2) − exp(iω /2)]
− iω
1 exp(iω / 2) − exp( − iω /2)
=
(ω /2) 2i
sin(ω /2) F(ω)
=
(ω /2)
F (ω ) = sinc(ω/2) Imaginary
Component = 0
ω
Sinc(x) and why it's important
It just crops up
everywhere...
The Fourier Transform of the triangle
function, Δ(t), is sinc2(ω/2)
The triangle function is just what it sounds like.
Δ(t ) sinc 2 (ω / 2)
Sometimes
people use
1 1
∩
Λ(t), too, for
the triangle
function.
-1/2 0 1/2 t 0 ω
−1 +∞ −1
= exp(−[a + iω ]t ) 0 = [exp(−∞ ) − exp(0)]
a + iω a + iω
−1
= [0 − 1]
a + iω
1
=
a + iω
1
F (ω ) = − i
ω − ia
A complex Lorentzian!
Example: the Fourier Transform of a
Gaussian, exp(-at2), is itself!
∞
F {exp(− at )} = ∫ exp( − at ) exp(−iωt ) dt
2 2
−∞
0 t 0 ω
Some functions don’t have Fourier
transforms.
∫
−∞
f (t) dt < ∞
F (ω) =
∫
−∞
[Re{ f (t )} + i Im{ f (t )}] [cos(ωt ) − i sin(ωt)] dt
Expanding further:
∞ ∞
+ i
∫
−∞
Im{ f (t )} cos(ω t ) dt − i
↑
∫
−∞
Re{ f (t )} sin(ω t) dt
↑
←Im{F(ω)}