A Markov Chain Based Hierarchical Algorithm for Fabric-Aware Capacitance Extraction
Name
El-Moselhy-2010-A Markov Chain Based.pdf
Size
1 MB
Format
Adobe PDF
Checksum (MD5)
f410501ae6e6a3b19e4c88c602188adc
Author(s)
El-Moselhy, Tarek Ali
Elfadel, Ibrahim M.
Daniel, Luca
Date Issued
January 2011
Journal
IEEE Transactions on Advanced Packaging
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
El-Moselhy, T, I M Elfadel, and L Daniel. “A Markov Chain Based Hierarchical Algorithm for Fabric-Aware Capacitance Extraction.” IEEE Transactions on Advanced Packaging 33.4 (2010): 818-827. Web. 1 Feb. 2012. © 2011 Institute of Electrical and Electronics Engineers
Version
Final published version
Abstract
In this paper, we propose a hierarchical algorithm to compute the 3-D capacitances of a large number of topologically different layout configurations that are all assembled from the same basic layout motifs. Our algorithm uses the boundary element method in order to compute a Markov transition matrix (MTM) for each motif. The individual motifs are connected together by building a large Markov chain. Such Markov chain can be simulated extremely efficiently using Monte Carlo simulations (e.g., random walks). The main practical advantage of the proposed algorithm is its ability to extract the capacitance of a large number of layout configurations in a complexity that is basically independent of the number of configurations. For instance, in a large 3-D layout example, the capacitance calculation of 1000 different configurations assembled from the same motifs is accomplished in the time required to solve independently two configurations, i.e., a 500 × speedup.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/tadvp.2010.2091504
