I'm wondering if there's a way to speed up the initial convergence time. Maybe I'm completely off base here, but specifically I was wondering if the code starts the search assuming the echo is near to zero, and works longer to find the adapted point. If so, is there a way to have it reverse the search, that is, start with the assumption that the echo is furthest from zero? In my case, the echo will almost certainly always be pretty far out in the window... I'm sure my terminology isn't right, but does my question make sense? Thanks, Mark. -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.xiph.org/pipermail/speex-dev/attachments/20091104/b09453c2/attachment.htm