Efficient linear circuit analysis by Pade´ approximation via the Lanczos process

In this paper, we introduce PVL, an algorithm for computing the Pad6 approximation of Laplace-domain transfer functions of large linear networks via a Lanczos process. The PVL algorithm has significantly superior numerical stability, while retaining the same efficiency as algorithms that compute the Pad6 approximation directly through moment matching, such as AWE (l), (2) and its derivatives. As a consequence, it produces more accurate and higher-order approximations, and it renders unnecessary many of the heuristics that AWE and its derivatives had to employ. The algorithm also computes an error bound that permits to identify the true poles and zeros of the original network. We present results of numerical experiments with the PVL algorithm for several large examples.

[1]  Kishore Singhal,et al.  Computer Methods for Circuit Analysis and Design , 1983 .

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

[3]  Michel S. Nakhla,et al.  Simulating 3-D retarded interconnect models using complex frequency hopping (CFH) , 1993, ICCAD.

[4]  A. Ruehli.  Equivalent Circuit Models for Three-Dimensional Multiconductor Systems , 1974 .

[5]  M. Nakhla,et al.  Asymptotic Waveform Evaluation: And Moment Matching for Interconnect Analysis , 1993 .

[6]  J. Cullum,et al.  A Practical Procedure for Computing Eigenvalues of Large Sparse Nonsymmetric Matrices , 1986 .

[7]  R.W. Freund,et al.  Efficient Small-signal Circuit Analysis And Sensitivity Computations With The Pvl Algorithm , 1994, IEEE/ACM International Conference on Computer-Aided Design.

[8]  Michel S. Nakhla,et al.  Generalized moment-matching methods for transient analysis of interconnect networks , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[9]  Rob A. Rutenbar,et al.  Mixed-signal noise-decoupling via simultaneous power distribution design and cell customization in RAIL , 1994, Proceedings of IEEE Custom Integrated Circuits Conference - CICC '94.

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

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

[12]  W. Gragg.  Matrix interpretations and applications of the continued fraction algorithm , 1974 .

[13]  W. Kahan,et al.  Residual Bounds on Approximate Eigensystems of Nonnormal Matrices , 1982 .

[14]  Ronald A. Rohrer,et al.  Numerical integration algorithms and asymptotic waveform evaluation (AWE) , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.

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

[16]  Ronald A. Rohrer,et al.  Three dimensional circuit oriented electromagnetic modeling for VLSI interconnects , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[17]  Roland W. Freund,et al.  Small-Signal Circuit Analysis and Sensitivity Computations with the PVL Algorithm , 1996 .

[18]  Vivek Raghavan,et al.  AWESpice: a general tool for the accurate and efficient simulation of interconnect problems , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[19]  L. D. Smith,et al.  A 27MHz Mixed Analog/digital Magnetic Recording Channel DSP Using Partial Response Signalling With Maximum Likelihood Detection , 1991, 1991 IEEE International Solid-State Circuits Conference. Digest of Technical Papers.

[20]  Roland W. Freund,et al.  An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices , 1993, SIAM J. Sci. Comput..