首页> 外文会议>IEEE International Confernece on Computer Design >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 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号