netterfield at astro.utoronto.ca
Wed Nov 2 16:28:48 CET 2005
The one we use is the same speed as fftw, but is *much* easier to install and
use. As a consequence, we have never had problems with people unable to
install fftw first (for some, installing fftw is a bit of an adventure...).
As I said, as far as I know, the only downside is the restriction to 2^N
On November 2, 2005 02:31 am, Brisset, Nicolas wrote:
> > I can't help but think that our PSD algorithm could be a
> > point of improvement too. It's a big glaring hotspot in the
> > profiler, comparable to the equation interpreter (which
> I have always wondered why kst uses its own FFT algorithms instead of
> using the apparently very common libfftw library, which I suppose has
> been optimized (I have never checked, though)...
> Kst mailing list
> Kst at kde.org
More information about the Kst