Fast Fourier Transform - A case study » Historique » Version 1
Anonyme, 02/12/2010 09:32
| 1 | 1 | Anonyme | h1. Fast Fourier Transform - A case study |
|---|---|---|---|
| 2 | |||
| 3 | h2. Presentation |
||
| 4 | |||
| 5 | The fast Fourier transform (commonly abbreviated FFT) is one of the more recurring algorithm. In embedded systems, and more particularly in signal processing applications, we often need a "ready to go" FFT algorithm on a particular target. When we deal often enough with FFT, we know FFTW, a popular free library which runs at an impressive speed on computers. Despite the fact this library is developed in a portable way, we currently don't know how fast it is on a special target, like the RX62N. |