Tabu Search for Floorplan Using B*-tree Representation
首发时间:2008-12-12
Abstract:Floorplan is an very important step in the physical design of VLSI circuits. It is the rectangular packing problem: Given a set of rectangular modules, place them non-overlapping on a plane within a rectangle of minimum area. Since the variety of packing is uncountable infinite, the key issue is to find the optimal solution in the finite solution space. It is hard to be solved exactly in practical applications. An approach is presented to improve the area utilization based on B*-tree. The simulated annealing is embedded into the tabu search for floorplan. Experimental results show that our approach can improve the area utilization in short time.
keywords: VLSI Tabu Search(TS) Simulated Annealing(SA) B*-tree
点击查看论文中文信息
论文图表:
引用
No.2656937107712290****
同行评议
共计0人参与
勘误表
基于B*-tree的禁忌搜索用于VLSI布图规划
评论
全部评论0/1000