Forward real-complex FFT speed test
| Implementation | Result | Time (first half) | Time (second half) | Rate (second half) |
| Nayuki | | | | |
| Nayuki (obj) | | | | |
| KissFFT | | | | |
| Cross | | | | |
| FFTW | | | | |
| Nockert | | | | |
| Dntj | | | | |
Notes
- Nayuki: in-place double-precision (native JS number type) complex-complex. Around 7kb.
- Nayuki (obj): Nayuki with the sin/cos tables pre-calculated on object construction. Around 4kb.
- Nockert: double-precision real-complex. Around 25kb.
- Dntj: double-precision complex-complex. Forward
transform is scaled and I've scaled it back again here. Around 10kb.
- Cross: double-precision real-complex in C, compiled
with Emscripten. This is considered a slow implementation amongst
native code ones. Around 60kb.
- KissFFT: single-precision real-complex in C, compiled
with Emscripten. A reasonably sophisticated implementation. Around
70kb.
- FFTW: single-precision real-complex in C, compiled with
Emscripten. GPL licensed. Around 3Mb.