Abstract

Real-time identification of electrical equivalent circuit models (ECMs) is a critical requirement in many practical systems, such as batteries and electric motors. Significant work has been done in the past developing different types of algorithms for system identification using reduced-order ECMs. However, little work was done in analyzing the theoretical performance bounds of these system identification approaches. Given that both voltage and current are measured with error, proper understanding of theoretical bounds will help in designing a system that is economical in cost and robust in performance. In this article, we analyze the performance of a linear recursive least squares (RLS) approach to ECM identification and show that the LS approach is both unbiased and efficient when the signal-to-noise ratio is high enough. However, we show that when the signal-to-noise ratio is low-resembling the case in many practical applications-the LS estimator becomes significantly biased. Consequently, we develop a parameter estimation approach based on the total LS method and show it to be asymptotically unbiased and efficient at practically low signal-to-noise ratio regions. Further, we develop a recursive implementation of the total least square algorithm and find it to be slow to converge; for this, we employ a Kalman filter to improve the convergence speed of the total LS method. The resulting total Kalman filter (TKF) is shown to be both unbiased and efficient in ECM identification. The performance of this filter is analyzed using real-world current profiles under fluctuating signal-to-noise ratios. Finally, the applicability of the algorithms and analysis in this article in identifying higher-order electrical ECMs is explained.

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.