[PD] fft algorithms revisited

Miller Puckette mpuckett at man104-1.ucsd.edu
Wed Apr 10 18:13:58 CEST 2002

Pd uses the "mayer" FFT, which seems to be the easiest to maintain of
any FFT code I've seen, but there are rumors of other packages running
much faster...


On Wed, Apr 10, 2002 at 11:37:58AM +0200, Orm Finnendahl wrote:
> Hi,
> I found another fft algorithm in the sources (mayer-buneman with
> hartley transform), which I found in benchmark tests from 1993 
> (http://www.geocities.com/ResearchTriangle/8869/1993_fft_summary.html)
> 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 
> (http://www.fftw.org/benchfft/results/pii-300.html)
> this one seems to be faster, but those tests can be deceiptive.
> Orm

More information about the Pd-list mailing list