By Topic

Modeling of VLSI RC parasitics based on the network reduction algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Niewczas, M. ; Inst. of Microelectron. & Optoelectron., Warsaw Univ. of Technol., Poland ; Wojtasik, A.

This paper presents a method of modeling of R and C parasitics in VLSI circuits. A network representation is generated for finite difference discretization of 2-D Laplace's equation, and a reduction algorithm is applied to this network. The solution area can be defined by any set of polygons. If n is the number of discretization nodes the new algorithm is O(n1.5). It yields directly the coefficients of capacitance or admittance matrix. In contrast to other methods, in the network reduction approach, the time required for modeling depends mainly upon the complexity of the solution area but weakly upon the number of terminals. This feature is particularly valuable in application to circuit extraction

Published in:

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on  (Volume:14 ,  Issue: 2 )