Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with fft
Search options not deleted
user 41726
The fast Fourier transform is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse.
0
votes
Detecting a three-tone signal in real-time
Is that the FFT of your beep signal or of the beep mixed in with voice? Have you windowed the data? … What does the FFT look like if you use a larger frequency spacing in your FFT (fewer data points)? …
- 31
3
votes
1
answer
308
views
Is it possible to approximate given skewness and kurtosis values using an IFFT?
The FFT of the signal shows that it's not broadband random -- it's generally flat below 100 Hz and tapers off at about -3 dB/oct above 100 Hz up to a Nyquist of 400 Hz. … noise, scaling its frequency components to match a desired FFT spectrum, and performing an IFFT to convert to time domain. …
- 31