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 |
The fast Fourier transform is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse.
3
votes
Echo hiding technique
So far I have not experimented with audio steganography, but anyway, maybe these ideas are of some use for you.
Adding echoes to a signal is pretty easy as this process just adds a delayed version of …
1
vote
Noise removal from audio using FFT/Spectral editing
There exist solutions that are coarsely based on the idea that you propose: Threshold the spectrogram amplitudes to reduce/remove the noise part of the signal. Usually, this will bring about artifacts …
1
vote
Accepted
Combining channels into single FFT left/right vs mid/side
If I get you correctly, your first question is: What is more appropriate, taking the DFT (via the FFT algorithm) of the sum,
$$
\text{DFT}\left\{l + r\right\},
$$
or summing the DFTs
$$
\text{DFT}\left … $$
Due to the linearity of the DFT (and, hence, the FFT) they are the same
$$
\text{DFT}\left\{l + r\right\} = \text{DFT}\left\{l\right\} + \text{DFT}\left\{r\right\}.
$$
However, summing $l + r$ in …
1
vote
Accepted
Mid/Side encoding/decoding in frequency domain instead of time domain
The discrete Fourier transform (DFT, of which the FFT is an efficient implementation) is a linear transformation, i.e.,
$$
a\cdot\text{DFT}\{x\}+b\cdot\text{DFT}\{y\}=\text{DFT}\{a\cdot x+b\cdot y\}. …
1
vote
Accepted
Fast Fourier Transform using numpy
The choice for the second parameter of the FFT, the FFT length, depends on the specific application. You have to experiment what leads to the best results. …
0
votes
Accepted
What is the effect of reducing NFFT less than the signal length
The fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT). …