djbfft djbfft is a fast code for small power-of-2 complex DFTs on a Pentium. It's also reasonably fast on other machines. Note that, pfftw, a variant of fftw which is specifically optimized for the pentium and the ultrasparc processors, runs faster than djbfft on both machines. djbfft does a recursive in-place split-radix decimation-in-frequency FFT, with precomputed roots of unity, using my ``3 to -1'' improvement to chop the number of root loads in half. One split-radix pass fits nicely into the Pentium's 8 floating-point registers. For machines with more registers it would be better to do two passes at once.

Current Version:   0.76 License Type:   ??

Home Site: ftp://koobera.math.uic.edu/www/djbfft.html Source Code Availability: Yes Available Binary Packages: Debian Package:   No RedHat RPM Package:   No Other Packages:   No Targeted Platforms: Unix Software/Hardware Requirements: C compiler, like gcc or egcs

Other Links: None Mailing Lists/USENET News Groups: None User Comments: None See A Screen Shot? (Not Yet)

  SAL Home   |   Numerical Analysis   |   Misc