| 带障碍增强型O-Tree布图规划算法 |
| |
| 引用本文： | 温宇杰,童家榕.带障碍增强型O-Tree布图规划算法[J].复旦学报(自然科学版),2006,45(1):34-38. |
| |
| 作者姓名： | 温宇杰 童家榕 |
| |
| 作者单位： | 复旦大学,专用集成电路与系统国家重点实验室,上海,200433;复旦大学,专用集成电路与系统国家重点实验室,上海,200433 |
| |
| 摘 要： | 扩展了现有的基于O-Tree的布图算法,提出了一种可以处理带障碍模块的布图算法.修改了原算法中对O-tree的扰动(perturbing)方法,扩展了算法在布图解空间中的搜索范围.修改后的算法对自由模块进行布图,并通过消除自由模块与障碍之间的重叠,得到满足障碍位置约束的布图;其时间复杂度为O(n7/2m),其中n是自由模块的数目,m是障碍的数目.布图测试电路的运行结果显示,修改后的算法比原算法可以得到更优化的布图结果.
|
| 关 键 词： | 集成电路 电子设计自动化 布图 障碍 O-tree |
| 文章编号： | 0427-7104（2006）01-0034-05 |
| 收稿时间： | 2005-03-17 |
| 修稿时间： | 2005-03-17 |
Enhanced O-tree Algorithm for Obstacled Floorplanning |
| |
| WEN Yu-jie,TONG Jia-rong.Enhanced O-tree Algorithm for Obstacled Floorplanning[J].Journal of Fudan University(Natural Science),2006,45(1):34-38. |
| |
| Authors: | WEN Yu-jie TONG Jia-rong |
| |
| Abstract: | The O-tree floorplanning algorithm is extended to treat the obstacled floorplan problems.The extended algorithm generates floorplans of free blocks and eliminates overlaps between free blocks and obstacles.An enhanced perturbing method is proposed to extend the search ability of O-tree.Timing complexity of the extended algorithm is O(n~(7/2)m),where n and m are the number of free blocks and obstacles respectively.Benchmarking results show improvements of the extended algorithms against original one. |
| |
| Keywords: | integrated circuits EDA floorplanning obstacled O-tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
