HW: Difference between revisions

From Class Wiki
Jump to navigation Jump to search
Line 11: Line 11:
<br>
<br>
=== 1. Telling me the difference between a transformer and a Fourier Transform hasn't helped me finish my assignment. What else can you tell me? ===
=== 1. Telling me the difference between a transformer and a Fourier Transform hasn't helped me finish my assignment. What else can you tell me? ===
Wait till Friday. That's when the deadline for this assignment is, so hopefully I'll panic before then and get something done on this page in addition to the spectacular transformers picture.
<br>
<br>
=== 2.Can you show me some really easy plug-in formulas, so I can get my homework done faster (so I can go play World of Warcraft)? ===
=== 2.Can you show me some really easy plug-in formulas, so I can get my homework done faster? ===
Yes. <br>
Yes, but only if you promise to stop playing World of Warcraft. <br>
=== 3.Why would I bother getting one? I don't know what to do with it. ===
=== 3.Why would I bother getting one? I don't know what to do with it. ===
<br> Fourier Transforms are awesome! They allow continuous functions to be represented by ones and zeros, which means we can

implement functions on the computer. Fourier Transforms form the basis of signal processing. They allow us another way to transform

a math problem so it's alot easier to solve.


X(f)=\int_{-\infty}^{\infty} x(t) e^{-j2\pi ft}\, dt

</math>
<br>
<br>
Suppose that we have some function, say <math> \beta (t) </math>, that is nonperiodic and finite in duration.<br>
This means that <math> \beta(t)=0 </math> for some <math> T_\alpha < \left | t \right | </math>
<br><br>
Now let's make a periodic function
<math>
\gamma(t)
</math>
by repeating
<math>
\beta(t)
</math>
with a fundamental period
<math>
T_\zeta
</math>.
Note that
<math>
\lim_{T_\zeta \to \infty}\gamma(t)=\beta(t)
</math>
<br>
The Fourier Series representation of <math> \gamma(t) </math> is
<br>
<math>
\gamma(t)=\sum_{k=-\infty}^\infty \alpha_k e^{j2\pi fkt}
</math>
where
<math>
f={1\over T_\zeta}
</math>
<br>and
<math>
\alpha_k={1\over T_\zeta}\int_{-{T_\zeta\over 2}}^{{T_\zeta\over 2}} \gamma(t) e^{-j2\pi kt}\,dt
</math>
<br>
<math> \alpha_k </math> can now be rewritten as
<math>
\alpha_k={1\over T_\zeta}\int_{-\infty}^{\infty} \beta(t) e^{-j2\pi kt}\,dt
</math>
<br>From our initial identity then, we can write <math> \alpha_k </math> as
<math>
\alpha_k={1\over T_\zeta}\Beta(kf)
</math>
<br> and
<math>
\gamma(t)
</math>
becomes
<math>
\gamma(t)=\sum_{k=-\infty}^\infty {1\over T_\zeta}\Beta(kf) e^{j2\pi fkt}
</math>
<br>
Now remember that
<math>
\beta(t)=\lim_{T_\zeta \to \infty}\gamma(t)
</math>
and
<math>
{1\over {T_\zeta}} = f.
</math>
<br>
Which means that
<math>
\beta(t)=\lim_{f \to 0}\gamma(t)=\lim_{f \to 0}\sum_{k=-\infty}^\infty f \Beta(kf) e^{j2\pi fkt}
</math>
<br>
Which is just to say that
<math>
\beta(t)=\int_{-\infty}^\infty \Beta(f) e^{j2\pi fkt}\,df
</math>
<br>
<br>
So we have that
<math>
\mathcal{F}[\beta(t)]=\Beta(f)=\int_{-\infty}^{\infty} \beta(t) e^{-j2\pi ft}\, dt
</math>
<br>
Further
<math>
\mathcal{F}^{-1}[\Beta(f)]=\beta(t)=\int_{-\infty}^\infty \Beta(f) e^{j2\pi fkt}\,df
</math>


==Some Useful Fourier Transform Pairs==
==Some Useful Fourier Transform Pairs==

Revision as of 19:59, 8 October 2007

An Introduction to the Fourier Transform

Unfortunately, the Fourier Transform isn't a Transformer. If it was, you would have seen it in the movie that came out lately. Transformer roolbar.jpg
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.
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. Telling me the difference between a transformer and a Fourier Transform hasn't helped me finish my assignment. What else can you tell me?

Wait till Friday. That's when the deadline for this assignment is, so hopefully I'll panic before then and get something done on this page in addition to the spectacular transformers picture.

2.Can you show me some really easy plug-in formulas, so I can get my homework done faster?

Yes.

3.Why would I bother getting one? I don't know what to do with it.


Fourier Transforms are awesome! They allow continuous functions to be represented by ones and zeros, which means we can implement functions on the computer. Fourier Transforms form the basis of signal processing. They allow us another way to transform a math problem so it's alot easier to solve.

Some Useful Fourier Transform Pairs






Some other usefull pairs can be found here: Fourier Transforms

A Second Approach to Fourier Transforms