Stable and efficient reduction of large, multiport RC networks by pole analysis via congruence transformations

A novel technique is presented which employs pole analysis via congruence transformations (PACT) to reduce RC networks in a well-conditioned manner. Pole analysis is shown to be more efficient than Pade approximations when the number of network ports is large, and congruence transformations preserve the passivity (and thus absolute stability) of the networks. The error incurred by reducing the networks is shown to be bounded by values which are fully selectable by the user. Networks are represented by admittance matrices throughout the analysis, and this representation both simplifies interfacing the reduced networks with circuit simulators and facilitates realization of the reduced networks using RC elements. A prototype SPICE-in, SPICE-out, network reduction CAD tool called RCFIT is detailed, and examples are presented which demonstrate the accuracy and efficiency of the PACT algorithm.

[1]  Albert E. Ruehli,et al.  The modified nodal approach to network analysis , 1975 .

[2]  Andrew T. Yang,et al.  Integrated circuit substrate coupling models based on Voronoi tessellation , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Andrew T. Yang,et al.  Stable and efficient reduction of substrate model networks using congruence transforms , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[4]  Mattan Kamon,et al.  Efficient Reduced-Order Modeling of Frequency-Dependent Coupling Inductances associated with 3-D Interconnect Structures , 1995, 32nd Design Automation Conference.

[5]  Roland W. Freund,et al.  Reduced-Order Modeling of Large Linear Subcircuits via a Block Lanczos Algorithm , 1995, 32nd Design Automation Conference.

[6]  Roland W. Freund,et al.  Efficient linear circuit analysis by Pade´ approximation via the Lanczos process , 1994, EURO-DAC '94.

[7]  A. Gourlay,et al.  Computational Methods for Matrix Eigenproblems , 1973 .

[8]  Andrew T. Yang,et al.  Mixed-signal switching noise analysis using Voronoi-tessellated substrate macromodels , 1995, DAC '95.

[9]  W. Arnoldi The principle of minimized iterations in the solution of the matrix eigenvalue problem , 1951 .

[10]  Lawrence T. Pileggi,et al.  Asymptotic waveform evaluation for timing analysis , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  J. Pasciak,et al.  Computer solution of large sparse positive definite systems , 1982 .

[12]  Robert Skelton,et al.  Model reductions using a projection formulation , 1987, 26th IEEE Conference on Decision and Control.

[13]  C. Lanczos An iteration method for the solution of the eigenvalue problem of linear differential and integral operators , 1950 .

[14]  Andrew T. Yang,et al.  Efficient parasitic substrate modeling for monolithic mixed-A/D circuit design and verification , 1996 .

[15]  Mattan Kamon,et al.  Efficient reduced-order modeling of frequency-dependent coupling inductances associated with 3-D interconnect structures , 1995, Proceedings the European Design and Test Conference. ED&TC 1995.

[16]  J. Gillis,et al.  Matrix Iterative Analysis , 1961 .

[17]  P. Dooren,et al.  Asymptotic Waveform Evaluation via a Lanczos Method , 1994 .

[18]  B. Parlett,et al.  The Lanczos algorithm with selective orthogonalization , 1979 .

[19]  Roy R. Craig,et al.  Krylov vector methods for model reduction and control of flexible structures , 1992 .

[20]  M. M. Alaybeyi,et al.  AWE-Inspired , 1993, Proceedings of IEEE Custom Integrated Circuits Conference - CICC '93.

[21]  David J. Allstot,et al.  Electrothermal simulation of integrated circuits , 1993 .