Skip to main content

Part of the book series: Mathematics in Industry ((TECMI,volume 13))

In this chapter, we will focus on direct techniques for reduction of RC circuits. Compared to iterative techniques, which are frequently (usually) based on subspace projection techniques, direct techniques are based on Gaussian Elimination or equivalent techniques.

In this chapter, we will focus on the reduction of RC circuits. Formally, given a linear RC (sub-)circuit, let us define port nodes as a input or output nodes of the circuit. Typically, these are connected to the real inputs and outputs of the circuit or to the terminals of the active devices. Also, internal nodes are all the remaining nodes. Then, reduction aims at removing internal nodes and (resistive or capacitive) branches connecting them such that the result is simpler but still accurate enough. Port nodes typically should be preserved, although sometimes they can be merged without a large accuracy penalty.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. Belevitch. Classical Network Theory. Holden Day, 1968.

    Google Scholar 

  2. Tsung-Hao Chen, Jeng-Liang Tsai, Charlie C-P Chen, and T Karnik. HiSIM: hierarchical interconnect-centric circuit simulator. In Computer Aided Design, 2004. ICCAD-2004. IEEE/ACM International Conference on, pages 489–496, November 2004.

    Google Scholar 

  3. E. Chiprout and M.S. Nakhla. Asymptotic Waveform Evaluation and Moment Matching for Interconnect Analysis. Kluwer Academic Publishers, 1994.

    Google Scholar 

  4. F. J. R. Clement. Computer Aided Analysis of Parasitic Substrate Coupling in Mixed Digital-Analog CMOS Integrated Circuits. PhD thesis, EPFL, Lausanne, 1995.

    Google Scholar 

  5. Richard W. Cottle. Manifestations of the schur complement. Linear Algebra and its Applications, 8(3):189–211, June 1974.

    Article  MATH  MathSciNet  Google Scholar 

  6. I.S. Duff, A.M. Erisman, and J.K. Reid. Direct Methods for Sparse Matrices. Oxford Science Publications, 1986.

    Google Scholar 

  7. P. J. H. Elias and N. P. van der Meijs. Extracting circuit models for large RC interconnections that are accurate up to a predefined signal frequency. In Proc. 33rd Design Automation Conf., pages 764–769, Las Vegas, Nevada, June 1996.

    Google Scholar 

  8. P. J. H. Elias and N. P. van der Meijs. Including higher-order moments of RC interconnections in layout-to-circuit extraction. In Proc. European Design and Test Conf., pages 362–366, Paris, France, March 1996.

    Google Scholar 

  9. P.J.H. Elias. Theory of selective node elimination. Technical Report Unpublished Notes, Delft University of Technology, Delft, The Netherlands, 1995.

    Google Scholar 

  10. W.C. Elmore. The transient response of damped linear networks with particular regard to wideband amplifiers. J. Applied Physics, 19:55–63, January 1948.

    Article  Google Scholar 

  11. M.K. Enns and J.J. Quada. Sparsity-enhanced network reduction for fault studies. Power Systems, IEEE Transactions on, 6(2), May 1991.

    Google Scholar 

  12. G. H. Golub and C. F. Van Loan. Matrix Computations. The Johns Hopkins University Press, 1989.

    Google Scholar 

  13. R. Gupta, B. Tutuianu, and L.T. Pileggi. The Elmore delay as a bound for RC trees with generalized input signals. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 16(1):95–104, 1997.

    Article  Google Scholar 

  14. T.A. Johnson. Resistive network simplification technique. IBM Technical Disclosure Bulletin, 24(5):2647–2649, Oct 1981.

    Google Scholar 

  15. P. Kazil and P. Dewilde. A simple and fast method for obtaining resistance of VLSI interconnect. In Proc. IEEE Int. Conf on Computer Design, pages 342–345, October 1986.

    Google Scholar 

  16. H.M. Markowitz. The elimination form of the inverse and its application to linear programming. Managment Sci., 3:255–269, 1957.

    Article  MATH  MathSciNet  Google Scholar 

  17. L.T. Pillage and R.A. Rohrer. Asymptotic waveform evaluation for timing analysis. Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on, 9(4):352–366, 1990.

    Article  Google Scholar 

  18. Zhanhai Qin and Chung-Kuan Cheng. Realizable parasitic reduction using generalized YΔ transformation. In Design Automation Conference, 2003. Proceedings, pages 220–225, June 2003.

    Google Scholar 

  19. E.L. Peterson R.J. Duffin and C. Zener. Geometric Programming: Theory and Application. John Wiley and Sons, New York, 1967.

    MATH  Google Scholar 

  20. E. Schrik and N. P. van der Meijs. Comparing two YΔ based methodologies for realizable model reduction. In ProRISC IEEE 14th Annual Workshop on Circuits, Systems and Signal Processing, November 2003.

    Google Scholar 

  21. B.N. Sheehan. TICER: Realizable reduction of extracted RC circuits. In Computer-Aided Design, 1999. Digest of Technical Papers. 1999 IEEE/ACM International Conference on, pages 200–203, 1999.

    Google Scholar 

  22. W.F. Tinney and J.M. Bright. Adaptive reductions for power flow equivalents. IEEE Transactions on Power Systems, PWRS-2:351–360, 1987.

    Google Scholar 

  23. W.F. Tinney and J.W. Walker. Direct solutions of sparse network equations by optimally ordered triangular factorization. Proc. IEEE, 55:1801–1809, 1967.

    Article  Google Scholar 

  24. N. P. van der Meijs and A. J. van Genderen. Delayed frontal solution for finite-element based resistance extraction. In Proc. 32nd Design Automation Conf., pages 273–278, San Francisco, California, June 1995.

    Google Scholar 

  25. N.P. van der Meijs, A.J. van Genderen, et al. Space layout to circuit extractor home page, March 2007. URL: http://space.tudelft.nl.

  26. A. J. van Genderen. Reduced Models for the Behavior of VLSI Circuits. PhD thesis, Delft University of Technology, Delft, The Netherlands, October 1991.

    Google Scholar 

  27. A. J. van Genderen and N. P. van der Meijs. Extracting simple but accurate RC models for VLSI interconnect. In Proc. Int. Symp. on Circuits and Systems, pages 2351–2354, Helsinki, Finland, June 7-9 1988.

    Google Scholar 

  28. A. J. van Genderen and N. P. van der Meijs. Reduced RC models for IC interconnections with coupling capacitances. In Proc. IEEE 3rd European Design Automation Conf., pages 132–136, Brussels, Belgium, March 1992.

    Google Scholar 

  29. A. J. van Genderen and N. P. van der Meijs. Using articulation nodes to improve the efficiency of finite-element based resistance extraction. In Proc. 33rd Design Automation Conf., pages 758–763, Las Vegas, Nevada, June 1996.

    Google Scholar 

  30. M. Yannakis. Computing the minimum fill-in is np-complete. Siam J. Alg. Disc. Meth., 2:77–79, 1981.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

van der Meijs, N.P. (2008). Model Order Reduction of Large RC Circuits. In: Schilders, W.H.A., van der Vorst, H.A., Rommes, J. (eds) Model Order Reduction: Theory, Research Aspects and Applications. Mathematics in Industry, vol 13. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78841-6_19

Download citation

Publish with us

Policies and ethics