FourierTransformsJW: Difference between revisions

From Class Wiki
Jump to navigation Jump to search
Line 15: Line 15:


where <math>x(t)</math> is a function of time and <math>X(f)</math> is the Fourier transform of <math>x(t)</math> and is it's Fourier Transform.
where <math>x(t)</math> is a function of time and <math>X(f)</math> is the Fourier transform of <math>x(t)</math> and is it's Fourier Transform.


===Some Properties of the Fourier Transform===


<small>Principle author of this page: Jeffrey Wonoprbowo</small>
<small>Principle author of this page: Jeffrey Wonoprbowo</small>

Revision as of 20:21, 4 December 2005

Fourier Transform

Introduction

A Fourier series allows a periodic function to be represented as the sum of sine and/or cosine waves. This is very useful, because functions in the time domain can be expressed in the frequency domain. The frequency domain can, at times, be easier to work with. This is where the Fourier transfrom comes in. It allows for a nonperidic function of time to be converted (or transformed) into a function of frequency.

This conversion is analgous to the conversion from cartesian coordinates to polar or spherical coordinates. The location of the point does not change; only the directions for how to get there.

Fourier Transform Defined

The Fourier Transform of a function can be defined as:

then the inverse Fourier transform of a function will be:

where is a function of time and is the Fourier transform of and is it's Fourier Transform.


Some Properties of the Fourier Transform

Principle author of this page: Jeffrey Wonoprbowo