| 一种自顶向下的分级布局算法 |
| |
| 引用本文： | 朱敏琛.一种自顶向下的分级布局算法[J].福州大学学报(自然科学版),1998(4):27-31. |
| |
| 作者姓名： | 朱敏琛 |
| |
| 作者单位： | 福州大学计算机科学与技术系 |
| |
| 摘 要： | 提出了一种分级布局的算法．它的基本思想是：将电路分成若干块，对这些子块进行布局，布局顺序即子块从父块中分离出来的次序．然后再分割，再布局，如此循环，直至每一子块都是单个元件为止．这个算法的特点是速度快，布局结果比较均匀．
|
| 关 键 词： | 版面设计 布局设计 相关线网 相关元件 |
An Up-to-Down Hierarchical Placement Algorithm |
| |
| Zhu Minchen.An Up-to-Down Hierarchical Placement Algorithm[J].Journal of Fuzhou University(Natural Science Edition),1998(4):27-31. |
| |
| Authors: | Zhu Minchen |
| |
| Institution: | Zhu Minchen (Department of Computer Science and Technology, Fuzhou University, Fuzhou, 350002) |
| |
| Abstract: | In this paper, we present a hierarchical placement algorithm. Its main idea is that the circuit would be divided into some subcircuits, we do the placement for subcircuits. The order of the placement is the order of son blocks separated from father blocks, then the subcircuits would be divided, we do the placement for them again, and soon, until there is one component in every son block. The feature of this algorithm is fast and the result of the placement is well distributed. |
| |
| Keywords: | layout placement design connected line net connected component |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《福州大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《福州大学学报(自然科学版)》下载免费的PDF全文 |
