Partitioning Strategies in Circuit Simulation

  • M. Günther
  • M. Hoschek
Part of the Lecture Notes in Computational Science and Engineering book series (LNCSE, volume 8)


Partitioning strategies are commonly used in network analysis packages for simulating highly integrated circuits such as dynamic memories. These methods allow chip designers to simulate circuits consisting of millions of transistors in reasonable computation time. Using a standard benchmark example, the inverter chain, we consider different approaches used in network analysis to split the system on circuit level. We will show the connection with split numerical methods for ordinary differential equations with partitioned right-hand sides.


Circuit Simulation Partitioning Strategy Circuit Level Stiff Method Waveform Relaxation 
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.
    Andrus, J.F.: Stability of a multi-rate method for numerical integration of ode’s. Computers Math. Applic. 25 (1993) 3–14MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Borchardt, J., Grund, F., Horn, D.: Parallelized methods for large nonlinear and linear systems in the dynamic solution of industrial application. Surv. Math. Ind. (to appear)Google Scholar
  3. 3.
    Engstler, Chr., Lubich, Chr.: Multirate extrapolation methods for differential equations with different time scales. Computing 58 (1997) 173–185MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Engstler, Chr., Lubich, Chr.: MUR8: a multirate extension of the eighth-order Dormand-Prince method. Appl. Numer. Math. 25 (1997) 185–192MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Feldmann, U., Wever, U.A., Zheng, Q., Schultz, R., Wriedt, H.: Algorithms for modern circuit simulation. Archiv fur Elektronik und Ubertragungstechnik 46 (1992) 274–285Google Scholar
  6. 6.
    Gear, C.W., Wells, R.R.: Multirate linear multistep methods. BIT 24 (1984) 484–502MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Gristede, G.D., Zukowski, C.A., Ruehli, A.E.: Measuring error propagation in waveform relaxation algorithms. IEEE Trans. Circuit Theory (to appear)Google Scholar
  8. 8.
    Günther, M., Feldmann, U.: CAD based electric circuit modeling in industry. Part II: Impact of circuit configurations and parameters. Surv. Math. Ind. (to appear)Google Scholar
  9. 9.
    Günther, M., Rentrop., P.: Multirate ROW methods and latency of electric circuits. Appl. Num. Math. 13 (1993) 83–102zbMATHCrossRefGoogle Scholar
  10. 10.
    Günther, M., Rentrop., P.: Partitioning and multirate strategies in latent electric circuits. In: Mathematical modelling and simulation of electrical circuits and semiconductor devices. Eds.: R.E. Bank et al. Basel1, Birkhauser (1994) 33–60Google Scholar
  11. 11.
    Higham, D.J.: Analysis of the Enright-Kamel partitioning method for for stiff ordinary differential equations. IMA J. of Numer. Anal. 9 1-14Google Scholar
  12. 12.
    Ho, C.W., Ruehli, A.E., Brennan, P.A.: The modified nodal approach to network analysis. IEEE Trans. Circuits and Systems CAS-22 (1975) 505–509Google Scholar
  13. 13.
    Kampowsky, W., Rentrop, P., Schmidt, W.: Classification and numerical simulation of electric circuits. Surv. Math. Ind. 2 (1992) 23–65MathSciNetzbMATHGoogle Scholar
  14. 14.
    Rice, J.R.: Split Runge-Kutta methods for simultaneous equations. J. Res. Natl. Bur. Standards 64 B 151-170Google Scholar
  15. 15.
    Schaller, Chr.: Eine effiziente Implementierung eines Waveform-Relexations-Verfahrens auf Parallelen Rechnerarchitekturen. VDI-Verlag Diisseldorf 1998 (Fortschritt-Berichte Reihe 10: Informatik/Kommunikationstechnik Nr. 533)Google Scholar
  16. 16.
    Schaller, Chr.: LRZ fahrt Weltrekord bei der Simulation von Schaltungen. Computer Zeitung 4/1998 24Google Scholar
  17. 17.
    Skelboe, S.: Stability properties of backward differentiation multirate formulas. Appl. Num. Math. 5 (1989) 151–160MathSciNetzbMATHCrossRefGoogle Scholar
  18. 18.
    Steihaug, T., Wolfbrandt, A.: An attempt to avoid exact Jacobian and nonlinear equations in the numerical solution of stiff ordinary differential equations. Math. Comp. 33 (1979) 521–534MathSciNetzbMATHCrossRefGoogle Scholar
  19. 19.
    Strehmel, K., Weiner, R.: Partitioned adaptive Runge-Kutta methods and their stability. Numer. Math. 45 283-3002Google Scholar
  20. 20.
    Weiner, R., Arnold, M., Rentrop, P., Strehmel, K.: Partitioning strategies in Runge-Kutta type methods. IMA J. Num. Anal. 13 (1993) 303–319MathSciNetzbMATHCrossRefGoogle Scholar
  21. 21.
    Wever, U., Zheng, Q.: Parallel Transient Analysis for Circuit Simulation. Proceedings of the 29 Annual Hawaii International Conference on System Sciences 1 (1996) 442–447CrossRefGoogle Scholar
  22. 22.
    White, J., Sangiovanni-Vincentelli, A. L.: Relaxation Techniques for Simulation of VLSI circuits. Kluwer 1987Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • M. Günther
    • 1
  • M. Hoschek
    • 1
  1. 1.Fachbereich MathematikTechnische Universität DarmstadtDarmstadtGermany

Personalised recommendations