A Bounded 2D Contour Searching Algorithm for Floorplan Design with Arbitrarily Shaped Rectilinear and Soft Modules
A Bounded 2D Contour Searching Algorithm for Floorplan Design with Arbitrarily Shaped Rectilinear and Soft Modules
复制标题
任意形状直线和软模块平面设计的有界二维轮廓搜索算法
DOI：
10.1145/157485.165014
复制
发表时间：
1993
期刊：
影响因子：
--
通讯作者：
Tsu
中科院分区：
文献类型：
--
作者：
Tsu
在本文中，我们提出了一种新颖的布局规划算法，用于优化具有任意形状的直线和软块的布局规划。该算法的布局质量通过随机生成的人工示例和真实的工业示例来证明。随机生成案例的实验结果表明，对于 4 到 1600 个区块的案例，该算法可以找到平均面积利用率为 91.8% 的平面图。工业示例的测试结果表明，该算法有可能用于为各种设计风格（纯定制块、门阵列、标准单元、混合模式案例等）生成高质量的平面图。
In this paper, we present a novel floorplanning algorithm to optimize the floorplan with arbitrarily shaped rectilinear and soft blocks. The floorplan quality of this algorithm is demonstrated by randomly generated artificial examples and a real industrial example. The experimental results on the randomly generated cases demonstrate that the algorithm can find a floorplan with average area utilization 91.8% for cases ranging from 4 to 1600 blocks. The test results on industrial examples demonstrate that this algorithm can potentially be used to generate high quality floorplans for a wide range of design styles (pure custom blocks, gate array, standard cells, mixed mode cases, etc.)