This action might not be possible to undo. Are you sure you want to continue?
EE2027 SaS 0607, L11
1/12
Lecture 11: Fourier Transform
Properties and Examples
3. Basis functions (3 lectures): Concept of basis
function. Fourier series representation of time
functions. Fourier transform and its properties.
Examples, transform of simple time functions.
Objectives:
1. Properties of a Fourier transform
– Linearity & time shifts
– Differentiation
– Convolution in the frequency domain
2. Understand why an ideal low pass filter cannot be
manufactured
EE2027 SaS 0607, L11
2/12
Lecture 11: Resources
Core material
• SaS, O&W, Chapter 4.3, C4.4
• SaS, HvV, Chapter 3.6
• SaLSA, C, Chapter 5.4, 6.1
Background
While the Fourier series/transform is very important for
representing a signal in the frequency domain, it is also
important for calculating a system’s response (convolution).
• A system’s transfer function is the Fourier transform of its
impulse response
• Fourier transform of a signal’s derivative is multiplication in
the frequency domain: jeX(je)
• Convolution in the time domain is given by multiplication in
the frequency domain (similar idea to log transformations)
EE2027 SaS 0607, L11
3/12
Review: Fourier Transform
A CT signal x(t) and its frequency domain, Fourier transform signal,
X(je), are related by
This is denoted by:
For example:
Often you have tables for common Fourier transforms
The Fourier transform, X(je), represents the frequency content of
x(t).
It exists either when x(t)>0 as t>∞ or when x(t) is periodic (it
generalizes the Fourier series)
}
}
·
· ÷
·
· ÷
÷
=
=
e e
e
e
t
e
d e j X t x
dt e t x j X
t j
t j
) ( ) (
) ( ) (
2
1
) ( ) ( e j X t x
F
÷
e j a
t u e
F
at
+
÷
÷
1
) (
analysis
synthesis
EE2027 SaS 0607, L11
4/12
Linearity of the Fourier Transform
The Fourier transform is a linear function of x(t)
This follows directly from the definition of the Fourier
transform (as the integral operator is linear) & it easily
extends to an arbitrary number of signals
Like impulses/convolution, if we know the Fourier transform
of simple signals, we can calculate the Fourier transform
of more complex signals which are a linear combination
of the simple signals
1 1
2 2
1 2 1 2
( ) ( )
( ) ( )
( ) ( ) ( ) ( )
F
F
F
x t X j
x t X j
ax t bx t aX j bX j
e
e
e e
÷
÷
+ ÷ +
EE2027 SaS 0607, L11
5/12
Fourier Transform of a Time Shifted Signal
We’ll show that a Fourier transform of a signal which has a
simple time shift is:
i.e. the original Fourier transform but shifted in phase by –et
0
Proof
Consider the Fourier transform synthesis equation:
but this is the synthesis equation for the Fourier transform
e
je
0
t
X(je)
( )
0
0
1
2
( )
1
0 2
1
2
( ) ( )
( ) ( )
( )
j t
j t t
j t j t
x t X j e d
x t t X j e d
e X j e d
e
t
e
t
e e
t
e e
e e
e e
·
÷·
·
÷
÷·
·
÷
÷·
=
÷ =
=
}
}
}
) ( )} ( {
0
0
e
e
j X e t t x F
t j ÷
= ÷
EE2027 SaS 0607, L11
6/12
Example: Linearity & Time Shift
Consider the signal (linear sum of two time
shifted rectangular pulses)
where x
1
(t) is of width 1, x
2
(t) is of width 3,
centred on zero (see figures)
Using the FT of a rectangular pulse L10S7
Then using the linearity and time shift
Fourier transform properties
) 5 . 2 ( ) 5 . 2 ( 5 . 0 ) (
2 1
÷ + ÷ = t x t x t x
e
e
e
) 2 / sin( 2
) (
1
= j X
( )

.

\

+
=
÷
e
e e
e
e ) 2 / 3 sin( 2 ) 2 / sin(
) (
2 / 5 j
e j X
e
e
e
) 2 / 3 sin( 2
) (
2
= j X
t
t
t
x
1
(t)
x
2
(t)
x
(t)
EE2027 SaS 0607, L11
7/12
Fourier Transform of a Derivative
By differentiating both sides of the Fourier transform
synthesis equation with respect to t:
Therefore noting that this is the synthesis equation for the
Fourier transform jeX(je)
This is very important, because it replaces differentiation in
the time domain with multiplication (by je) in the
frequency domain.
We can solve ODEs in the frequency domain using
algebraic operations (see next slides)
) (
) (
e e j X j
dt
t dx
F
÷
1
2
( )
( )
j t
dx t
j X j e d
dt
e
t
e e e
·
÷·
=
}
EE2027 SaS 0607, L11
8/12
Convolution in the Frequency Domain
We can easily solve ODEs in the frequency domain:
Therefore, to apply convolution in the frequency domain, we
just have to multiply the two Fourier Transforms.
To solve for the differential/convolution equation using Fourier
transforms:
1. Calculate Fourier transforms of x(t) and h(t): X(je) by H(je)
2. Multiply H(je) by X(je) to obtain Y(je)
3. Calculate the inverse Fourier transform of Y(je)
H(je) is the LTI system’s transfer function which is the Fourier
transform of the impulse response, h(t). Very important in
the remainder of the course (using Laplace transforms)
This result is proven in the appendix
) ( ) ( ) ( ) ( * ) ( ) ( e e e j X j H j Y t x t h t y
F
= ÷ =
EE2027 SaS 0607, L11
9/12
Example 1: Solving a First Order ODE
Calculate the response of a CT LTI system with impulse response:
to the input signal:
Taking Fourier transforms of both signals:
gives the overall frequency response:
to convert this to the time domain, express as partial fractions:
Therefore, the CT system response is:
0 ) ( ) ( > =
÷
b t u e t h
bt
0 ) ( ) ( > =
÷
a t u e t x
at
e
e
e
e
j a
j X
j b
j H
+
=
+
=
1
) ( ,
1
) (
) )( (
1
) (
e e
e
j a j b
j Y
+ +
=


.

\

+
÷
+ ÷
=
) (
1
) (
1 1
) (
e e
e
j b j a a b
j Y
assume
b=a
( ) ) ( ) ( ) (
1
t u e t u e t y
bt at
a b
÷ ÷
÷
÷ =
EE2027 SaS 0607, L11
10/12
h(t)
t
0
Consider an ideal low pass filter in frequency domain:
The filter’s impulse response is the inverse Fourier transform
which is an ideal low pass CT filter. However it is noncausal, so
this cannot be manufactured exactly & the timedomain
oscillations may be undesirable
We need to approximate this filter with a causal system such as 1
st
order LTI system impulse response {h(t), H(je)}:
Example 2: Design a Low Pass Filter
1  
( )
0  
( )  
( )
0  
c
c
c
c
H j
X j
Y j
e e
e
e e
e e e
e
e e
<
¦
=
´
>
¹
<
¦
=
´
>
¹
e
H(je)
e
c
÷e
c
t
t
d e t h
c
t j
c
c
t
e
e
e
e
e
t
) sin(
) (
2
1
= =
}
÷
1
( ) 1
( ) ( ), ( )
F
at
y t
a y t x t e u t
t a je
÷ ÷
c
+ = ÷
c +
EE2027 SaS 0607, L11
11/12
Lecture 11: Summary
The Fourier transform is widely used for designing filters. You can
design systems with reject high frequency noise and just retain
the low frequency components. This is natural to describe in the
frequency domain.
Important properties of the Fourier transform are:
1. Linearity and time shifts
2. Differentiation
3. Convolution
Some operations are simplified in the frequency domain, but there
are a number of signals for which the Fourier transform does not
exist – this leads naturally onto Laplace transforms. Similar
properties hold for Laplace transforms & the Laplace transform
is widely used in engineering analysis.
) (
) (
e e j X j
dt
t dx
F
÷
) ( ) ( ) ( ) ( * ) ( ) ( e e e j X j H j Y t x t h t y
F
= ÷ =
) ( ) ( ) ( ) ( e e j bY j aX t by t ax
F
+ ÷ +
EE2027 SaS 0607, L11
12/12
Lecture 11: Exercises
Theory
1. Using linearity & time shift calculate the Fourier transform of
2. Use the FT derivative relationship (S7) and the Fourier
series/transform expression for sin(e
0
t) (L10S3) to evaluate the FT of
cos(e
0
t).
3. Calculate the FTs of the systems’ impulse responses
a) b)
4. Calculate the system responses in Q3 when the following input signal
is applied
Matlab/Simulink
5. Verify the answer to Q1 using the Fourier transform toolbox in Matlab
6. Verify Q3 and Q4 in Simulink
7. Simulate a first order system in Simulink and input a series of
sinusoidal signals with different frequencies. How does the response
depend on the input frequency (S12)?
) ( ) ( 3
) (
t x t y
t
t y
= +
c
c
) ( ) (
5
t u e t x
t ÷
=
) 2 ( 7 ) 1 ( 5 ) (
) 2 ( 3 ) 1 ( 3
÷ + ÷ =
÷ ÷ ÷ ÷
t u e t u e t x
t t
( )
3 ( ) ( )
y t
y t x t
t
c
+ =
c
EE2027 SaS 0607, L11
13/12
Lecture 12: Tutorial
This will be combined with the Laplace Tutorial L16
EE2027 SaS 0607, L11
14/12
Appendix: Proof of Convolution Property
Taking Fourier transforms gives:
Interchanging the order of integration, we have
By the time shift property, the bracketed term is e
jet
H(je), so
}
·
· ÷
÷ = t t t d t h x t y ) ( ) ( ) (
} }
·
· ÷
÷
·
· ÷

.

\

÷ = dt e d t h x j Y
t je
t t t e ) ( ) ( ) (
} }
·
· ÷
÷
·
· ÷

.

\

÷ = t t t e
e
d dt e t h x j Y
t j
) ( ) ( ) (
) ( ) (
) ( ) (
) ( ) ( ) (
e e
t t e
t e t e
et
et
j X j H
d e x j H
d j H e x j Y
j
j
=
=
=
}
}
·
· ÷
÷
·
· ÷
÷