Fourier Seriesn Transforms
Fourier Seriesn Transforms
Periodic signals have the property that x(t + T ) = x(t), for all t
Period: The smallest value of T that satisfies the definition
Building-block signals
We will represent signals as sums of building-block signals.
Important families of building-block signals are the eternal,
complex exponentials and the unit impulse functions.
Joseph Fourier
1768-1830
1
For a periodic time-domain signal with a period T0 =
f0
ref: Dr. Ali J. Abboud, University of Diyala, College of Engineering, Department of Computer Engineering
Substituting
cos(x) = exp(jx) + exp(−jx)
2
1h i
sin(x) =
2j 2
exp(jx) − exp(−jx) = − j exp(jx) + j exp(−jx)
1h i 1h i
in equation (2)
we get
(3)
cn = a 0 for n = 0 (4)
∞ ∞
gp (t) = [cn exp(j2πnf0 t)] = [cn e (j2πnf0 t) ] (5)
n=−∞ n=−∞
X X
Also,
and
−bn
2
a n + bn2
an
sin(ϕn ) = p
an2 + bn2
cos(ϕn ) = p
∞
∴ gp (t) = a0 + [An cos(2πnf0 t + ϕn )] (6)
n=1
X
First the a0
Integrate both the sides of Equation 1 over a period T0
Choose the period depending on the convenience of evaluating the
the integral
T gp (t)dt =
− 20
R T20
= T0 a0 dt
2
−
R T20
= a0 T0
∴ a0 = T gp (t)dt
T0 − 20
1 R T20
T0
2 T0 for n = m
2 cos(2πnf0 t)cos(2πmf0 t) dt = (7)
T 0 for n =
(
− 20
Z
̸ m
h i
T0
2 0 for n = m
2 cos(2πnf0 t)sin(2πmf0 t) dt = (8)
T
(
− 20
Z
0 for n ̸= m
h i
T0
2 T0 for n = m
2 sin(2πnf0 t)sin(2πmf0 t) dt = (9)
T 0 for n =
(
− 20
Z
̸ m
h i
∴ an = T gp (t)cos(2πnf0 t)dt
T0 − 20
and
1 R T20
bn = T gp (t)sin(2πnf0 t)dt
T0 − 20
1 R T20
cn = T gp (t)exp(j2πnf0 t)dt
T0 − 20
1 R T20
T gp (t)dt =
− 20
R T20
Adt = a0 T0 dt + 0 + 0 = a0 T0
2
− τ2 −
R τ2 R T20
or A τ = a0 T 0
τ
implies a0 = A
T0
Now
an = A cos(2πnf0 t)dt
T0 −τ
2 R +τ
2A sin(πnf0 t) +τ
=
T0 πnf0 −τ
A
= [sin(πnf0 τ ) − sin(−πnf0 τ )]
πnf0 T0
2A
= [sin(πnf0 τ )]
πn
an ’s are all constants
2
bn = T0 −τ
Asin(2πnf0 t)dt
2A cos(πnf0 t) +τ
R +τ
=
T0 πnf0 −τ
A
= [cos(πnf0 τ ) − cos(−πnf0 τ )] = 0
πnf0 T0
∞
τ
gp (t) = A + an cos(2πnf0 t) (10)
T0 n=1
X
Electromagnetic spectrum
All frequencies of electromagnetic radiation - visible light, radio,
infrared, etc.
speed of light
All travel at speed of light, so wavelength =
frequency
(a)
for t < −4
(11)
t − 2 for t ≥ 3
(c)
for n < 2
(12)
4 − n for n ≥ 4
Fourier Transform
limT0 →∞ n=−∞
T0
P∞
Let us define
1
cn T0 = G (fn ) and = ∆f0
T0
Substituting in the equation
= limT0 →∞ n=−∞ [G (fn ) exp(j2πnf0 t)] ∆f0
P∞
= G (ω)exp(+jωt) dω
2π −∞
1 R +∞
Fourier pair
g (t) ⇋ G (f )
Operation on Signals
Need
1 Linearity
2 Time shifting or delay
3 Frequency shifting
4 Time scaling or Time reversal
5 Duality
6 Differentiation
7 Integration
8 Convolution
Proof:
Fourier transform of a1 g1 (t) + a2 g2 (t) will be
= −∞ [a1 g1 (t) + a2 g2 (t)]exp(−j2πft)dt
R +∞
= a1 −∞ g1 (t)exp(−j2πft)dt + a2 −∞ g2 (t)exp(−j2πft)dt
R +∞ R +∞
= a1 G1 (f ) + a2 G2 (f )
∴ [a1 g1 (t) + a2 g2 (t)] ⇋ [a1 G1 (f ) + a2 G2 (f )]
Proof:
Fourier transform of g (t − t0 ) will be
= −∞ g (t − t0 )exp(−j2πft)dt
R +∞
Now let (t − t0 ) = τ
∴ dt = dτ
Equation
= −∞ g (τ )exp(−j2πf (t0 + τ )dτ
R +∞ above becomes
= exp(−j2πft0 ) −∞
g (τ )exp(−j2πf τ )dτ
R +∞
= exp(−j2πft0 ) G (f )
Proof:
= −∞
[exp(−j2πfc t)g (t)] exp(−j2πft)dt
R +∞
= −∞
exp(−j2π(f − fc )t) g (t)dt
R +∞
= G (f − fc )
Proof:
F [g (at)]
= −∞
g (at)exp(−j2πft) dt
R +∞
Now, let at = τ
∴ a dt = dτ
Substituting
dτ f
= g (τ )exp(−j2πf τ /a) = g (τ )exp(−j2π τ ) dτ
−∞
a a −∞ a
R +∞ 1 R +∞
g (t) = −∞
G (f )exp(+j2πft)df
R +∞
G (f ) = −∞
g (t)exp(−j2πft)dt
R +∞
g (t) = −∞
G (y )exp(+j2πyt)dy
R +∞
g (−f ) = −∞
G (y )exp(−j2πyf )dy
R +∞
d g (t)
Differentiation ⇋ j2πf G (f )
dt
Proof:
The first equation of the Fourier pair is
g (t) = −∞ G (f )exp(+j2πft)df
R +∞
−∞
R +∞
Proof:
As it is the inverse of differentiation, the result is obviously as given
above
Convolution
−∞
g1 (τ ) g2 (t − τ )dτ ⇋ G1 (f ) G2 (f )
Rt
Demo
https://pages.jh.edu/signals/
t
g (t) = A rect( )
T
Plot it
By definition,
G (f ) = −∞ g (t)exp(j2πft)]dt
R +∞
= − T2
A exp(j2πft)]dt
R + T2
G (f ) =
j2πf
exp(j2πfT /2) − exp(−j2πfT /2)
A n o
or G (f ) = sin(πfT )
πf
An o
sin(πλ)
Now, define = sinc(λ)
πλ
∴ G (f ) = AT sinc(fT )
Example
Delta function δ(t)
F [g (t)] = F [δ(t)] = −∞
δ(t)exp(j2πft)]dt
R +∞
1
Implies A =
T
∴ F [g (t)] = F [δ(t)] = 1
Writing
−∞
δ(t)exp(j2πft)]dt = −∞ δ(t)[cos(2πft) + j sin(2πft)]dt = 1
R +∞ way as
R +∞ this equation in another
in general
−∞
δ(t)g (t)dt = g (0)
R +∞
or −∞
δ(t − t0 )g (t)dt = g (t0 )
R +∞
1. δ(t) ↔ 1
2. u(t) = −∞ δ(τ )dτ
using integration property,
Rt
1 1
u(t) ⇋ + δ(f )
j2πf 2
3. sgn(t) = 2u(t) − 1
2 2 1
∴ sgn(t) ⇋
j2πf 2 jπf
+ δ(f ) − δ(f ) =
Fourier pairs
un−1 (t) = −∞
un (t) dt
Rt
1. A sine wave remains a sine wave of the same frequency when you
multiply by a constant
add onto to another sine wave of the same frequency
differentiate or integrate or shift in time
Fourier pair
g (t) = −∞
G (f )exp(+j2πft)df
R +∞
G (f ) = −∞
g (t)exp(−j2πft)dt
R +∞
g (t) ⇋ G (f )
Block 1 Block 2
Convolution Correlation
y (t) = −∞ x(τ )h(t − τ ) dτ y (t) = −∞ x(τ )h(t + τ ) dτ
Rt Rt
G (f ) = −∞
g (t) cos(2πft) dt − j −∞
g (t) sin(2πft)] dt
R +∞ R +∞
The Fourier Transform is the correlation of the given signal g(t) with
cos and sin waveforms with different values of f.
Youtube video on
The Remarkable Story Behind The Most Important Algorithm Of All
Time