14
EE-2027 SaS 06-07, 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

Fourier.ppt

Embed Size (px)

DESCRIPTION

fourier series

Citation preview

Page 1: Fourier.ppt

EE-2027 SaS 06-07, 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

Page 2: Fourier.ppt

EE-2027 SaS 06-07, 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

BackgroundWhile 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: jX(j)

• Convolution in the time domain is given by multiplication in the frequency domain (similar idea to log transformations)

Page 3: Fourier.ppt

EE-2027 SaS 06-07, L11 3/12

Review: Fourier Transform

A CT signal x(t) and its frequency domain, Fourier transform signal, X(j), are related by

This is denoted by:

For example:

Often you have tables for common Fourier transformsThe Fourier transform, X(j), 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)

dejXtx

dtetxjX

tj

tj

)()(

)()(

21

)()( jXtxF

jatue

Fat

1)(

analysis

synthesis

Page 4: Fourier.ppt

EE-2027 SaS 06-07, 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

Page 5: Fourier.ppt

EE-2027 SaS 06-07, 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 –t0

Proof

Consider the Fourier transform synthesis equation:

but this is the synthesis equation for the Fourier transform

e-j0tX(j)

0

0

12

( )10 2

12

( ) ( )

( ) ( )

( )

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

)()}({ 00 jXettxF tj

Page 6: Fourier.ppt

EE-2027 SaS 06-07, L11 6/12

Example: Linearity & Time Shift

Consider the signal (linear sum of two time shifted rectangular pulses)

where x1(t) is of width 1, x2(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)( 21 txtxtx

)2/sin(2)(1 jX

)2/3sin(2)2/sin()( 2/5jejX

)2/3sin(2)(2 jX

t

t

t

x1(t)

x2(t)

x (t)

Page 7: Fourier.ppt

EE-2027 SaS 06-07, 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 jX(j)

This is very important, because it replaces differentiation in the time domain with multiplication (by j) in the frequency domain.

We can solve ODEs in the frequency domain using algebraic operations (see next slides)

)()( jXj

dt

tdx F

12

( )( ) j tdx t

j X j e ddt

Page 8: Fourier.ppt

EE-2027 SaS 06-07, L11 8/12

Convolution in the Frequency DomainWe 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(j) by H(j)

2. Multiply H(j) by X(j) to obtain Y(j)

3. Calculate the inverse Fourier transform of Y(j)

H(j) 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

)()()()(*)()( jXjHjYtxthtyF

Page 9: Fourier.ppt

EE-2027 SaS 06-07, L11 9/12

Example 1: Solving a First Order ODECalculate 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)()( btueth bt

0)()( atuetx at

jajX

jbjH

1)(,

1)(

))((

1)(

jajbjY

)(

1

)(

11)(

jbjaabjY

assumeba

)()()( 1 tuetuety btatab

Page 10: Fourier.ppt

EE-2027 SaS 06-07, L11 10/12

h(t)

t0

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 non-causal, so this cannot be manufactured exactly & the time-domain oscillations may be undesirable

We need to approximate this filter with a causal system such as 1st order LTI system impulse response {h(t), H(j)}:

Example 2: Design a Low Pass Filter

1 | |( )

0 | |

( ) | |( )

0 | |

c

c

c

c

H j

X jY j

H(j)

cc

t

tdeth ctjc

c

)sin()( 2

1

1 ( ) 1( ) ( ), ( )

Faty t

a y t x t e u tt a j

Page 11: Fourier.ppt

EE-2027 SaS 06-07, 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.

)()( jXj

dt

tdx F

)()()()(*)()( jXjHjYtxthtyF

)()()()( jbYjaXtbytaxF

Page 12: Fourier.ppt

EE-2027 SaS 06-07, L11 12/12

Lecture 11: ExercisesTheory1. Using linearity & time shift calculate the Fourier transform of

2. Use the FT derivative relationship (S7) and the Fourier series/transform expression for sin(0t) (L10-S3) to evaluate the FT of cos(0t).

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/Simulink5. Verify the answer to Q1 using the Fourier transform toolbox in Matlab6. Verify Q3 and Q4 in Simulink7. 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)(

txtyt

ty

)()( 5 tuetx t

)2(7)1(5)( )2(3)1(3 tuetuetx tt

( )3 ( ) ( )y t

y t x tt

Page 13: Fourier.ppt

EE-2027 SaS 06-07, L11 13/12

Lecture 12: Tutorial

This will be combined with the Laplace Tutorial L16

Page 14: Fourier.ppt

EE-2027 SaS 06-07, 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-jH(j), so

dthxty )()()(

dtedthxjY tj )()()(

ddtethxjY tj)()()(

)()(

)()(

)()()(

jXjH

dexjH

djHexjY

j

j