Computer Science – Symbolic Computation
Scientific paper
2009-03-12
SMACD'04 Proceedings of the International Workshop on Symbolic Methods and Applications in Circuit Design, Wroclaw, Poland, 23
Computer Science
Symbolic Computation
V1: documentclass IEEEtran, 5 pages, 6 figures. Re-release of the printed version, with some minor typographical errors correc
Scientific paper
In this paper we show how to extend the known algorithm of nodal analysis in such a way that, in the case of circuits without nullors and controlled sources (but allowing for both, independent current and voltage sources), the system of nodal equations describing the circuit is partitioned into one part, where the nodal variables are explicitly given as linear combinations of the voltage sources and the voltages of certain reference nodes, and another, which contains the node variables of these reference nodes only and which moreover can be read off directly from the given circuit. Neither do we need preparational graph transformations, nor do we need to introduce additional current variables (as in MNA). Thus this algorithm is more accessible to students, and consequently more suitable for classroom presentations.
No associations
LandOfFree
Supernodal Analysis Revisited does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Supernodal Analysis Revisited, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Supernodal Analysis Revisited will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-36447