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.
|Corsair Lighting Node Pro brings light strip control to every PC||8|
|In the lab: Asus' Tinker Board SBC||14|
|In the lab: HyperX's Alloy FPS mechanical gaming keyboard||10|
|Team Group Cardea SSDs are ready to handle the heat||7|
|Gigabyte's Ryzen motherboards are home, home on the range||41|
|Zotac molds GTX 1050s into low-profile tiny terrors||7|
|TR forums spotlight: krazyredboy's crazy simulator PC||21|
|Deals of the week: a high-end Mini-ITX mobo, fast RAM, storage, and more||27|
|Steam Audio SDK promises better surround sound gratis||19|
|Best part of the article? We're flying home with Ryzen review samples as of this writing.||+44|