LSI/VLSI的任意元胞K行安置的算法
AN ALGORITHM OF K-LINE LOCATION FOR BBL IN LSI/VLSI
-
摘要: 本文提出一種適用于LSI/VLSI任意元胞布局的K行安置的算法。當(dāng)矩形單元的拓樸位置確定后,每個(gè)單元有橫放、豎放兩個(gè)態(tài)共有2n個(gè)態(tài)。在K行安置時(shí),從這2n個(gè)態(tài)中選出包絡(luò)矩形面積最小的問(wèn)題,可歸結(jié)為求n個(gè)態(tài)中的包絡(luò)矩形面積最小,所以是很有效的算法。可以和結(jié)群法混合使用;在一定條件下,還可以直接用于準(zhǔn)BBL布局。
-
關(guān)鍵詞:
- BBL布局; LSI/VLSI布圖; 計(jì)算機(jī)輔助設(shè)計(jì)
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. -
俞明永,陸生勛,莊文君,全國(guó)第四屆集成電路CAD學(xué)術(shù)年會(huì)論文集,哈爾濱,1987年. -
計(jì)量
- 文章訪問(wèn)數(shù): 2233
- HTML全文瀏覽量: 105
- PDF下載量: 452
- 被引次數(shù): 0
下載:
