[PD] fft algorithms revisited

Orm Finnendahl finnendahl at folkwang-hochschule.de
Wed Apr 10 11:37:58 CEST 2002


I found another fft algorithm in the sources (mayer-buneman with
hartley transform), which I found in benchmark tests from 1993 


being ahead for vectors of size 64. I presume that is the one pd is
using for dsp computing or am I wrong? What's the other one for?
How does it compare to fftw? In another benchmark test 


this one seems to be faster, but those tests can be deceiptive.


More information about the Pd-list mailing list