| Name | Description |
---|
  | InverseReal(Double, Int32, FourierOptions) |
Packed Real-Complex inverse Fast Fourier Transform (iFFT) to arbitrary-length sample vectors.
Since for real-valued time samples the complex spectrum is conjugate-even (symmetry),
the spectrum can be fully reconstructed form the positive frequencies only (first half).
The data array needs to be N+2 (if N is even) or N+1 (if N is odd) long in order to support such a packed spectrum.
|
  | InverseReal(Single, Int32, FourierOptions) |
Packed Real-Complex inverse Fast Fourier Transform (iFFT) to arbitrary-length sample vectors.
Since for real-valued time samples the complex spectrum is conjugate-even (symmetry),
the spectrum can be fully reconstructed form the positive frequencies only (first half).
The data array needs to be N+2 (if N is even) or N+1 (if N is odd) long in order to support such a packed spectrum.
|