It looks like MIT has a new FFT algorithm.
If you want to, you can take a look at the link in this forum post:
http://encode.ru/threads/1461-New-Fast-Fourier-Transform-Algorithm?highlight=FFT
- FFT in D (using SIMD) and benchmarks a
- Re: FFT in D (using SIMD) and benchmarks Iain Buclaw
- Re: FFT in D (using SIMD) and benchmarks a
- Re: FFT in D (using SIMD) and benchmarks bearophile
- Re: FFT in D (using SIMD) and benchmarks Marco Leise
- Re: FFT in D (using SIMD) and benchmarks Robert Jacques
- Re: FFT in D (using SIMD) and benchmarks Manu
- Re: FFT in D (using SIMD) and benchmarks Iain Buclaw
- OT Trass3r
- Re: OT Jonathan M Davis
- Re: FFT in D (using SIMD) and benchmarks a
