Arbitrary N FFT
Where to get it

Click here to download mixfft05.zip, a package comprising the C-source for a very fast arbitrary N FFT routine as well as a benchmark program demonstrating the numerical capabilities and the performance of the routine.
 

Description
 

Mixfft v0.5 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.
 

Here is the readme.txt file if you want to take a look.
 

Registered user

If you decide to use my routine either in a product or on a regular basis you (or your company) must pay a fee to become a registered user.
 

Pay with your credit card through RegNow (secure transaction using SSL)
 

Questions

If you have any questions please don’t hesitate to e-mail me. You can also take a look on some questions and answers I have collected from the past.
 

[Home] [About] [FFT] [FFT FAQ] [Games] [ECC] [3D Gravity] [FIR Filter] [Home-Dk]