New algorithm promises 10x faster video compression

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, the mathematical operation used to decompose a function into its constituent frequencies. It is used to filter cell phone noise, generate WiFi transmissions, and compress audio, video, and image files.

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 details at

55 notes

  1. mathousai reblogged this from kenyatta
  2. somethingbysomeone reblogged this from ronenreblogs
  3. logicianmagician reblogged this from un
  4. gwenmcgregor reblogged this from ericmortensen
  5. noahfisher reblogged this from ronenreblogs
  6. ronenreblogs reblogged this from kenyatta and added:
    radicle* *(one particle of rad) I just learned about Fourier Transforms the other week! *(while demoing my new “I can...
  7. objectsareevents reblogged this from un
  8. stevewoolf reblogged this from kenyatta
  9. 8bitian reblogged this from ericmortensen
  10. iconolith reblogged this from un
  11. un reblogged this from ericmortensen and added:
    Now the battle to own it…
  12. ericmortensen reblogged this from kenyatta
  13. kenyatta posted this