MIT researchers develop up to 10x faster Fourier transform algorithm

Posted on January 20, 2012 - 20:45 CET by Thomas De Maesschalck

The 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.

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.

About the Author

Thomas De Maesschalck

Thomas has been messing with computer since early childhood and firmly believes the Internet is the best thing since sliced bread. Enjoys playing with new tech, is fascinated by science, and passionate about financial markets. When not behind a computer, he can be found with running shoes on or lifting heavy weights in the weight room.

Thanks. Your comment is waiting for moderation.

Your comment was published.

Human verification failed. Please try again.

Check your name and comment, then try again.

That name is reserved. Please choose another.

Comments (0)

No comments yet.

Share this story!

MIT researchers develop up to 10x faster Fourier transform algorithm

About the Author

Comments (0)

Leave a comment

Latest reviews