A team of MIT researchers have developed a new algorithm that improves on the fast Fourier transform (FFT). The Fourier transform is a method for representing an irregular signal as a combination of pure frequencies. The new MIT algorithm is up to ten times faster than the traditional FFT algorithm. The MIT algorithm is useful for image compression and can enable smart phones to wirelessly transmit large video files without draining batteries or consuming monthly bandwidth allotments. The new MIT algorithm will be presented this week at the Association for Computing Machinery’s Symposium on Discrete Algorithms (SODA).
The MathWorks announced a new version of Parallel Computing Toolbox that now provides an improved distributed array construct to enable MATLAB users to directly access from a MATLAB session data that is stored on multicore computers or computer clusters. In addition, key algorithms in Statistics Toolbox and Communications Toolbox now execute faster when run in conjunction with Parallel Computing Toolbox.