Welcome Guest ( Log In | Register )

Sparse Fast Fourier Transform, The faster-than-fast Fourier transform
16 Hz
post Feb 10 2012, 19:55
Post #1

Group: Members
Posts: 8
Joined: 27-November 09
From: Argentina
Member No.: 75344

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 faster-than-fast Fourier transform

sFFT web page: sFFT: Sparse Fast Fourier Transform

Best regards.

Go to the top of the page
+Quote Post
Start new topic
post Sep 23 2012, 00:48
Post #2

Group: Members
Posts: 24
Joined: 14-January 12
Member No.: 96431

QUOTE (saratoga @ Sep 22 2012, 20:30) *
QUOTE (m45t3r @ Sep 22 2012, 19:25) *
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.

QUOTE (m45t3r @ Sep 22 2012, 19:25) *
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?
Go to the top of the page
+Quote Post

Posts in this topic

Reply to this topicStart new topic
1 User(s) are reading this topic (1 Guests and 0 Anonymous Users)
0 Members:


RSS Lo-Fi Version Time is now: 28th November 2015 - 00:12