On Friday, November 22, 2019 at 8:37:37 AM UTC-8, MatthewA wrote:
Is there any info on how to implement fft and ifft algorithms
that aren't recursive? I'd like to possibly calculate a really
long on inside a signal chain so attempting to compute
a 2 second fft in one function call would probably be disastrous.
The FFT is defined through recursion, but rarely implemented that way.
The recursive definition makes it easy to see where the log(N)
comes from, though.
It is rarely most efficient to write recursive algorithms using
actual recursion, the recursive descent compiler possibly being
an exception.
As for FFT, it isn't hard to describe in parallel terms, but the
array element access pattern complicates the implementation on
some hardware.
--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)