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.
MIT researchers develop up to 10x faster Fourier transform algorithm
Posted on Friday, January 20 2012 @ 20:45 CET by Thomas De MaesschalckThe Tech Report writes data compression and wireless signal processing may get a speedup as MIT researchers have developed a new Fourier transform process that is up to ten times faster than the existing function.
