Abstract | ||
---|---|---|
In this paper a novel method for circuit analysis is proposed. It is based on using symbolic analysis in matrix form, which is especially appropriate for repetitive similar calculations of the same circuit. The method, which applies hyper-complex numbers (hypernions), was first developed by the authors for analyzing the non-sinusoidal operation of electrical circuits. Now, the method has been extended to the analysis of electronic/switching circuits in which the sources and/or the parameters are step-wisely changed as a result of switching. Such circuits are common in different kinds of DC-DC converters (such as Buck, Boost, Cuk, etc. converters). The proposed method gives a new approach to the analysis of the above circuits by opening the possibility of treating them in a general-analytical form, just like in regular electrical circuits having a constant configuration and constant parameters. The computation of such kinds of circuits by using the proposed method becomes very simple, since the circuit does not have to be analyzed many times, each time for a different configuration, but at once by performing a parallel computation. The theoretical presentation is accompanied by numerical examples. |
Year | DOI | Venue |
---|---|---|
2009 | 10.1109/AFRCON.2007.4401600 | Journal of Circuits, Systems and Computers |
Keywords | Field | DocType |
dc-dc power convertors,matrix algebra,network topology,switching convertors,dc-dc converters,electrical circuits analysis,electronic-switching circuits,hypernion matrixes,parallel computation,regular electrical circuits,symbolic analysis,circuits with changing topology,electrical circuits,hyper-complex numbers,matrixes,non-sinusoidal signals,electrical circuit,matrices | Electrical network,Computer science,Matrix (mathematics),Control theory,Converters,Electronic engineering,Open-circuit time constant method,Symbolic data analysis,Network analysis,Electronic circuit,Equivalent circuit | Journal |
Volume | Issue | ISSN |
18 | 7 | 0218-1266 |
ISBN | Citations | PageRank |
978-1-4244-0987-7 | 2 | 0.43 |
References | Authors | |
1 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Yefim Berkovich | 1 | 97 | 16.91 |
Arieh Shenkman | 2 | 3 | 1.13 |
Saad Tapuchi | 3 | 5 | 1.21 |