> > I've posted here before that there is an O(1) algorithm for running min > and max: > Daniel Lemire, Streaming Maximum-Minimum Filter Using No More than Three > Comparisons per Element, Nordic Journal of Computing, Volume 13, Number 4, > pages 328-339, 2006 > http://arxiv.org/abs/cs/0610046
Thanks for pointing that out. Is it really O(1)? The paper claims O(1) comparisons (specifically 3) per sample, not O(1) operations per sample. Academic papers on algorithms use strange metrics sometimes. -Ethan On Mon, Jul 18, 2016 at 10:52 AM, Ross Bencina <rossb-li...@audiomulch.com> wrote: > On 19/07/2016 12:29 AM, Ethan Fenn wrote: > >> a $ b = max(|a|, |b|) >> >> which I think is what you mean when you describe the peak hold meter. >> Certainly an interesting application! And one where I don't think >> anything analogous to the Tito method will work. >> > > I've posted here before that there is an O(1) algorithm for running min > and max: > > Daniel Lemire, Streaming Maximum-Minimum Filter Using No More than Three > Comparisons per Element, Nordic Journal of Computing, Volume 13, Number 4, > pages 328-339, 2006 > > http://arxiv.org/abs/cs/0610046 > > Cheers, > > Ross. > > _______________________________________________ > dupswapdrop: music-dsp mailing list > music-dsp@music.columbia.edu > https://lists.columbia.edu/mailman/listinfo/music-dsp > >
_______________________________________________ dupswapdrop: music-dsp mailing list music-dsp@music.columbia.edu https://lists.columbia.edu/mailman/listinfo/music-dsp
