Date: Sat, 01 Aug 1998 14:37:34 +0200 From: "IBS / Andre Oppermann" <andre@pipeline.ch> To: Stephen Hocking-Senior Programmer PGS Tensor Perth <shocking@prth.pgs.com> Cc: hackers@FreeBSD.ORG Subject: Re: Fast FFT routines with source? Message-ID: <35C30C0E.62EFC375@pipeline.ch> References: <199808010637.OAA04884@ariadne.tensor.pgs.com>
next in thread | previous in thread | raw e-mail | index | archive | help
Stephen Hocking-Senior Programmer PGS Tensor Perth wrote: > > I'm part way through porting this company's seismic data processing code to > FreeBSD and have got most things sorted out except for the fact that there > doesn't seem to be any carefully optimised fft routines available. I do have > the fftpack as found in ports, but I was wondering if there was anything > faster than taht available with source. You might take a look at: ftp://koobera.math.uic.edu/www/djbfft.html "djbfft is the fastest available code for small power-of-2 complex DFTs on a Pentium" "Current record for 256-point double-precision complex FFT: 18272 Pentium cycle" -- Andre To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-hackers" in the body of the message
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?35C30C0E.62EFC375>