检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:马昱春 洪先龙 董社勤 C. K. Cheng 顾钧
机构地区:[1]Department of Computer Science and Technology, Tsinghua University, Beijing 100084, P.R. China [2]Department of Computer Science & Engineering, University of California, San Diego, La Jolla, CA 92093-0114, U.S.A. [3]Department of Computer Science, Hong Kong University of Science ~ Technology, Hong Kong Special Administration Region P.R. China
出 处:《Journal of Computer Science & Technology》2006年第6期922-926,共5页计算机科学技术学报(英文版)
基 金:This work is supported by the National Natural Science Foundation of China (Grant Nos. 60473126 and 90407005), National Natural Science Foundation of China and Hong Kong RGC Joint Project (Grant No. 60218004) and the Hi-Tech Research & Development 863 Program of China (Grant Nos. 2004AA1Z1050 and 2002AA1Z1460).
摘 要:With the recent advent of deep submicron technology and new packing schemes, the components in the integrated circuit are often not rectangular. On the basis of the representation of Corner Block List (CBL), we propose a new method of handling rectilinear blocks. In this paper, the handling of the rectilinear blocks is simplified by transforming the L/T- shaped block problem into the Mign-abutment constraint problem. We devise the block rejoining process and block alignment operation for forming the L/T-shaped blocks into their original configurations. The shape flexibility of the soft blocks, and the rotation and reflection of L/T-shaped blocks are exploited to obtain a tight packing. The empty rooms are introduced to the process of block rejoining. The efficiency and effectiveness of the proposed method are demonstrated by the experimental results on a set of some benchmark examples.With the recent advent of deep submicron technology and new packing schemes, the components in the integrated circuit are often not rectangular. On the basis of the representation of Corner Block List (CBL), we propose a new method of handling rectilinear blocks. In this paper, the handling of the rectilinear blocks is simplified by transforming the L/T- shaped block problem into the Mign-abutment constraint problem. We devise the block rejoining process and block alignment operation for forming the L/T-shaped blocks into their original configurations. The shape flexibility of the soft blocks, and the rotation and reflection of L/T-shaped blocks are exploited to obtain a tight packing. The empty rooms are introduced to the process of block rejoining. The efficiency and effectiveness of the proposed method are demonstrated by the experimental results on a set of some benchmark examples.
关 键 词:FLOORPLANNING corner block list L/T-shaped blocks
分 类 号:TP3[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.120