ACM Home Page
Please provide us with feedback. Feedback
A block rational Arnoldi algorithm for multipoint passive model-order reduction of multiport RLC networks
Full text Publisher SitePublisher Site PdfPdf (225 KB)
Source International Conference on Computer Aided Design archive
Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design table of contents
San Jose, California, United States
Pages: 66 - 71  
Year of Publication: 1997
ISBN:0-8186-8200-0
Authors
I. M. Elfadel  IBM T. J. Watson Research Center, Yorktown Heights, NY
David D. Ling  IBM T. J. Watson Research Center, Yorktown Heights, NY
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
IEEE-CS : Computer Society
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 32,   Citation Count: 16
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
J. Eric Bracken. Passive modeling of linear interconnect networks. Technical report, ECE, CMU, 1996. submitted for publication.
4
 
5
 
6
A. Ruhe. The rational Krylov algorithm for nonsymmetric eigenvalue problems iii: complex shifts for real matrices. BIT, 34:165-176, 1994.
 
7
K. Gallivan, E. Grimme, and P. Van Dooren. A rational Lanczos method for model reduction. Numerical Algorithms, 12:33-63, 1996.
 
8
E. A. Guillemin. Synthesis of Passive Networks. John Wiley and Sons, 1957.
 
9
S. Y. Kim, N. Gopal, and L. T. Pillage. Time-domain macromodels for vlsi interconnect analysis. IEEE Trans. on CAD, 13(10):1257-1270, October 1994.
 
10
J. Eric Bracken. Algorithms for passive modeling of linear interconnect networks. Technical report, ECE, CMU, 1996. submitted for publication.
11
 
12
P. Feldmann and R. W. Freund. Efficient linear circuit analysis by Pad@ approximation via the Lanczos process. IEEE Trans. CAD, 14:639-649, May 1995.
13
 
14
E. Chiprout and M. S. Nakhla. Analysis of interconnect networks using complex frequency hopping (CFH). IEEE Trans. CAD, 14(2):186-200, February 1995.
 
15
L. T. Pillage and R. A. Rohrer. Asymptotic Waveform Evaluation for Timing Analysis. IEEE Trans. CAD, 9(4):352-366, April 1990.
 
16
E. Grimme. Krylov Projection Methods for Model Reduction. PhD thesis, Coordinated-Science Laboratory, University of Illinois at Urbana-Champaign, 1997.
 
17
C. D. Villemagne and R. E. Skelton. Model reduction using a projection formulation. Int. J. Control, 46:2141 - 2169, 1987.
 
18
Eli Chiprout. 1997. Private communication.

CITED BY  16
 
 
 
 
 
 

Collaborative Colleagues:
I. M. Elfadel: colleagues
David D. Ling: colleagues

Peer to Peer - Readers of this Article have also read: