Abstract

A discussion of linear prediction analysis methods that employ the Cholesky decomposition is given. Only one method insures stability of the synthesis filters by assuring that estimated reflection coefficients are bounded in magnitude by one. This estimate is generalized to one based on forward and backward prediction errors. An efficient computational algorithm based on Cholesky factorization is derived.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.