Igor Carron's blog is also worth a look:
http://nuit-blanche.blogspot.com.au/
On 23/08/2016 12:27 AM, Bjorn Roche wrote:
In case you can't access that link, he doesn't give much info about
how System Compression works
___
dupswapdrop: music-dsp
Thanks for the info, very interesting! (:
On Sun, Aug 21, 2016 at 8:34 PM, Ross Bencina
wrote:
> [Sorry about my previous truncated message, Thuderbird is buggy.]
>
> I wonder what the practical musical applications of sFFT are, and whether
> any work has been
A guy on the linkedin DSP group posted about "System Compression" as well,
which is related to compressive sensing. I haven't looked into it at all,
but here's the link:
https://www.linkedin.com/groups/144812/144812-6155834561751191554
In case you can't access that link, he doesn't give much
[Sorry about my previous truncated message, Thuderbird is buggy.]
I wonder what the practical musical applications of sFFT are, and
whether any work has been published in this area since 2012?
> http://groups.csail.mit.edu/netmit/sFFT/hikp12.pdf
Last time I looked at this paper, it seemed
On 22/08/2016 3:08 AM, Max Little wrote:
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.
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.
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?