首页> 外文会议> >An incremental placement algorithm for building block layout design based on the O/spl I.bar/tree non-slicing representation
【24h】

An incremental placement algorithm for building block layout design based on the O/spl I.bar/tree non-slicing representation

机译:基于O / spl I.bar/树非切片表示的积木布局设计增量放置算法

获取原文
获取外文期刊封面目录资料

摘要

Incremental modification and optimization in VLSI physical design is of fundamental importance. Based on the O/spl I.bar/tree (ordered tree) representation which has more prominent advantages in comparison with other topological representations of non-slicing floorplans, we present an incremental placement algorithm for BBL (building block layout) design in VLSI physical design. The good performance of experimental results in dealing with instances taken from industry proves the effectiveness of our algorithm.
机译:VLSI物理设计中的增量修改和优化至关重要。基于O / spl I.bar/tree(有序树)表示形式(与无切片平面图的其他拓扑表示形式相比更具优势),我们提出了一种用于VLSI物理中BBL(积木式布局)设计的增量布局算法设计。实验结果在处理行业实例方面的良好表现证明了我们算法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号