A block rational Arnoldi algorithm for multipoint passive model-order reduction of multiport RLC networks

Recent work in the area of model-order reduction for RLC interconnect networks has been focused on building reduced-order models that preserve the circuit-theoretic properties of the network, such as stability, passivity, and synthesizability. Passivity is the one circuit-theoretic property that is vital for the successful simulation of a large circuit netlist containing reduced-order models of its interconnect networks. Non-passive reduced-order models may lead to instabilities even if they are themselves stable. In this paper, we address the problem of guaranteeing the accuracy and passivity of reduced-order models of multiport RLC networks at any finite number of expansion points. The novel passivity-preserving model-order reduction scheme is a block version of the rational Arnoldi algorithm. The scheme reduces to that of the PRIMA algorithm when applied to a single expansion point at zero frequency. Although the treatment of this paper is restricted to expansion points that are on the negative real axis, it is shown that the resulting passive reduced-order model is superior in accuracy to the one that would result from expanding the original model around a single point. Nyquist plots are used to illustrate both the passivity and the accuracy of the reduced-order models.

[1]  Axel Ruhe.  The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices , 1994 .

[2]  Andrew T. Yang,et al.  Preservation of passivity during RLC network reduction via split congruence transformations , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Lawrence T. Pileggi,et al.  PRIMA: passive reduced-order interconnect macromodeling algorithm , 1997, ICCAD 1997.

[4]  Lawrence T. Pileggi,et al.  Time-domain macromodels for VLSI interconnect analysis , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  A. Yang,et al.  Preservation Of Passivity During RLC Network Reduction Via Split Congruence Transformations , 1997, Proceedings of the 34th Design Automation Conference.

[6]  Eric James Grimme,et al.  Krylov Projection Methods for Model Reduction , 1997 .

[7]  Roland W. Freund,et al.  Reduced-order modeling of large passive linear circuits by means of the SYPVL algorithm , 1996, ICCAD 1996.

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

[9]  N. S. Barnett,et al.  Private communication , 1969 .

[10]  Andrew T. Yang,et al.  Stable and efficient reduction of large, multiport RC networks by pole analysis via congruence transformations , 1996, DAC '96.

[11]  E. Guillemin.  Synthesis of passive networks : theory and methods appropriate to the realization and approximation problems , 1957 .

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

[13]  Andrew T. Yang,et al.  Stable and efficient reduction of large, multiport RC networks by pole analysis via congruence transformations , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[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]  Michel S. Nakhla,et al.  Analysis of interconnect networks using complex frequency hopping (CFH) , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  Mattan Kamon,et al.  A coordinate-transformed Arnoldi algorithm for generating guaranteed stable reduced-order models of RLC circuits , 1999 .