Automated state-variable formulation for power electronic circuits and systems

TitleAutomated state-variable formulation for power electronic circuits and systems
Publication TypeConference Paper
Year of Publication2004
AuthorsJatskevich, J., and T. Aboul-Seoud
Conference NameCircuits and Systems, 2004. ISCAS '04. Proceedings of the 2004 International Symposium on
PaginationV-952 - V-955 Vol.5
Date Publishedmay.
Keywordsautomated state-variable formulation, circuit branch data, circuit simulation, computationally effective algorithm, link branches, network partitioning, optimal sets, power electronic circuits, power electronic systems, power electronics, spanning tree algorithms, state equation, state variable approach, state-space methods, state-space representation, switched circuits, switched systems, system level, topological information, tree branches, trees (mathematics), variable parameters systems

State variable approach is often used for modelling power-electronic circuits at the system level with controls. In the approach considered herein, the minimal state-space representation of the overall system is generated from the circuit branch data and updated for each new topology of the system. The network partitioning into optimal sets of tree and link branches is achieved using the spanning tree algorithms. For system with variable parameters recomputing the entire state equation to reflect the parameter changes may be prohibitively expensive. In this paper, a computationally effective algorithm for updating the required terms based on topological information is presented.


a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2021 The University of British Columbia