Chi2fit.FFT.fft

You're seeing just the function fft, go back to Chi2fit.FFT module for more information.

Specs

fft([real()], opts :: Keyword.t()) :: [complex()]

Calculates the discrete Fast Fourier Transform of a list of numbers.

Provides a parallel version (see options below). See [1] for details of the algorithm implemented.

Options

`:phase` - Correction factor to use in the weights of the FFT algorithm. Defaults to 1.
`:nproc` - Parellel version. Number of processes to use. See [2]. Defaults to 1.

References

[1] Zie: https://en.wikipedia.org/wiki/Cooley%E2%80%93Tukey_FFT_algorithm
[2] Parallel version of FFT; see http://www.webabode.com/articles/Parallel%20FFT%20implementations.pdf

Examples

iex> fft [4]
[{4.0, 0.0}]

iex> fft [1,2,3,4,5,6]
[{21.0, 0.0}, {-3.0000000000000053, 5.19615242270663},
          {-3.0000000000000036, 1.7320508075688736}, {-3.0, 0.0},
          {-2.9999999999999982, -1.7320508075688799},
          {-2.999999999999991, -5.196152422706634}]