Rick van Rein wrote: > Hello, > > This would seem to be of interest to Codec2: a Faster-than-Fast > Fourier Transform designed especially for sparsely filled spectra: > > News article: > http://web.mit.edu/newsoffice/2012/faster-fourier-transforms-0118.html > > Paper (free download, as public-funded research ought to be): > http://arxiv.org/abs/1201.2501v1 > > The algorithm achieves O(k.log(n)) if the input signal has at > most k non-zero Fourier coefficients. In terms of Codec2, we > could expect k=10 over 320 samples, so O(2663) becomes O(133). > > Roughly -- and background noise would worsen these figures. > The Codec2 encoder spends about 1/3 of its time in FFT. > > > Cheers, > -Rick > > An alternative would be to use FFTW instead of Kiss-FFT, which runs roughly twice as fast, presumably by pre-computing the required sine/cosine values used in the transform.
------------------------------------------------------------------------------ Keep Your Developer Skills Current with LearnDevNow! The most comprehensive online learning library for Microsoft developers is just $99.99! Visual Studio, SharePoint, SQL - plus HTML5, CSS3, MVC3, Metro Style Apps, more. Free future releases when you subscribe now! http://p.sf.net/sfu/learndevnow-d2d _______________________________________________ Freetel-codec2 mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/freetel-codec2
