TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Leaner Fourier transforms

3 pointsby prateekjover 11 years ago

1 comment

mtdewcmuover 11 years ago
I looked up the sparse FFT, which this is about. It looks like a nice transform, but I think this article misrepresented it a bit. The article makes it sound like they found a new, much faster alternative to the FFT. In fact, their algorithm allows you to compute a limited part of the spectrum if you know the signal is sparse in the frequency domain. Most of the uses for the FFT are not sparse, so this is a special-purpose transform.