...
首页> 外文期刊>IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems >FastCap: a multipole accelerated 3-D capacitance extraction program
【24h】

FastCap: a multipole accelerated 3-D capacitance extraction program

机译:FastCap:多极加速3-D电容提取程序

获取原文
获取原文并翻译 | 示例
           

摘要

A fast algorithm for computing the capacitance of a complicated three-dimensional geometry of ideal conductors in a uniform dielectric is described and its performance in the capacitance extractor FastCap is examined. The algorithm is an acceleration of the boundary-element technique for solving the integral equation associated with the multiconductor capacitance extraction problem. The authors present a generalized conjugate residual iterative algorithm with a multipole approximation to compute the iterates. This combination reduces the complexity so that accurate multiconductor capacitance calculations grow nearly as nm, where m is the number of conductors. Performance comparisons on integrated circuit bus crossing problems show that for problems with as few as 12 conductors the multipole accelerated boundary element method can be nearly 500 times faster than Gaussian-elimination-based algorithms, and five to ten times faster than the iterative method alone, depending on required accuracy.
机译:描述了一种用于计算均匀电介质中理想导体的复杂三维几何形状的电容的快速算法,并检查了其在电容提取器FastCap中的性能。该算法是边界元技术的加速,用于解决与多导体电容提取问题相关的积分方程。作者提出了一种具有多极点近似的广义共轭残差迭代算法来计算迭代次数。这种组合降低了复杂性,因此精确的多导体电容计算几乎随着nm的增长而增加,其中m是导体的数量。对集成电路总线交叉问题的性能比较表明,对于只有12条导体的问题,多极加速边界元方法可以比基于高斯消除的算法快近500倍,比单独的迭代方法快五到十倍,取决于所需的精度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号