steveu at coppice.org
Fri Jun 27 09:58:07 PDT 2003
Tom Bäckström wrote:
> The problems with Levinson -type algorithms and integrization are
> well known. Older codecs have usually solved the problem by using
> Schur decomposition for inversion of the autocorrelation matrix
> instead of Levinson. Another solution sometimes used is to use double
> precision - in this case you probably could code some pseudo-64bit
> implementation (using only 32bit commands), but that can become quite
> complex. I would recommend Schur. Both solutions require naturally
> more computations than Levinson, but that's what you get :)
> If you're unfamiliar with Schur I'd be glad to help, or you can
> check out any standard matrix computation manual, e.g. Golub, "Matrix
As you said, the Schur recursion is the standard trick in most vocoders,
so you can find an implementation in most vocoder source code. Take care
not to copy an implementation that has restrictions, though.
<p><p>--- >8 ----
List archives: http://www.xiph.org/archives/
Ogg project homepage: http://www.xiph.org/ogg/
To unsubscribe from this list, send a message to 'speex-dev-request at xiph.org'
containing only the word 'unsubscribe' in the body. No subject is needed.
Unsubscribe messages sent to the list will be ignored/filtered.
More information about the Speex-dev