Fourier transform: Difference between revisions

From Class Wiki
Jump to navigation Jump to search
Guenan (talk | contribs)
No edit summary
Wilspa (talk | contribs)
 
(14 intermediate revisions by 6 users not shown)
Line 1: Line 1:
An initially identity that is useful:
==Fourier Transform==
What is a Fourier Transform? A Fourier Transform is a function that changes a signal or waveform from the time domain into the frequency domain. One simple way to look at it is this: Suppose you are at the beach, watching the waves. You could say that a wave hits the shore at specific times (0 second, 2 seconds, 4 seconds, etc.) that would be describing the waveform in the time domain. If, however, you were to say that the waves hit the beach every two seconds, that would be describing it in the frequency domain. So a Fourier transform would take the data given in the time domain and convert that into the frequency domain. The function that does this is: <math> X(f)=\int_{-\infty}^{\infty} x(t) e^{-j2\pi ft}\, dt </math>.
 
The reverse is also possible. You can take the information from the frequency domain, and convert it into the time domain using an Inverse Fourier Transform.
 
==From the Fourier Transform to the Inverse Fourier Transform==
Lets start with the basic Fourier Transform:
<math>
<math>


Line 87: Line 93:
\mathcal{F}^{-1}[\Beta(f)]=\beta(t)=\int_{-\infty}^\infty \Beta(f) e^{j2\pi fkt}\,df
\mathcal{F}^{-1}[\Beta(f)]=\beta(t)=\int_{-\infty}^\infty \Beta(f) e^{j2\pi fkt}\,df
</math>
</math>
==Some Useful Fourier Transform Pairs==
<math>
\mathcal{F}[\alpha(t)]=\frac{1}{\mid \alpha \mid}f(\frac{\omega}{\alpha})
</math>
<br>
{|
|-
|<math>\mathcal{F}[c_1\alpha(t)+c_2\beta(t)]</math>
|<math>=\int_{-\infty}^{\infty} (c_1\alpha(t)+c_2\beta(t)) e^{-j2\pi ft}\, dt</math>
|-
|
|<math>=\int_{-\infty}^{\infty}c_1\alpha(t)e^{-j2\pi ft}\, dt+\int_{-\infty}^{\infty}c_2\beta(t)e^{-j2\pi ft}\, dt</math>
|-
|
|<math>=c_1\int_{-\infty}^{\infty}\alpha(t)e^{-j2\pi ft}\, dt+c_2\int_{-\infty}^{\infty}\beta(t)e^{-j2\pi ft}\, dt=c_1\Alpha(f)+c_2\Beta(f)</math>
|-
|}
<br>
<math>
\mathcal{F}[\alpha(t-\gamma)]=e^{-j2\pi f\gamma}\Alpha(f)
</math>
<br>
<math>
\mathcal{F}[\alpha(t)*\beta(t)]=\Alpha(f)\Beta(f)
</math>
<br>
<math>
\mathcal{F}[\alpha(t)\beta(t)]=\Alpha(f)*\Beta(f)
</math>
<br>
Some other usefull pairs can be found here: [[Fourier Transforms]]
==Another look at Fourier Transforms==
*[[Fourier Transforms]]
Return to [[Signals and systems|Signals and Systems]]

Latest revision as of 03:32, 13 February 2008

Fourier Transform

What is a Fourier Transform? A Fourier Transform is a function that changes a signal or waveform from the time domain into the frequency domain. One simple way to look at it is this: Suppose you are at the beach, watching the waves. You could say that a wave hits the shore at specific times (0 second, 2 seconds, 4 seconds, etc.) that would be describing the waveform in the time domain. If, however, you were to say that the waves hit the beach every two seconds, that would be describing it in the frequency domain. So a Fourier transform would take the data given in the time domain and convert that into the frequency domain. The function that does this is: X(f)=x(t)ej2πftdt.

The reverse is also possible. You can take the information from the frequency domain, and convert it into the time domain using an Inverse Fourier Transform.

From the Fourier Transform to the Inverse Fourier Transform

Lets start with the basic Fourier Transform: X(f)=x(t)ej2πftdt

Suppose that we have some function, say β(t), that is nonperiodic and finite in duration.
This means that β(t)=0 for some Tα<|t|

Now let's make a periodic function γ(t) by repeating β(t) with a fundamental period Tζ. Note that limTζγ(t)=β(t)
The Fourier Series representation of γ(t) is
γ(t)=k=αkej2πfkt where f=1Tζ
and αk=1TζTζ2Tζ2γ(t)ej2πktdt
αk can now be rewritten as αk=1Tζβ(t)ej2πktdt
From our initial identity then, we can write αk as αk=1TζB(kf)
and γ(t) becomes γ(t)=k=1TζB(kf)ej2πfkt
Now remember that β(t)=limTζγ(t) and 1Tζ=f.
Which means that β(t)=limf0γ(t)=limf0k=fB(kf)ej2πfkt
Which is just to say that β(t)=B(f)ej2πfktdf

So we have that [β(t)]=B(f)=β(t)ej2πftdt
Further 1[B(f)]=β(t)=B(f)ej2πfktdf

Some Useful Fourier Transform Pairs

[α(t)]=1αf(ωα)

[c1α(t)+c2β(t)] =(c1α(t)+c2β(t))ej2πftdt
=c1α(t)ej2πftdt+c2β(t)ej2πftdt
=c1α(t)ej2πftdt+c2β(t)ej2πftdt=c1A(f)+c2B(f)


[α(tγ)]=ej2πfγA(f)
[α(t)*β(t)]=A(f)B(f)
[α(t)β(t)]=A(f)*B(f)
Some other usefull pairs can be found here: Fourier Transforms

Another look at Fourier Transforms

Return to Signals and Systems