Display the source code in std/numeric.d from which this page was generated on github.

If you spot a problem with this page, click here to create a Bugzilla issue.

Quickly fork, edit online, and submit a pull request for this page. Requires a signed-in GitHub account. This works well for small changes. If you'd like to make larger changes you may want to consider using local clone.

`std.numeric.Fft.inverseFft` - multiple declarations

Function Fft.inverseFft

Computes 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.


						
				Complex!F[] inverseFft(F, R)
				(
				

				  R range
				

				) const
				

				if (isRandomAccessRange!R && isComplexLike!(ElementType!R) && isFloatingPoint!F);

Returns

The time-domain signal.

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] ].

Function Fft.inverseFft

Inverse 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.


						
				void inverseFft(Ret, R)
				(
				

				  R range,
				

				  Ret buf
				

				) const
				

				if (isRandomAccessRange!Ret && isComplexLike!(ElementType!Ret) && hasSlicing!Ret);

Authors

Andrei Alexandrescu, Don Clugston, Robert Jacques, Ilya Yaroshenko

License

Boost License 1.0.

API Documentation

std.numeric.Fft.inverseFft - multiple declarations

Function Fft.inverseFft

Returns

Conventions

Function Fft.inverseFft

Authors

License

`std.numeric.Fft.inverseFft` - multiple declarations