MCT 2 Fourier
MCT 2 Fourier
3.) (Fourier Series) Fourier series in the complex exponential form of representation
4.) (Fourier Transform) Transition from Fourier series to the continuous Fourier transform
5.) (Fourier Transform) Transition from continuous Fourier transform to the continuous discrete Fourier
transform
6.) (Fourier Transform) Transition from continuous Fourier transform to the discrete Fourier transform
Fourier’s theorem states that any periodic function y(t) may be decomposed into
an infinite series of sine and cosine functions
a0
y (t ) := + y (t ) := a0 +
2
+ a1 cos(0 t ) + a2 cos(2 0 t ) +
+ a1 cos(0 t ) + a2 cos(2 0 t ) +
+ b1 sin(0 t ) + b2 sin(2 0 t ) +
+ b1 sin(0 t ) + b2 sin(2 0 t ) +
a0
y (t ) := + an cos(n 0 t ) + bn sin(n 0 t ) y (t ) := a0 + an cos(n 0 t ) + bn sin(n 0 t )
2 n =1 n =1
2 rad
0 = = 2 f0
T0 s
1
T0 = s
f0
1
f0 = Hz
T0
The coefficients an and bn are determined by solving the following integral equations
T0
T0
2 1
y(t ) dt
2 a0 =
a0 =
T0 T0
y (t ) dt Mean value
T0 0
−
2
T0
T0
2
y(t ) cos ( n t ) dt
2
2
an = y (t ) cos ( n 0 t ) dt an = 0
T0 T
T0 0
− 0
2
T0
2 T0
2 2
bn = y (t ) sin ( n 0 t ) dt bn = y(t ) sin ( n t ) dt
0
T0 T T0 0
− 0
2
© PFH Private Hochschule Göttingen 7
Calculating the coefficients
2 L = 2
nx nx
f ( x ) = a0 + an cos + bn sin f ( x ) = a0 + an cos ( nx ) + bn sin ( nx )
n =1 L L n =1
2
1
1
f ( x ) dx
a0 = f ( x ) dx
2 L 2L
a0 = 2 0
2
1
1 n x
an = f ( x ) cos dx
an =
f ( x ) cos ( nx ) dx
L 2L L 0
2
n x 1
1
bn = f ( x ) sin dx
bn =
f ( x ) sin ( nx ) dx
L 2L L 0
+2 +2
sin ( n x ) dx = 0
0
sin ( n x ) sin ( m x ) dx = 0
0
+2 +2
cos ( n x ) dx = 0
0
cos ( n x ) cos ( m x ) dx = 0
0
+2 +2
0 0
+2 +2
2
2
a0 =
f ( x ) dx
0
2 2 2 2 2 2
2
f ( x ) dx = a x 0 = a0 2 − 0 = 2 a0
2
0
0
2
1
a0 =
2 f ( x ) dx
0
© PFH Private Hochschule Göttingen 10
Calculating the coefficients
2
1
an =
f ( x ) cos ( nx ) dx
0
2 2
f ( x ) cos ( nx ) dx = a0 cos ( nx ) dx +
0 0
2 2 2 2
+ a1 cos ( x ) cos ( nx ) dx + a2 cos ( 2 x ) cos ( nx ) dx + a3 cos ( 3x ) cos ( nx ) dx + + an cos 2 ( nx ) dx
0 0 0 0
2 2 2 2
+b1 sin ( x ) cos ( nx ) dx + b2 sin ( 2 x ) cos ( nx ) dx + b3 sin ( 3 x ) cos ( nx ) dx + + bn sin ( nx ) cos ( nx ) dx
0 0 0 0
2 2
f ( x ) cos ( nx ) dx = a cos ( nx ) dx
2
n
0 0
2
f ( x ) cos ( nx ) dx = a
0
n
2
1
an = f ( x ) cos ( nx ) dx
0 © PFH Private Hochschule Göttingen 11
Calculating the coefficients
2
1
bn =
f ( x ) sin ( nx ) dx
0
2 2
f ( x ) sin ( nx ) dx = a0 sin ( nx ) dx +
0 0
2 2 2 2
+ a1 cos ( x ) sin ( nx ) dx + a2 cos ( 2 x ) sin ( nx ) dx + a3 cos ( 3 x ) sin ( nx ) dx + + an cos ( nx ) sin ( nx ) dx
0 0 0 0
2 2 2 2
+b1 sin ( x ) sin ( nx ) dx + b2 sin ( 2 x ) sin ( nx ) dx + b3 sin ( 3 x ) sin ( nx ) dx + + bn sin 2 ( nx ) dx
0 0 0 0
2 2
f ( x ) sin ( nx ) dx = b sin ( nx ) dx
2
n
0 0
2
f ( x ) sin ( nx ) dx = b
0
n
2
1
bn = f ( x ) sin ( nx ) dx
0 © PFH Private Hochschule Göttingen 12
Fouriere series
Special case: point symmetry to the origin (odd function) y ( t ) = − y ( −t )
y (t ) = bn sin(n 0 t )
n =0
y (t )
2 ŷ
0 =
T0
a0 = 0 No mean value t
− ŷ
an = 0
T0
2 T0
2
bn = y (t ) sin ( n 0 t ) dt
T0 T0
−
2
T0
2 T0
2
an = y (t ) cos ( n 0 t ) dt
T0 T0
−
2
bn = 0
© PFH Private Hochschule Göttingen 14
Fouriere series
Example: Rectangle function
u (t )
y (t ) = bn sin(n 0 t )
n =0 U0
a0 = an = 0
t
T0
2 2
−U 0
bn = y (t ) sin ( n 0 t ) dt −T0 T0
T0 T0 2 2
−
2
T0
2 2 t
bn = y (t ) sin ( n 0 t ) dt
T0 T
− 0
−U 0
2 −T0 T0
2 2
0 T0
2 2
T0
bn = −U 0 sin ( n 0 t ) dt + U 0 sin ( n 0 t ) dt
T0 T0 0
− 2
1
sin ( t ) dt = − cos ( t )
bn =
2 U0
T0 n 0
− − cos ( n 0 t ) −To /2 + − cos ( n 0 t ) 0
0 To /2
© PFH Private Hochschule Göttingen 16
Fouriere series
Example: Rectangle function
0 T0
2 2
bn = −U 0 sin ( n 0 t ) dt + U 0 sin ( n 0 t ) dt U0
T0 T0 0
− 2
1 t
sin ( t ) dt = −
cos ( t )
−U 0
−T0 T0
2
2
2 U
bn = 0 − − cos ( n 0 t ) −To /2 + − cos ( n 0 t ) 0
0 To /2
T0 n 0 T0
2 U0 T T
bn = − −1 + cos n 0 0 + − cos n 0 0 + 1
T0 n 0 2 2
2 U 0 T T
bn = 1 − cos n 0 0 − cos n 0 0 − 1
T0 n 0 2 2
© PFH Private Hochschule Göttingen 17
Fouriere series
Example: Rectangle function u (t )
2 U 0 T U0
bn = 2 − 2 cos n 0 0
T0 n 0 2
4 U 0 T
bn = 1 − cos n 0 0
T0 n 0 2 t
−U 0
with 0 T0 = 2
yields to: T0
4 U 0
bn =
n
1 − cos ( n )
4 U 0
if n is odd
bn = n
0 if n is even
© PFH Private Hochschule Göttingen 18
Fouriere series
Example: Rectangle function
y (t ) = bn sin(n 0 t ) U0
n =0
a0 = an = 0
t
T0
2 2 −U 0
bn = y (t ) sin ( n 0 t ) dt −T0 T0
2
T0 2
T0
−
2
T0
4 U 0
bn =
n
1 − cos ( n ) y (t ) = bn sin(n 0 t )
n =0
4 U 0 4 U
if n is odd y (t ) = sin(n 0 t ) 2n − 1 = ?
bn = n n n =0
0 if n is even
© PFH Private Hochschule Göttingen 19
Fouriere series
Example: Rectangle function
4 U 0 sin ( ( 2n + 1) 0 t )
u (t ) =
n =0 2n + 1
u (t ) u (t )
u (t )
U0
t
−U 0
T0
4 U 0
if n is odd
bn = n
0 if n is even
b (n)
The sine and cosine terms in the Fourier series may be combined into a single
sinusoid with a phase shift using the relation
Proof:
a cos ( ) + b sin ( ) = A sin( + )
a = A sin( )
b = A cos( )
Dividing, we get the following expression for the phase shift
a A sin( ) a a
= = tan ( ) = tan −1
b A cos( ) b b
© PFH Private Hochschule Göttingen 25
Fouriere series
Using the Magnitude and phase description
= A2 sin 2 ( ) + cos 2 ( )
=1
= A2
A = a 2 + b2
The sine and cosine terms in the Fourier series may be combined into a single
sinusoid with a phase shift using the relation
y (t ) = A0 + An cos(n 0 t + n )
n =1
A0 = a0
An = an2 + bn2
bn
n = − tan −1
n
a
© PFH Private Hochschule Göttingen 27
Fouriere series
Using the complex exponential form
The complex exponential form is developed based on expanding sine and cosine
functions in the sine-cosine form into their exponential expressions using Euler’s
formula and regrouping these exponential terms
Euler’s formula is given by
( )
y (t ) = A e j (t + ) + e − j (t + ) = A ( e jt e j + e − jt e − j )
y (t ) = c e jt + c * e − jt
c = A e j = A ( cos + j sin )
c * = A e − j = A ( cos − j sin )
T0
1
y (t ) e
− jn0t
cn = dt
T0 0
T0 T0
cn =
1
T0 0
y (t ) ( cos ( n 0 t ) − j sin ( n 0 t ) )
dt =
1
T0 y ( t ) e − jn0t
dt
0
T T
T0 0 T0 0
T T
T0 0 T0 0
− jn0t
y (t ) = c n e jn0t = c0 + cn e
n =1
jn0t
+ cn e
*
n =− a0 Pointer Pointer
counterclockwise clockwise
© PFH Private Hochschule Göttingen 31
Fouriere series
Calculation for the coefficients (complex values)
an = cn + c− n = 2 Re cn
bn = j ( cn − c− n ) = −2 Im cn
a − j bn 1
T0 T0
1
cn = n
2
=
T0 0 y(t ) cos ( n0t ) dt + j T0 y(t ) sin ( n t ) dt
0
0
a + j bn 1
T0 T0
1
c− n = c = n
*
n = 0 y (t ) cos ( n0 t ) dt − j y(t ) sin ( n t ) dt
0
2 T0 T0 0
An = 2 ( cn c− n ) = 2 cn = 2 c− n
Im ( cn )
n = tan −1
Re ( cn )
A
cn = cn e jn = n e jn
2
An − jn
c− n = cn* = c− n e − jn = e
2 © PFH Private Hochschule Göttingen 32
Time domain signal x(t) Fourier series expansion
y (t )
T0
2
y (t ) = 0 y ( ) e
− jn0
d e jn0t
n =− 2
−T0 2
02
T
1
y (t ) =
2
y ( ) e
n =− −T0
− jn0
d e jn0t 0
2
1
jt
y (t ) = − − y ( ) e − j
d e d
2
Fourier transform Fourier transform
as a function of ω as a function of f
→ Y ( j ) = y(t ) e
− j t
dt → Y(f )= y(t ) e
− j 2 f t
dt
− −
1
Y ( j ) e Y ( f )e
j t
→ y (t ) = d → y (t ) = j 2 f t
df
2 − −
f (t )
A
A if − T t T
f (t ) = 2 2
0 otherwise
− 𝑇ൗ2 𝑇ൗ
2
t
F ( j ) = f ( t ) e
− jt
dt
−
▪ We are looking for the spectrum of the above time signal curve!
− 𝑇ൗ2 𝑇ൗ
2
t
amplitude density
T
2
F ( j ) = f ( t ) e
− jt
dt = A e − jt dt
− −T
2
T 2
( e jT 2 − e − jT 2 )
A − jt A
=− e =
j −T 2
j
F ( j ) = A
(
j 2 sin T )
2 = A (
sin T
2 ) frequency in rad/s
j
2
sin T ( ) 2 1 2 2 2 3 2 4
F ( j ) = A T 2
T
2
© PFH Private Hochschule Göttingen 42
The Fourier transform
Example rectangle impuls
f (t )
A
amplitude density
− 𝑇ൗ2 𝑇ൗ
2
t
F ( j ) = A T
(
sin T
2 )
T
2
(
sin T
2 )=0
T = k frequency in rad/s
2
=
k 2 2 1 2 2 2 3 2 4
T Frequenz Hz
k f = 1Hz f = 2 Hz f = 3Hz f = 4 Hz
f =
T
© PFH Private Hochschule Göttingen 43
The Fourier transform
The Discrete Time Fourier Transform (DTFT) [discrete-time/continuous frequency]
Fourier-Transform
+
F ( j ) =
−
f (t ) e − j t
Pre-condition
N Ts Oberservation window
Pre-condition
N Ts Oberservation window
ys ( t ) = y (t ) ( t − n Ts )
ys ( t ) = y(t ) ( t − n T )
n =−
s
Yd ( j ) = y (n T ) ( t − n T ) e
− j t
s s dt
− n =−
Yd ( j ) = y (n T ) ( t − n T ) e
n =− −
s s
− j t
dt
Yd ( j ) = y (n T ) e
n =−
s
− j n Ts
Note that the delta function has been used here, and the property that
(T ) f ( t ) dt = f (T )
−
Since t = nTs (time) and ωd = ωTs (frequency), this yields the Fourier transform of a
sampled signal as
Yd ( jd ) = y (n T ) e
n =−
s
− j nd
Since the angular frequency is still continuous, the inverse of the DTFT above is
1
y (n) = Yd ( j ) e jn Ts d
2 −
n = N −1
Fd ( j ) =
n =0
f (n Ts ) e − j nTs
N −1 N −1
Fd ( j ) = f (n Ts ) cos( n Ts ) − j f (n Ts ) sin( n Ts )
n =0 n =0
− j nTs ( + 2 )
− j nTs − j n( Ts + 2 )
e =e =e Ts
2
Fd ( j ) = Fd j +
Ts
F ( j ) = Ts Fd ( j )