LSI/VLSI的任意元胞K行安置的算法
AN ALGORITHM OF K-LINE LOCATION FOR BBL IN LSI/VLSI
-
摘要: 本文提出一种适用于LSI/VLSI任意元胞布局的K行安置的算法。当矩形单元的拓朴位置确定后,每个单元有横放、竖放两个态共有2n个态。在K行安置时,从这2n个态中选出包络矩形面积最小的问题,可归结为求n个态中的包络矩形面积最小,所以是很有效的算法。可以和结群法混合使用;在一定条件下,还可以直接用于准BBL布局。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.
-
俞明永,陆生勋,庄文君,全国第四届集成电路CAD学术年会论文集,哈尔滨,1987年. -
计量
- 文章访问数: 2225
- HTML全文浏览量: 102
- PDF下载量: 452
- 被引次数: 0
下载:
