Mercurial > libavcodec.hg
view lzo.h @ 3467:33af013504d5 libavcodec
optionally (use_lpc=2) support Cholesky factorization for finding the lpc coeficients
this will find the coefficients which minimize the sum of the squared errors,
levinson-durbin recursion OTOH is only strictly correct if the autocorrelation matrix is a
toeplitz matrix which it is only if the blocksize is infinite, this is also why applying
a window (like the welch winodw we currently use) improves the lpc coefficients generated
by levinson-durbin recursion ...
optionally (use_lpc>2) support iterative linear least abs() solver using cholesky
factorization with adjusted weights in each iteration
compression gain for both is small, and multiple passes are of course dead slow
author | michael |
---|---|
date | Fri, 14 Jul 2006 18:48:38 +0000 |
parents | a2f611d6c34d |
children | c537a97eec66 |
line wrap: on
line source
#ifndef _LZO_H #define LZO_H #define LZO_INPUT_DEPLETED 1 #define LZO_OUTPUT_FULL 2 #define LZO_INVALID_BACKPTR 4 #define LZO_ERROR 8 #define LZO_INPUT_PADDING 4 #define LZO_OUTPUT_PADDING 12 int lzo1x_decode(void *out, int *outlen, void *in, int *inlen); #endif