Timeline for Help with a rather specific implementation of FFT Library?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 5, 2016 at 1:53 | vote | accept | Scorch | ||
| Mar 4, 2016 at 10:26 | answer | added | Majenko | timeline score: 2 | |
| Mar 4, 2016 at 9:20 | comment | added | Edgar Bonet | You are mixing things. There is the “Fourier transform” (FT), the “discrete Fourier transform” (DFT) and the “fast Fourier transform” (FFT). DFT is a generalization of FT for finite sets of data points. FFT is an efficient algorithm for computing a DFT when the number of data points is a power of two. The binning is a feature of the DFT arising from the finite nature of your data set, it has nothing to do with efficiency. “0-100 Hz” is a frequency range, not a resolution. What resolution do you need? | |
| Mar 4, 2016 at 0:40 | history | asked | Scorch | CC BY-SA 3.0 |