首页> 外文期刊>IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems >Time-efficient VLSI artwork analysis algorithms in GOALIE2
【24h】

Time-efficient VLSI artwork analysis algorithms in GOALIE2

机译:GOALIE2中省时的VLSI艺术品分析算法

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

摘要

New algorithms used in the GOALIE2 circuit extraction system are presented that are based on representing VLSI layout geometries as trapezoids. These include polygon-to-trapezoid decomposition, scanline management, and output sorting. The scanline algorithm virtually eliminates the redundant computation present in similar systems. It solves the VLSI layout analysis problem in O(n+k) expected time and O( square root n) expected space, where n is the total number of input segments and k is the total number of intersection points. The new scanline algorithm is robust in what it will maintain its performance over a wide range of layout styles. Experimental results show that the running time is O(n/sup 1.0547/), i.e. that these algorithms enable one to perform VLSI layout analysis in nearly linear time.
机译:提出了在GOALIE2电路提取系统中使用的新算法,该算法基于将VLSI布局几何形状表示为梯形。这些包括多边形到梯形分解,扫描线管理和输出排序。扫描线算法实际上消除了类似系统中存在的冗余计算。它解决了O(n + k)期望时间和O(平方根n)期望空间中的VLSI布局分析问题,其中n是输入段的总数,k是交点的总数。新的scanline算法在各种布局样式中都可以保持其性能方面很强大。实验结果表明,运行时间为O(n / sup 1.0547 /),即这些算法使人们能够在几乎线性的时间内执行VLSI布局分析。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号