Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/ISCAS.2004.1329967 | ISCAS (5) |
Keywords | DocType | Volume |
link branches,power electronics,state-space methods,power electronic circuits,spanning tree algorithms,trees (mathematics),state equation,system level,power electronic systems,automated state-variable formulation,optimal sets,network partitioning,state-space representation,state variable approach,computationally effective algorithm,switched systems,topological information,switched circuits,tree branches,circuit branch data,variable parameters systems,circuit simulation,circuit topology,state space representation,spanning tree,automatic control,network topology | Conference | 5 |
ISBN | Citations | PageRank |
0-7803-8251-X | 1 | 1.40 |
References | Authors | |
1 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Juri Jatskevich | 1 | 218 | 29.52 |
| Tarek Aboul-seoud | 2 | 2 | 2.00 |