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 50276
The fast Fourier transform is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse.
1
vote
0
answers
226
views
Finding natural frequency from vibration analyzer data
I was asked to find the natural frequency from a waveshape obtained from vibration analyzer, and I performed an FFT and told that the peak represents the natural frequency. …
- 123
1
vote
2
answers
2k
views
What is the advantage of overlapping windows while evaluating Spectrogram?
I've seen many documents that refer to calculate spectrogram through overlapping windows but haven't found clear documents on why this is done and how to calculate the number of points that need to be …
- 123