A group of MIT researchers has developed a new algorithm that improves upon the fast Fourier transform. In some situations, the algorithm is claimed to be 10 times faster than the existing function, which is good news for computing applications. The fast Fourier transform allows computers to decompose irregular signals into their component frequencies; it's used in everything from data compression to wireless signal processing, so a faster version has potentially wide-ranging applications.
The new algorithm is described in this paper, which is filled with equations that make my head spin this early on a Friday. As I understand it, the new approach is particularly applicable to "sparse" signals that have a small number of heavily weighted frequencies. Most of the "normal signals" in nature are sparse, according to one researcher, and the algorithm can better isolate their heavily weighted frequencies with a series of overlapping filters.
Audio and video compression routines seem likely to benefit from the new algorithm, and that's probably just the tip of the iceberg. We don't yet know how long it will take for actual implementations to be released into the wild, though.
|1. Hdfisise - $600||2. Ryszard - $503||3. Andrew Lauritzen - $502|
|4. the - $306||5. SomeOtherGeek - $300||6. Ryu Connor - $250|
|7. doubtful500 - $200||8. Anonymous Gerbil - $150||9. webkido13 - $135|
|10. cygnus1 - $126|
|Nvidia recalls Shield Tablet due to battery fire risk||37|
|Friday Night Shortbread||67|
|Mozilla CEO protests Win10's default application setup process||110|
|Deals of the week: Samsung's 850 EVO 1TB for $310 and more||51|
|Report: new Google Glass is a clip-on model for businesses||13|
|14 million have upgraded to Windows 10 in its first 24 hours||87|
|EVGA X99 Micro 2 mobo offers USB-C in a microATX package||13|
|The Tech Report Podcast is live on Twitch||6|
|Wake-from-sleep vulnerability leaves UEFIs open to attack||48|