arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.07241cs.AR
收藏

基于可满足性模理论的VLSI电路布图规划方法

Satisfiability Modulo Theory based Methodology for Floorplanning in VLSI Circuits

Suchandra Banerjee, Anand Ratna, Suchismita Roy

摘要:

本文提出了一种基于可满足性模理论的VLSI电路布图规划公式。所提出的方法允许多个固定块被放置在布局区域内而不重叠,并且同时最小化布局区域的面积。所提出的方法进行了扩展,允许一些固定的块与旋转能力和灵活的块(可变宽度和高度)被放置在一个布局内没有重叠。在所有情况下,我们的目标是减少芯片上占用的面积,这对于获得良好的电路设计至关重要。可满足性模理论将布尔可满足性问题与凸优化等领域相结合。可满足性模理论提供了比纯布尔SAT公式更丰富的建模语言。我们在MCNC和GSRC基准电路上进行了实验,计算了在不重叠的情况下放置块所占用的总面积、死区量和所消耗的总CPU时间。所得到的结果清楚地表明,如果对块体施加旋转,则死空间或浪费空间的量减少。

英文摘要:

This paper proposes a Satisfiability Modulo Theory based formulation for floorplanning in VLSI circuits. The proposed approach allows a number of fixed blocks to be placed within a layout region without overlapping and at the same time minimizing the area of the layout region. The proposed approach is extended to allow a number of fixed blocks with ability to rotate and flexible blocks (with variable width and height) to be placed within a layout without overlap. Our target in all cases is reduction in area occupied on a chip which is of vital importance in obtaining a good circuit design. Satisfiability Modulo Theory combines the problem of Boolean satisfiability with domains such as convex optimization. Satisfiability Modulo Theory provides a richer modeling language than is possible with pure Boolean SAT formulas. We have conducted our experiments on MCNC and GSRC benchmark circuits to calculate the total area occupied, amount of deadspace and the total CPU time consumed while placing the blocks without overlapping. The results obtained shows clearly that the amount of dead space or wasted space is reduced if rotation is applied to the blocks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑