<html><head></head><body><div style="font-family: Verdana;font-size: 12.0px;"><div>
<div>
<div>Katjaas latency tester:</div>
<div><br/>
<a href="https://deref-gmx.net/mail/client/vVyPoU_ZpQs/dereferrer/?redirectUrl=http%3A%2F%2Fwww.pdpatchrepo.info%2Fhurleur%2Flatency-tester.pd" onclick="parent.phx.event.mailUrlClicked('http:\/\/www.pdpatchrepo.info\/hurleur\/latency-tester.pd'); return true;" target="_blank">http://www.pdpatchrepo.info/hurleur/latency-tester.pd</a></div>
<div> </div>
<div><a href="https://deref-gmx.net/mail/client/INqZGHNNlhw/dereferrer/?redirectUrl=https%3A%2F%2Fforum.pdpatchrepo.info%2Ftopic%2F7710%2Flatency-on-output-and-input%2F3" onclick="parent.phx.event.mailUrlClicked('https:\/\/forum.pdpatchrepo.info\/topic\/7710\/latency-on-output-and-input\/3'); return true;" target="_blank">https://forum.pdpatchrepo.info/topic/7710/latency-on-output-and-input/3</a></div>
</div>
<div>
<div name="quote" style="margin:10px 5px 5px 10px; padding: 10px 0 10px 10px; border-left:2px solid #C3D9E5; word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space;">
<div style="margin:0 0 10px 0;"><b>Gesendet:</b> Donnerstag, 13. Dezember 2018 um 15:51 Uhr<br/>
<b>Von:</b> "Roman Haefeli" <reduzent@gmail.com><br/>
<b>An:</b> pd-list@lists.iem.at<br/>
<b>Betreff:</b> Re: [PD] name of latency measurement algorithm</div>
<div name="quoted-content">On Thu, 2018-12-13 at 15:09 +0100, Peter P. wrote:<br/>
> * Roman Haefeli <reduzent@gmail.com> [2018-12-13 13:52]:<br/>
> > On Thu, 2018-12-13 at 13:21 +0100, Peter P. wrote:<br/>
> > > * Roman Haefeli <reduzent@gmail.com> [2018-12-13 11:58]:<br/>
> > > > Hey all<br/>
> > > ><br/>
> > > > I once read about a simple and robust way to perform latency<br/>
> > > > measurements with an audio signal.<br/>
> > > ><br/>
> > > > Explained in a few words, the test signal consists of a<br/>
> > > > sweeping<br/>
> > > > sine<br/>
> > > > tone. The return signal ring-modulates the source signal and<br/>
> > > > the<br/>
> > > > resulting signal consists of two frequencies, the sum (<br/>
> > > > f_src+f_ret<br/>
> > > > )<br/>
> > > > and difference ( f_src - f_ret), while the lower frequency is<br/>
> > > > proportional to the latency and can be detected quite easily<br/>
> > > > with with<br/>
> > > > e.g. [sigmund~].<br/>
> > > ><br/>
> > > > I have troubles finding the name of this algorithm and don't<br/>
> > > > remember<br/>
> > > > the original source. I would like to read more about it and<br/>
> > > > correctly<br/>
> > > > attribute the original author / inventor.<br/>
> > ><br/>
> > > See jack_delay on <a href="https://kokkinizita.linuxaudio.org/linuxaudio/" target="_blank">https://kokkinizita.linuxaudio.org/linuxaudio/</a><br/>
> ><br/>
> > That's a different algorithm and probably much more precise. The<br/>
> > one<br/>
> > I'm looking for is simpler (and I'd probably know how to implement<br/>
> > it<br/>
> > in Pd).<br/>
><br/>
> What about 7.stuff/tools/latency.pd?<br/>
<br/>
Cool, the collection of algorithms is growing :-)<br/>
<br/>
This is again a different approach. The test signal is a pulse and the<br/>
patch measures time between sending and receiving the click. The cool<br/>
thing is it's done in a way that doesn't need any "magic" objects like<br/>
[sigmund].<br/>
<br/>
However, it's still not the one I was describing earlier.<br/>
<br/>
Roman<br/>
<br/>
_______________________________________________<br/>
Pd-list@lists.iem.at mailing list<br/>
UNSUBSCRIBE and account-management -> <a href="https://lists.puredata.info/listinfo/pd-list" target="_blank">https://lists.puredata.info/listinfo/pd-list</a></div>
</div>
</div>
</div></div></body></html>