Computational Burden Reduction in Real-Time System Identification of Multi-Rail Power Converter by Re-using Covariance Matrix Approximation

Jin Xu, Matthew Armstrong, Maher Al-Greer

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper presents an approach to significantly reduce the computational burden of typical recursive algorithms used for real-time system identification. Recursive algorithms, such as Affine Projection (AP) and Recursive Least Square (RLS), contain two important updates per iteration cycle; the Covariance Matrix Approximation (CMA) update and the gradient vector (or cost function) update. Usually, the computational effort of updating CMA is much higher than that of updating gradient vector. Therefore, reusing CMA, calculated from the last iteration cycle, for the current iteration can result in computational cost savings for real-time system identification. This technique is particularly suitable for system identification-based adaptive control of complex power converter architectures suffering enormous computational burden. In the paper, this technique is applied for AP and RLS algorithms, for the purpose of identifying the parameters of a three-rail power converter.
Original languageEnglish
Title of host publicationIEEE Applied Power Electronics Conference and Exposition (APEC)
PublisherIEEE
Pages2150-2157
Number of pages8
DOIs
Publication statusPublished - 25 Jun 2020
Event2020 IEEE Applied Power Electronics Conference and Exposition - New Orleans, United States
Duration: 15 Mar 202019 Mar 2020

Conference

Conference2020 IEEE Applied Power Electronics Conference and Exposition
Abbreviated titleAPEC
CountryUnited States
CityNew Orleans
Period15/03/2019/03/20

Fingerprint Dive into the research topics of 'Computational Burden Reduction in Real-Time System Identification of Multi-Rail Power Converter by Re-using Covariance Matrix Approximation'. Together they form a unique fingerprint.

  • Cite this