首页> 外文会议>Computer Design, 2009. ICCD 2009 >Topology-driven cell layout migration with collinear constraints
【24h】

Topology-driven cell layout migration with collinear constraints

机译:具有共线约束的拓扑驱动单元布局迁移

获取原文

摘要

Traditional layout migration focuses on area minimization, thus suffered wire distortion, which caused loss of layout topology. A migrated layout inheriting original topology owns original design intention and predictable property, such as wire length which determines the path delay importantly. This work presents a new rectangular topological layout to preserve layout topology and combine its flexibility of handling wires with traditional scan-line based compaction algorithm for area minimization. The proposed migration flow contains devices and wires extraction, topological layout construction, unidirectional compression combining scan-line algorithm with collinear equation solver, and wire restoration. Experimental results show that cell topology is well preserved, and a several times runtime speedup is achieved as compared with recent migration research based on ILP (integer linear programming) formulation.
机译:传统的布局迁移着重于面积的最小化,因此会遭受导线变形的影响,从而导致布局拓扑结构的损失。继承了原始拓扑的已迁移布局具有原始设计意图和可预测的属性,例如,重要决定路径延迟的导线长度。这项工作提出了一种新的矩形拓扑布局,以保留布局拓扑,并将其处理导线的灵活性与基于传统扫描线的压紧算法相结合,以实现面积最小化。拟议的迁移流程包括设备和导线提取,拓扑布局构建,结合扫描线算法和共线方程求解器的单向压缩以及导线还原。实验结果表明,与最近基于ILP(整数线性规划)公式的迁移研究相比,单元拓扑得到了很好的保存,并实现了数倍的运行时加速。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号