Abstract
Analysis of error propagation in an optimal bounding ellipsoid (OBE) algorithm is performed which shows that the errors in the estimates due to an initial perturbation are bounded. Simulation results demonstrate that the OBE algorithm can perform better than the conventional recursive least squares (RLS) in small wordlength environments. The analysis presented could also be applied for the finite-precision analysis of recursive weighted least squares algorithms. >
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.
