Re:History and Derivation of the Fast Fourier Transform
by thomasahle on Monday March 20, 2017 @04:39PM
(#13917462)
Also notice the awesome "Sparse FFT" https://groups.csail.mit.edu/netmit/sFFT/
which takes time just about `k log (n/k)` to recover the `k` largest coefficients. So often a complete Fourier transform is taken only to immediately discard nearly all of the computed values. (Compression for example.)
[ Parent
| on HN ]
There are no comments on this comment yet.