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 7899
The fast Fourier transform is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse.
0
votes
Using FFT as a channeliser
Use of the fft provides a resource efficient way to implement a bank of bandpass filters. You don't have to use an fft, but you'd require more multiply/add operations without it. … The Fred Harris book "Multirate Signal Processing" does a pretty good job of explaining how one arrives at the FFT implementation. …
- 131
6
votes
Accepted
Measure the SNR of a signal in the frequency domain?
If your sine wave happens to fall at an FFT bin center, things are a little easier. If your sine wave happens to not fall at a bin center, you have to consider spectral leakage. … A simple technique to estimate the signal power would be to sum the squared magnitudes of the FFT bins with most of the signal's energy (i.e. the largest bins). …
- 131