Researchers Discover Faster than Fast Fourier Transform

MIT researchers have discovered a way to increase the speed of Fourier Transform, a method for representing an irregular signal and one of the most fundamental concepts in the information sciences.

At the Association for Computing Machinery’s Symposium on Discrete Algorithms (SODA) this week, a group of MIT researchers will present a new algorithm that, in a large range of practically important cases, improves on the fast Fourier transform. Under some circumstances, the improvement can be dramatic — a tenfold increase in speed. The new algorithm could be particularly useful for image compression, enabling, say, smartphones to wirelessly transmit large video files without draining their batteries or consuming their monthly bandwidth allotments.

Read the Full Story.



 

Like what you're reading? Come back every day for HPC news, or subscribe to email or RSS updates. Trackback URL: http://insidehpc.com/2012/01/22/researchers-discover-faster-than-fast-fourier-transform/trackback/

Leave your own comment

Advertisement

Spectra Logig Ad

insideHPC.com is a production of insideHPC, LLC. © 2006-2013 Sitemap