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
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
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 Search options user 25163

The fast Fourier transform is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse.

0
votes
2answers
For plotting a Power Spectral Density graph based on FFT results, I had used two different approaches, but they produced very different results, and it'd be great if anyone knows why. Note: From … sided periodogram). So the idea was implemented as: $$PSD(f) \cong \frac{2}{f_s N} \left| FFT(x_n) \right|^2 $$ Note: As per one of the responses, APPROACH #1 would've been more accurately …
asked Jan 23 '17 by plu
1
vote
3answers
Would anyone know if there is any relationship between the FFT amplitude vs. data length? For instance, in Matlab, if signal_30k had 30,000 data points, sampled at 1000 Hz, and I do this … : fft_amplitudes = abs( fft( signal_30k ) ); then dominant frequency's resulting amplitude is some number. but the same signal with the same frequency components, signal_500k had 500,000 data points, also …
asked Dec 1 '16 by plu