More Efficient Algorithms for Symbolic Network Analysis: Supernodes and Reduced Loop Analysis

  • Ralf Sommer
  • Dirk Ammermann
  • Eckhard Hennig
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 219)


In this paper, two efficient approaches will be discussed that support linear network analysis: supernode analysis (SNA) and reduced loop analysis (RLA). By means of some selected example networks, these methods will be demonstrated and, thus, it will be shown that calculations can be dramatically simplified. In this way, all network situations can be handled. There are obvious advantages to SNA as it combines the MNA and the straightforward manual processing of the network. A very efficient solution strategy is obtained without source shifting and other common, less directed methods being used. SNA/RLA and symbolic algebra fit extremely well together. Thus an algorithm that supports the symbolic calculation of networks by means of supernodes which has been conceptualized and implemented in the analog design expert system EASY will be presented in detail. Above the educational aspect, it should be noted that the computer can now take a systematic approach to MNA and network analysis in general.


Current Source Voltage Source Loop Current Forced Condition Element Relation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J. David Irwin, Basic Engineering Circuit Analysis, Macmillan: New York, 1987.Google Scholar
  2. 2.
    A. Reibiger, Private communication, Dresden, Braunschweig, 1991.Google Scholar
  3. 3.
    L.O. Chua and P.M. Lin, Computer-Aided Analysis of Electronic Circuit Analysis, Prentice Hall: Englewood Cliffs, 1975.Google Scholar
  4. 4.
    R. Sommer, R. Kamitz, and E.-H. Horneber, “Qualitative reasoning in the analog design expert system EASY,” in Proc. ECCTD’91, Copenhagen, 1991.Google Scholar
  5. 5.
    R. Sommer and E.-H. Horneber, “EASY-an experimental analog design system framework,” in Proc. Int. Workshop Symbolic Methods and Applications to Circuit Design, Paris/Bagneux, 1991.Google Scholar
  6. 6.
    K. Lee and S. Park, “Reduced modified nodal approach to circuit analysis,” IEEE CAS-32, No. 10, 1985.Google Scholar
  7. 7.
    W. Sansen and G. Gielen, “ISAAC: A symbolic simulator for analog integrated circuits,” IEEE J. Solid-State Circuits, Vol. 24, No. 6, pp. 1587–1597, 1989.CrossRefGoogle Scholar
  8. 8.
    G. Gielen and W. Sansen, Symbolic Analysis for Automated Design of Analog Integrated Circuits, Kluwer: Boston, 1991.CrossRefGoogle Scholar
  9. 9.
    R. Sommer, D. Ammermann, and E.-H. Horneber, “Qualitative reasoning and nonlinear effects in analog design expert system EASY,” in Proc. ICM’91, Kairo, 1991.Google Scholar
  10. 10.
    Symbolics MACSYMA Reference Manual, Version 13, 1988.Google Scholar
  11. 11.
    W. Sansen and G. Gielen, in Proc. Summer Course in Systematic Analogue Design, Katholiek Universiteit Leuven, 1990.Google Scholar

Copyright information

© Springer Science+Business Media New York 1993

Authors and Affiliations

  • Ralf Sommer
    • 1
  • Dirk Ammermann
    • 1
  • Eckhard Hennig
    • 1
  1. 1.Institut für Netzwerktheorie und SchaltungstechnikTechnische Universität Braunschweig

Personalised recommendations