Calculates the inverse of pfft_rfft_f, scaled by n. Before the method
is called, data should contain a complex sequence in the same format as the
result of pfft_rfft_f. It is assumed that the input sequence is a discrete
fourier transform of a real valued sequence, so the elements of the input
sequence not stored in data can be calculated from
DFT(f)i = DFT(f)[n - i]*. When the method completes, the array
contains the real part of the inverse discrete fourier transform of the
input sequence, scaled by n. The imaginary part is known to be equal to zero.
The length of the array must be equal to n and the array must be properly
aligned. To obtain a properly aligned array you can use pfft_allocate_f.
If you want to take care of memory allocation in some other way, you should
make sure that the address data is a multiple of the number returned by
pfft_alignment_f.
Calculates the inverse of pfft_rfft_f, scaled by n. Before the method is called, data should contain a complex sequence in the same format as the result of pfft_rfft_f. It is assumed that the input sequence is a discrete fourier transform of a real valued sequence, so the elements of the input sequence not stored in data can be calculated from DFT(f)i = DFT(f)[n - i]*. When the method completes, the array contains the real part of the inverse discrete fourier transform of the input sequence, scaled by n. The imaginary part is known to be equal to zero.
The length of the array must be equal to n and the array must be properly aligned. To obtain a properly aligned array you can use pfft_allocate_f. If you want to take care of memory allocation in some other way, you should make sure that the address data is a multiple of the number returned by pfft_alignment_f.