ab01b2b82a
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
FFmpeg README ------------- 1) Documentation ---------------- * Read the documentation in the doc/ directory. 2) Licensing ------------ * Read the file COPYING. ffmpeg and the associated libraries EXCEPT liba52 and libpostproc are licensed under the Lesser GNU General Public License. * liba52 and libpostproc are distributed under the GNU General Public License and their compilation and use is optional in ffmpeg. Fabrice Bellard.