## Revision ab01b2b8

ID | ab01b2b82a8077016397b483c2fac725f7ed48a8 |

Parent | 643326f7 |

Child | 77f173be |

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

Originally committed as revision 5747 to svn://svn.ffmpeg.org/ffmpeg/trunk

### Files

- added
- modified
- copied
- renamed
- deleted