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.
|be quiet!'s Silent Base 800 case reviewed||6|
|MSI Aegis Ti wraps up SLIed GTX 1080s in an aggressive shell||36|
|Deals of the week: a Dell G-Sync monitor for $470 and more||15|
|Radeon Software Crimson Edition 16.7.3 serves up the bugfixes||7|
|AMD reveals the full specs of the Radeon RX 460 and RX 470||74|
|Nvidia will pay GeForce GTX 970 owners $30 over memory snafu||57|
|Gigabyte's GeForce GTX 1080 Xtreme Gaming graphics card reviewed||43|
|Microsoft's free Windows 10 upgrade offer ends tomorrow||133|
|ASRock H110M-STX mobo puts the 5x5 platform in builders' hands||15|
|Now you can install Crysis directly on the video card!||+66|