A hierarchical floating random walk algorithm for fabric-aware 3D capacitance extraction

With the adoption of ultra regular fabric paradigms for controlling design printability at the 22nm node and beyond, there is an emerging need for a layout-driven, pattern-based parasitic extraction of alternative fabric layouts. In this paper, we propose a hierarchical floating random walk (HFRW) algorithm for computing the 3D capacitances of a large number of topologically different layout configurations that are all composed of the same layout motifs. Our algorithm is not a standard hierarchical domain decomposition extension of the well established floating random walk technique, but rather a novel algorithm that employs Markov Transition Matrices. Specifically, unlike the fast-multipole boundary element method and hierarchical domain decomposition (which use a far-field approximation to gain computational efficiency), our proposed algorithm is exact and does not rely on any tradeoff between accuracy and computational efficiency. Instead, it relies on a tradeoff between memory and...

• Type: Journal
• Year: 2009
• Where: ICCAD
• Authors: Tarek A. El-Moselhy, Ibrahim M. Elfadel, Luca Daniel
• Keywords: Algorithm, Floating Random Walk, Hardware, ICCAD 2009, Random Walk