[PD] OT: faster than Fourier transform

[Mathieu Bouchard]

Le 2012-01-20 à 23:55:00, Andy Farnell a écrit :

> Considering the paper is unpublished and sparse decomposition is a 
> pretty heavy topic I thought that is a really nice bit of science 
> journalism by Larry Hardesty. Since periodic music signals probably fit 
> the bill quite well it's good news for our kind of work.

Does it have better upper bounds ?

If not, it doesn't change much for realtime.

E.g. if I feed something somewhat like a white noise to this FFT, what 
exactly will it try skipping ? Every harmonic will be fairly nonzero.

  ______________________________________________________________________
| Mathieu BOUCHARD ----- téléphone : +1.514.383.3801 ----- Montréal, QC