Mercurial > hg > js-dsp-test

comparison fft/test.html @ 10:ae456984c912

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Doc
author Chris Cannam
date Mon, 05 Oct 2015 14:03:34 +0100
parents c6577c4b3780
children 9619d2da67c2
comparison
equal deleted inserted replaced
9:4047f95598b3 10:ae456984c912
46 <h3>Notes</h3> 46 <h3>Notes</h3>
47 47
48 <ul> 48 <ul>
49 <li><b>Nayuki</b>: in-place single-precision complex-complex</li> 49 <li><b>Nayuki</b>: in-place single-precision complex-complex</li>
50 <li><b>Nockert</b>: double-precision real-complex</li> 50 <li><b>Nockert</b>: double-precision real-complex</li>
51 <li><b>Nayuki</b>: double-precision complex-complex. Forward transform is scaled and I've scaled it back again here, which may introduce rounding error.</li> 51 <li><b>Nayuki</b>: double-precision complex-complex. Forward
52 <li><b>Cross</b>: double-precision real-complex in C, compiled with Emscripten. This is considered a slow implementation amongst native code ones.</li> 52 transform is scaled and I've scaled it back again here, which may
53 <li><b>KissFFT</b>: single-precision real-complex in C, compiled with Emscripten. This should be a faster implementation than Cross.</li> 53 introduce rounding error.</li>
54 <li><b>Cross</b>: double-precision real-complex in C, compiled
55 with Emscripten. This is considered a slow implementation amongst
56 native code ones.</li>
57 <li><b>KissFFT</b>: single-precision real-complex in C, compiled
58 with Emscripten. This should be faster than Cross. Despite its
59 name, it is the most sophisticated implementation here.</li>
54 </ul> 60 </ul>
55 61
56 <h3>Rationale</h3> 62 <h3>Rationale</h3>
57 63
58 <p>If 2150 iterations of real-to-complex FFT of size 2048 takes less 64 <p>If 2150 iterations of real-to-complex FFT of size 2048 takes less