YOUR ACCOUNT

Home > Forums > General Discussion > 

Fourier Tranforms - MIT/UM breakthrough

Active Topics Search
Login or Register to post new topics or replies
CorvusCroax
CorvusCroax

Posts: 1227
Filters: 18
MIT and UMich researchers create 'nearly optimal' Fourier transforms.

Sounds like it would make an excellent FF node in FF 4.0!

http://web.mit.edu/newsoffice/2012/fa...-0118.html

Quote
The reason the Fourier transform is so prevalent is an algorithm called the fast Fourier transform (FFT), devised in the mid-1960s, which made it practical to calculate Fourier transforms on the fly. Ever since the FFT was proposed, however, people have wondered whether an even faster algorithm could be found.

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.
Posted: January 18, 2012 11:20 pm   Details E-Mail

Join Our Community!

Filter Forge has a thriving, vibrant, knowledgeable user community. Feel free to join us and have fun!

33,762 Registered Users
+5 new in 7 days!

153,621 Posts
+7 new in 7 days!

15,362 Topics
+66 new in year!

Create an Account

Online Users Last minute:

10 unregistered users.

Recent Forum Posts:

Join our Forum Join our Forum
Over 30 000 members!
Join us on Facebook Join us on Facebook
Over 42 000 likes!
Follow us on Twitter Follow us on Twitter
Get updates quickly!
Follow us on Instagram Follow us on Instagram
Tag us #filterforge