Abstract
A time-recursive least-squares lattice estimation algorithm is presented. The reflection coefficients, k j , are estimated from residual energy estimates, \hat{RE}_{j} , so that |\hat{k}_{j}| for all j. Thus the stability of the inverse filter is guaranteed. Computation and storage may be reduced by normalizing the forward and backward prediction errors throughout the lattice by the square roots of estimates of their respective energies. Also, this ensures that all lattice quantities are bounded in magnitude by one, facilitating fixed-point implementation. The computational requirement of both normalized and unnormalized forms is proportional to the lattice order per time update.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
