On 30.05.2016 14:49, Marcus Müller wrote:
And because "DFT" is not totally unambiguous (because there are different normalization conventions out there), if you care for the actual formula, it's on
I can't find its' implementation in anywhere so that I can't understand what happen in this function.A DFT is performed, by calling the fftwf_execute function of the FFTw library, which really, just executes a fast DFT.
http://www.fftw.org/doc/The-1d-Discrete-Fourier-Transform-_0028DFT_0029.html#The-1d-Discrete-Fourier-Transform-_0028DFT_0029
i.e. the backwards (inverse) n-point FFT is really just plain, old, boring, textbook

No normalization.
Best regards,
Marcus
No comments:
Post a Comment