Not sure what you mean by this being 'real', but indeed there are faster algorithms than the FFT if the signal is 'sparse' (or approximately sparse) in the Fourier domain. This is essentially the same idea as in compressed sensing, where you can 'beat' the Nyquist criterion for sparse signals. Have a look at:
http://groups.csail.mit.edu/netmit/sFFT/hikp12.pdf Max On 21 August 2016 at 15:30, Alan Wolfe <alan.wo...@gmail.com> wrote: > This article has been getting shared and reshared by some graphics > professionals / researchers I know on twitter. > > The article itself and arxiv paper are from 2012 though, which makes me > wonder why we haven't heard more about this? > > Does anyone know if this is real? > > http://m.phys.org/news/2012-01-faster-than-fast-fourier.html > > > _______________________________________________ > dupswapdrop: music-dsp mailing list > music-dsp@music.columbia.edu > https://lists.columbia.edu/mailman/listinfo/music-dsp -- Max Little (www.maxlittle.net) Associate Professor, Aston University TED Fellow (fellows.ted.com/profiles/max-little) Visiting Associate Professor, MIT Senior Research Fellow, University of Oxford Room MB312, Aston University Aston Triangle, Birmingham, B4 7ET, UK UK +44 7710 609564/+44 121 204 5327 Skype dr.max.little _______________________________________________ dupswapdrop: music-dsp mailing list music-dsp@music.columbia.edu https://lists.columbia.edu/mailman/listinfo/music-dsp
