Computes discrete fourier transform. re should contain the real
part of the input sequence and im the imaginary part of the sequence. The
length of the input sequence should be equal to the number that was passed
to pfft_table_f when creating table. The method operates in place - the
result is saved back to re and im. Both arrays must
be properly aligned. An easy way to obtain a properly aligned block of memory
is to use pfft_allocate_f. If you want to take care of memory allocation in
some other way, you should make sure that the addresses re and im are multiples
of the number returned by pfft_alignment_f.
Computes discrete fourier transform. re should contain the real part of the input sequence and im the imaginary part of the sequence. The length of the input sequence should be equal to the number that was passed to pfft_table_f when creating table. The method operates in place - the result is saved back to re and im. Both arrays must be properly aligned. An easy way to obtain a properly aligned block of memory is to use pfft_allocate_f. If you want to take care of memory allocation in some other way, you should make sure that the addresses re and im are multiples of the number returned by pfft_alignment_f.