Pridma's Article on Fourier Transforms: Difference between revisions

From Class Wiki
Jump to navigation Jump to search
Line 67: Line 67:
An ideal low pass filter would keep all the frequencies below a certain frequency, <math> f_{0} \!</math> and would discard all higher frequencies.
An ideal low pass filter would keep all the frequencies below a certain frequency, <math> f_{0} \!</math> and would discard all higher frequencies.


The transfer function of said system would have to be <math>H(f) = \{_{0, |f| > f_{0}}^{1, |f| < f_{0}}</math>.
The transfer function of said system would have to be <math>H(f) = \begin{Bmatrix} 0, |f| > f_{0} \\ 1, |f| < f_{0} \end{Bmatrix}</math>.


To build this into a circuit, we need to find the transfer function in the time domain. We can inverse Fourier transform <math>H(f) \!</math>.
To build this into a circuit, we need to find the transfer function in the time domain. We can inverse Fourier transform <math>H(f) \!</math>.

Revision as of 19:16, 11 October 2007

Mark's Wiki Article on Fourier Transforms

About the Fourier Transform

The Fourier Transform is a way to change a function of time into a function of frequency. This comes in very handy at times as it allows you to talk about a function in the frequency domain and will make some things very obvious about a function when you see it in the frequency domain that would not be very obvious in the time domain.

Formulas

The Fourier Transform is as follows:

where is the function in the time domain that you want to transform and is the transformed function which will be in the frequency domain.


The inverse Fourier Transform is similar:

Some Properties

The Derivative of x(t)

If you take the derivative of and if you know it's transform , you can easily find the transform of the derivative:

Time Shift

The time shift property of the Fourier Transform is fairly straight-forward as well.

This formula is actually fairly obvious... a time delay is really just a linear phase delay, which can be seen from the part of the inverse Forier Transform shown above.

Even and Odd Parts

You can also split up a function to a sum of it's even and odd parts and take a Fourier Transform using sine and cosine instead of .


where is the even part of and is the odd part of

Once you have the function split up into it's even and odd parts, you can use the following Fourier Transform formula:

Examples

Here are some examples of Fourier Transforms:

Useful Applications

One application of Fourier Transforms is in answering the question, "Why can't we build a brick-wall low pass filter?"

An ideal low pass filter would keep all the frequencies below a certain frequency, and would discard all higher frequencies.

The transfer function of said system would have to be .

To build this into a circuit, we need to find the transfer function in the time domain. We can inverse Fourier transform .

If we take a closer look at the transfer function, we'd notice that if we input an impulse function, the output would have to be non-causal: the output would be a sine wave extending from to ! So, it is impossible to build an exact "brick-wall" low pass filter, unless we know the input an infinite amount of time before it even happened!