This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
fft [Mon Jun 3 15:42:02 2013] Alexander |
fft [Mon May 12 18:27:15 2014] Alexander |
||
---|---|---|---|
Line 3: | Line 3: | ||
Fast Fourier transform algorithm computes discrete Fourier transform exactly and is used to considerably speed up the calculations.\\ Note that FFT is not an approximate method of calculation. | Fast Fourier transform algorithm computes discrete Fourier transform exactly and is used to considerably speed up the calculations.\\ Note that FFT is not an approximate method of calculation. | ||
- | |||
- | MagicPlot uses the algorithm of FFT that does not necessarily require the number of points //N// to be an integer power of 2, though in such a case evaluation is faster. MagicPlot uses [[http:// | ||
{{: | {{: | ||
- | ===== Formulas | + | ===== Parameters |
+ | |||
+ | ^ Sampling Interval | ||
+ | ^ Real, \\ Imaginary | ||
+ | ^ Forward / \\ Inverse | ||
+ | ^ 1/N in forward transform | ||
+ | ^ Center zero frequency | ||
+ | |||
+ | ===== Algorithm ===== | ||
+ | |||
+ | MagicPlot uses the algorithm of FFT that does not necessarily require the number of points //N// to be an integer power of 2, though in such a case evaluation is faster. MagicPlot uses [[http:// | ||
==== Discrete Fourier Transform Formulas ==== | ==== Discrete Fourier Transform Formulas ==== | ||
By default MagicPlot uses ' | By default MagicPlot uses ' | ||
Line 47: | Line 56: | ||
* Missing values in the end of the column are ignored. | * Missing values in the end of the column are ignored. | ||
- | |||
- | ===== Parameters ===== | ||
- | ^ Sampling Interval | ||
- | ^ Real, \\ Imaginary | ||
- | ^ Forward / \\ Inverse | ||
- | ^ 1/N in forward transform | ||
- | ^ Center zero frequency | ||
===== See Also ===== | ===== See Also ===== | ||
* [[processing]] | * [[processing]] |