Automatability of consistent switches state search in computer aided analysis of switched RLC networks

Author

Femia, N.

Author_Institution

Istituto di Ingegneria Elettronica, Salerno Univ., Italy

fYear

1996

fDate

11-14 Aug 1996

Firstpage

71

Lastpage

79

Abstract

In this paper a method for the formulation of switched RLC (SRLC) circuit equations is discussed. The method is aimed at providing a suitable data structure for time-domain simulations, supporting the automatic determination of the topology entered by SRLC nets after forced commutations of any switching device. The data structure consists in a Master-Slave Connection Matrix, defined using the compensation theorem, which permits a straight evaluation of the influence of the forced commutation of any switch upon the currents of all switching devices in the net. Problems connected to the presence of controlled sources are discussed. Some applications to the simulation of power electronic circuits are presented

Keywords

circuit analysis computing; commutation; compensation; matrix algebra; network topology; switched networks; automatic topology determination; compensation theorem; computer aided analysis; consistent switches state search; controlled sources; data structure; forced commutations; master-slave connection matrix; switched RLC networks; switching device currents; time-domain simulations; Circuit simulation; Circuit topology; Computational modeling; Data structures; Equations; Master-slave; RLC circuits; Switches; Switching circuits; Time domain analysis;

fLanguage

English

Publisher

ieee

Conference_Titel

Computers in Power Electronics, 1996., IEEE Workshop on

Conference_Location

Portland, OR

ISSN

1093-5142

Print_ISBN

0-7803-3977-0

Type

conf

DOI

10.1109/CIPE.1996.612339

Filename

612339