Analyze.FFTSourceSimple implementation of the FFT algorithm. For fastest implementations optimized libraries such as fftw are recommended.
Internal data for computing FFT.
complex_create buf create a array of complex numbers by copying data from buf (the imaginary part is null).
Frequency associated to the k-th coefficient of an FFT.
Windowing functions. Thses can be used to on complex buffers in order to improve the quality of the FFT, see http://en.wikipedia.org/wiki/Windowing_functions.