Abstract
Theoretical analysis is used to evaluate the mean and second-moment properties of recursive least squares algorithms incorporating the fast exact initialization and soft constrained initialization methods during the initialization period. It is shown that the weight vector mean and covariance produced by fast exact initialization are undefined for this period. Theoretical results are derived for soft constrained initialization that show that the weight vector mean and covariance are finite, and expressions are given for these quantities. Simulations for various cases are presented to support the accuracy of these theoretical results. >
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.
