Conventions: The exponent is positive and the factor is 1/N, i.e., output[j] := (1 / N) sum[ exp(+2 PI i j k / N) input[k] ].
Fft.inverseFft
Complex!F[] inverseFft(F = double, R)(R range) if (isRandomAccessRange!R && isComplexLike!(ElementType!R) && isFloatingPoint!F) constComputes the inverse Fourier transform of a range. The range must be a random access range with slicing, have a length equal to the size provided at construction of this object, and contain elements that are either of type std.complex.Complex or have essentially the same compile-time interface.
Returns
The time-domain signal.
void inverseFft(Ret, R)(R range, Ret buf) if (isRandomAccessRange!Ret && isComplexLike!(ElementType!Ret) && hasSlicing!Ret) constInverse FFT that allows a user-supplied buffer to be provided. The buffer must be a random access range with slicing, and its elements must be some complex-like type.