| LSI/VLSI的任意元胞K行安置的算法 |
| |
| 引用本文： | 陆生勋, 姜国均. LSI/VLSI的任意元胞K行安置的算法[J]. 电子与信息学报, 1990, 12(2): 204-207. |
| |
| 作者姓名： | 陆生勋 姜国均 |
| |
| 作者单位： | 杭州大学物理系 杭州(陆生勋)，杭州大学物理系 杭州(姜国均) |
| |
| 摘 要： | 本文提出一种适用于LSI/VLSI任意元胞布局的K行安置的算法。当矩形单元的拓朴位置确定后,每个单元有横放、竖放两个态共有2n个态。在K行安置时,从这2n个态中选出包络矩形面积最小的问题,可归结为求n个态中的包络矩形面积最小,所以是很有效的算法。可以和结群法混合使用;在一定条件下,还可以直接用于准BBL布局。
|
| 关 键 词： | BBL布局 LSI/VLSI布图 计算机辅助设计 |
| 收稿时间： | 1988-04-25 |
| 修稿时间： | 1989-03-23 |
AN ALGORITHM OF K-LINE LOCATION FOR BBL IN LSI/VLSI |
| |
| Lu Shengxun, Jiang Guojun. AN ALGORITHM OF K-LINE LOCATION FOR BBL IN LSI/VLSI[J]. Journal of Electronics & Information Technology, 1990, 12(2): 204-207. |
| |
| Authors: | Lu Shengxun Jiang Guojun |
| |
| Affiliation: | Hangzhou University,Hangzhou |
| |
| Abstract: | A K-line location algorithm for buillding block cells in LSI/VLSI is presented. When the relative positions of rectangular cells are given, there are 2n states according to thetwo orientations of a cell. It is proved that to find the optimum solution from 2n states canbe reduced to calculate the n states in k-line algorithm. So the algorithm is very effectiveand can be used with association for cluster method in BBL placement. Under certain conditions, this method can also be used to pesudo BBL placement directly. |
| |
| Keywords: | BBL placement Layout of LSI/VLSI CAD |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《电子与信息学报》浏览原始摘要信息 |
|
点击此处可从《电子与信息学报》下载全文 |
