FFFT?

Last week I posted on twitter about an upcoming paper to be presented at SODA (Symposium on Discrete Algorithms). The new algorithm for the calculation of the Nearly Optimal Sparse Fourier Transform (Abstract). This new algorithm for certain specialized cases of the Discrete Fourier Transform, which allows processing of digital signals to create JPEG images, MP3’s and a whole host of other useful formats. The proposed optimization could lead to as much as a ten-fold increase in processing speed. The paper is currently available online!

Share this post
  , , , ,


Leave a Reply

Your email address will not be published. Required fields are marked *