| 一种积木块布图的优化二维压缩算法 |
| |
| 引用本文： | 朱雪花 刘美轮. 一种积木块布图的优化二维压缩算法[J]. 天津大学学报(自然科学与工程技术版), 1991, 0(3): 25-29 |
| |
| 作者姓名： | 朱雪花 刘美轮 |
| |
| 作者单位： | 天津大学电力及自动化工程系(朱雪花)，天津大学电力及自动化工程系(刘美轮) |
| |
| 基金项目： | 国家自然科学基金资助项目 |
| |
| 摘 要： | 研究积木块布图的二维压缩问题,提出一种采用分枝定界法的真正的二维压缩算法。该算法以空余空间面积为研究对象,直接以压缩的目的——芯片面积最小化为目标。定义一种压缩树作为分枝定界法的基础。力图将所有的积木块尽可能向芯片的一个角压缩。实验结果表明算法是可行的。
|
| 关 键 词： | 积木块 布图 芯片 布线 压缩 VLSI |
AN OPTIMIZED TWO-DIMENSIONAL COMPACTION OF BUILDING-BLOCK LAYOUT |
| |
| Zhu Xuehua Liu Meilun. AN OPTIMIZED TWO-DIMENSIONAL COMPACTION OF BUILDING-BLOCK LAYOUT[J]. Journal of Tianjin University(Science and Technology), 1991, 0(3): 25-29 |
| |
| Authors: | Zhu Xuehua Liu Meilun |
| |
| Affiliation: | Dept. of Electrical Engineering and Automation |
| |
| Abstract: | The two-dimensional compaction problem of building-block layout is considered in this paper. Unlike the existing compaction algorithms, we present a truly two-dimensional compaction scheme which starts off with the point of view of two-dimension, looks spare space of a block as considered object and chip area as objective function directly. In the approach, using a branch-and-bound algorithm on the basis of a compaction tree, we attempt to move all blocks towards a corner of the chip. The experimental results have shown that the method is effective. |
| |
| Keywords: | building-block layout two-dimensional compaction branch-and-bound. compaction tree |
| 本文献已被 CNKI 维普 等数据库收录！ |
