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 48150
The fast Fourier transform is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse.
0
votes
0
answers
109
views
What kind of Modulation causes "drops" in FFT Power Spectrum
I am analyzing a signal with FFT and I found an effect, that I do not understand. I am expecting to have an amplitude modulated signal. … As far as I know, if you compute the power of the FFT of an amplitude-modulated signal, you observe sidebands to the left and right of the carrier frequency. …
- 123