Sparse Fast Fourier Transform, The fasterthanfast Fourier transform 
Sparse Fast Fourier Transform, The fasterthanfast Fourier transform 
Feb 10 2012, 19:55
Post
#1


Group: Members Posts: 6 Joined: 27November 09 From: Argentina Member No.: 75344 
Hello.
I don't know if this topic was already mentioned here (I wasn't able to find it). Somebody here could find it interesting: MIT news article: The fasterthanfast Fourier transform sFFT web page: sFFT: Sparse Fast Fourier Transform Best regards. Omar 


Sep 23 2012, 00:48
Post
#2


Group: Members Posts: 22 Joined: 14January 12 Member No.: 96431 
Well, on Rockbox at least the FFT part of decoding can take up to 50% of CPU time (http://www.rockbox.org/wiki/FasterMDCT). Well it did until stripwax, mt and I rewrote it using a modern, efficient split radix FFT. Now its quite a bit faster. It's true that audio decoding is not really that much CPU intensive, but video encoding/decoding probably is another mater. Sure, but the DCT is usually only a pretty small portion of that. And of course you can already use approximations if you want (though usually people don't since its not very slow to begin with). Interesting, so how much CPU time does FFT uses on Rockbox nowadays? 


LoFi Version  Time is now: 1st February 2015  13:17 