两层3D平面图
Two Layer 3D Floor Planning
摘要:
3D平面图是一个大盒子内的块的非重叠排列。平面规划是芯片设计中的核心概念,随着3D集成电路的最新进展,了解3D平面规划变得非常重要。在本文中,我们研究所谓的马赛克三维平面图的内部块划分主机盒下的拓扑等价。我们给出了表示,给出了一个上界的一般3D平面图的数量,并进一步考虑了两层马赛克平面图的数量。证明了两层镶嵌平面图的个数为$n^{(1+o(1))n/3}$。这与以前的工作,研究了“角落自由”马赛克平面图,其中的数字只是指数。上界是通过给出表示,而下界是随机构造。
英文摘要:
A 3D floor plan is a non-overlapping arrangement of blocks within a large box. Floor planning is a central notion in chip-design, and with recent advances in 3D integrated circuits, understanding 3D floor plans has become important. In this paper, we study so called mosaic 3D floor plans where the interior blocks partition the host box under a topological equivalence. We give representations which give an upper bound on the number of general 3D floor plans, and further consider the number of two layer mosaic floorplans. We prove that the number of two layer mosaic floor plans is $n^{(1+o(1))n/3}$. This contrasts with previous work which has studied `corner free' mosaic floor plans, where the number is just exponential. The upper bound is by giving a representation, while the lower bound is a randomized construction.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。