HW

From Class Wiki
Revision as of 19:41, 8 October 2007 by Rothsa (talk | contribs)
Jump to navigation Jump to search

An Introduction to the Fourier Transform

A Fourier Transform is a representation of a function using a large number of sinusoids added together to create it.

For example, a square wave could be represented by:

That's alot of numbers seemingly out of the blue, at first observance. I bet your questions are:

1. What is a Fourier Transform?
2.How do I get one?
3.If I've got one, what can I do with it?

Unfortunately, the Fourier Transform isn't a Transformer. If it was, you would have seen it in the movie that came out lately. Even if it was a transformer, I bet it would look like a stately old English professor instead of a metal beast, since it always follows the rules.

One way to explain a Fourier Transform is to say it's a bunch of sinusoids added to create a just about any function you want. Another way to describe it is to say it's a way of representing a function in the frequency domain instead of the time domain. X(f)=\int_{-\infty}^{\infty} x(t) e^{-j2\pi ft}\, dt

</math>

Suppose that we have some function, say , that is nonperiodic and finite in duration.
This means that for some

Now let's make a periodic function by repeating with a fundamental period . Note that
The Fourier Series representation of is
where
and
can now be rewritten as
From our initial identity then, we can write as
and becomes
Now remember that and
Which means that
Which is just to say that

So we have that
Further

Some Useful Fourier Transform Pairs






Some other usefull pairs can be found here: Fourier Transforms

A Second Approach to Fourier Transforms