Loading...
Please wait, while we are loading the content...
Similar Documents
Data-sparse matrix computations Lecture 2 : FFT-The Fast Fourier Transform
| Content Provider | Semantic Scholar |
|---|---|
| Author | Sosa, Milena Upchurch, Paul |
| Copyright Year | 2017 |
| Abstract | It is without a doubt, one crucial piece of the toolbox of numerical methods. The FFT or Fast Fourier Transform is a fast algorithm used to compute the Discrete Fourier Transform. It is one of the most common discrete transforms used today. Note: While many other algorithms used throughout this course can be coded up for use in other projects, you shouldn't attempt to do this with the FFT. The FFT has been fine tuned over the past 20 to 30 years to include various optimizations and to account for different edge cases. Many different libraries for the FFT exist, but a good common library to use would be the FFTW (Fastest Fourier Transform in the West). |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.cs.cornell.edu/courses/cs6220/2017fa/CS6220_Lecture2.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
