| 一种新的标准单元增量式布局算法 |
| |
| 引用本文： | 李卓远,吴为民,洪先龙,顾钧. 一种新的标准单元增量式布局算法[J]. 半导体学报, 2002, 23(12) |
| |
| 作者姓名： | 李卓远 吴为民 洪先龙 顾钧 |
| |
| 作者单位： | 1. 清华大学计算机科学与技术系,北京,100084
2. 香港科技大学计算机科学与技术系,香港 |
| |
| 基金项目： | 国家自然科学基金，国家重点基础研究发展计划(973计划) |
| |
| 摘 要： | 提出了一种新的增量式布局方法W-ECOP来满足快速调整布局方案的要求.与以前的以单元为中心的算法不同,算法基于单元行划分来进行单元的插入和位置调整,在此过程中使对原布局方案的影响最小,并且尽可能优化线长.一组从美国工业界的测试例子表明,该算法运行速度快,调整后的布局效果好.
|
| 关 键 词： | 增量式布局 标准单元 |
Incremental Placement Algorithm for Standard-Cell Layout |
| |
| Li Zhuoyuan,Wu Weimin,Hong Xianlong,Gu Jun. Incremental Placement Algorithm for Standard-Cell Layout[J]. Chinese Journal of Semiconductors, 2002, 23(12) |
| |
| Authors: | Li Zhuoyuan Wu Weimin Hong Xianlong Gu Jun |
| |
| Abstract: | A new algorithm W-ECOP is presented to effect incremental changes on a standard cell layout automatically.This algorithm deals with cell inserting and cell moving based on rows instead of on cells as most placement algorithms usually do.An integer programming problem is formulated to minimize the adjustment on the initial placement and a heuristic method is presented to search for a shifting path so as to optimize the wirelength.Test of W-ECOP on a group of practical test cases shows that the algorithm can successfully accomplish incremental placement with good quality and high speed. |
| |
| Keywords: | incremental placement standard cell |
| 本文献已被 万方数据 等数据库收录！ |
|
