Timeline for Understanding FFT: FFT size and bins
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Jan 29, 2023 at 1:22 | history | edited | lennon310 | CC BY-SA 4.0 |
fix typos and whitespace/formatting
|
| S Jan 29, 2023 at 1:22 | history | suggested | Oreo | CC BY-SA 4.0 |
fix typos and whitespace/formatting
|
| Jan 28, 2023 at 23:40 | review | Suggested edits | |||
| S Jan 29, 2023 at 1:22 | |||||
| Jul 14, 2022 at 21:00 | history | tweeted | twitter.com/StackSignals/status/1547687383809675265 | ||
| Mar 31, 2018 at 12:56 | comment | added | Cedron Dawg | Try searching on "Discrete Fourier Transform" or "how does a DFT work" instead of "how does a FFT work". A Fast Fourier Transform is a computational shortcut of a Discrete Fourier Transform. With the latter search you are more likely to find info on the computational efficiency rather than the underlying process. I don't see how you can expect somebody to explain the fundamentals better in a quick forum answer than a bunch of web sites dedicated to doing just that. The first four articles in my blog should be useful to you too. Start with dsprelated.com/showarticle/754.php. | |
| Mar 31, 2018 at 12:40 | comment | added | Bouji | I actually did search a lot but i couldn't understand, but maybe i'm just too slow. thank you for your concern. | |
| Mar 31, 2018 at 12:39 | vote | accept | Bouji | ||
| Mar 31, 2018 at 4:10 | answer | added | Erik | timeline score: 12 | |
| Mar 30, 2018 at 20:56 | comment | added | Cedron Dawg | These questions can be answered with just a little bit of internet searching and reading. I also recommend that you start your coding with mathematically constructed signals of fairly short duration and apply your FFT software to those and examine the results. | |
| Mar 30, 2018 at 19:30 | review | First posts | |||
| Mar 30, 2018 at 20:12 | |||||
| Mar 30, 2018 at 19:29 | history | asked | Bouji | CC BY-SA 3.0 |