Linear time hierarchical capacitance extraction without multipole expansion

S. Balakrishnan*, J. H. Park, H. Kim, Yu-Min Lee, C. C.P. Chen

*此作品的通信作者

研究成果同行評審

2 引文 斯高帕斯(Scopus)

摘要

Recently, hierarchical capacitance extraction algorithms have been shown an efficient and accurate capacitance extraction algorithm. An improved algorithm is also proposed to remove its runtime dependency on the number of conductors by a combination of hierarchical and multipole expansion algorithm. In this paper, we show that with the introduction of hierarchical merging operation and supernode representation, we can achieve linear runtime and accuracy without involving multipole expansion. Experimental results show over 10X runtime improvement and 20X memory saving over the multipole approaches with comparable accuracy and better numerical stability.

原文English
頁面98-103
頁數6
DOIs
出版狀態Published - 9月 2001
事件IEEE International Conference on: Computer Design: VLSI in Computers and Processors (ICCD 2001) - Austin, TX, 美國
持續時間: 23 9月 200126 9月 2001

Conference

ConferenceIEEE International Conference on: Computer Design: VLSI in Computers and Processors (ICCD 2001)
國家/地區美國
城市Austin, TX
期間23/09/0126/09/01

指紋

深入研究「Linear time hierarchical capacitance extraction without multipole expansion」主題。共同形成了獨特的指紋。

引用此