HW: Difference between revisions
No edit summary |
No edit summary |
||
| Line 5: | Line 5: | ||
Unfortunately, the Fourier Transform isn't a Transformer. |
Unfortunately, the Fourier Transform isn't a Transformer. |
||
[[Image:transformer_roolbar.jpg]] |
[[Image:transformer_roolbar.jpg]] |
||
So, what is a Fourier Transform? |
|||
<br>Check any of the other pages on this site to find fifty different ways to explain what a Fourier Transform is. If you already know what it is, or you're too lazy to look at the other pages, here's my super trite description: |
<br>Check any of the other pages on this site to find fifty different ways to explain what a Fourier Transform is. If you already know what it is, or you're too lazy to look at the other pages, here's my super trite description: A Fourier Transform is a bunch of sinusoids of different frequencies and time offsets added together create a just about any function you want. A Fourier Transform is the way of representing a function in the frequency domain instead of the time domain. This is especially helpful in Linear Time Invariant Systems, As we are learning this quarter. |
||
Revision as of 22:14, 11 October 2007
Fourier Transform Applications
Unfortunately, the Fourier Transform isn't a Transformer.
So, what is a Fourier Transform?
Check any of the other pages on this site to find fifty different ways to explain what a Fourier Transform is. If you already know what it is, or you're too lazy to look at the other pages, here's my super trite description: A Fourier Transform is a bunch of sinusoids of different frequencies and time offsets added together create a just about any function you want. A Fourier Transform is the way of representing a function in the frequency domain instead of the time domain. This is especially helpful in Linear Time Invariant Systems, As we are learning this quarter.
Fourier Transform Applications
The "Fast" Fourier Transform
What is a Fast Fourier Transform? (FFT)
It's an algorithm that can compute the discrete Fourier transform faster than other algorithms. In digital systems, continuous Fourier Transforms are sampled, turning them into discrete Fourier Transforms which then can be computed and manipulated using Digital Signal Processing.
An intuitive brute force way of computing a Fourier Transform means rearranging the the summation so that you don't compute the transform in sequential order - you group similar elements together and simplify before combining them. This cuts down the adding and multiplying, thus cutting computation time down by about 100 times.
Cooley-Turkey Algorithm
One of the most popular FFT algorithms is the Cooley-Turkey algorithm. Which I will explain on Friday.