🚀 go-pugleaf

I have released mixfft03.zip, comprising the C-source for a very fast
arbitrary N FFT routine as well as a benchmark program demonstrating
the numerical capabilities of the routine.

mixfft03.zip (38701 bytes) is available at:

ftp://dspsun.eas.asu.edu/pub/comp.speech/analysis/mixfft03.zip
ftp://ftp.pacificorp.com/.0/msdos/c/mixfft03.zip
ftp://ftp.hk.super.net/.1/simtel/msdos/c/mixfft03.zip
ftp://ftp.uoknor.edu/mirrors/SimTel/msdos/c/mixfft03.zip
ftp://ftp.hzeeland.nl/pub/simtel-msdos/c/mixfft03.zip
ftp://ftp.uni-heidelberg.de/pub/simtel/c/mixfft03.zip
ftp://ftp.doc.ic.ac.uk/computing/systems/ibmpc/simtel/msdos/c/mixfft03.zip
ftp://ftp.duth.gr/pub/dos/SimTel/c/mixfft03.zip
ftp://ftp.nus.sg/pub/zj/msdos/c/mixfft03.zip
ftp://ftp.technion.ac.il/pub/unsupported/simtel/msdos/c/mixfft03.zip
ftp://ftp.wustl.edu/.archive02/systems/ibmpc/simtel/msdos/c/mixfft03.zip
ftp://oak.oakland.edu/simtel/msdos/c/mixfft03.zip
ftp://ftp.cs.cuhk.hk/pub3/simtel/msdos/c/mixfft03.zip

MIXFFT v0.3 contains the C source for a mixed-radix FFT routine.
It performs a fast discrete Fourier transform (FFT) of a complex
sequence, x, of an arbitrary length, n. The output, y, is also a
complex sequence of length n.

The routine is accompanied by a demo program, fftbench.c,  that
demonstrates the numerical capabilities. It measures the execution
time as well. If you wish to test the capabilities of another FFT
routine, the fftbench.c is easy to modify.

The C-source is ShareWare. Please read the text file included in
the package before using the FFT routine commercially.

Please send comments, suggestions and questions to the address below.

Jens J. Nielsen
jnielsen@internet.dk