在超大规模集成电路(VLSI)物理设计中,将更多约束实现放在更高的设计阶段考虑可以有效的加速设计收敛,减少设计时间.文中针对宏模块平面布图规划中约束的实现方法进行了分析和研究,基于B*-tree表示方法提出一种考虑集中约束(clustering constraints)的平面布图规划算法,针对布图规划中集中约束的实现取得了较好效果.
Considering more constraints in higher design level will enhance the design convergence and decrease the designing time in VLSI design.This paper have research on how constraints are considered in floorplanning step and present a new algorithm on clustering constraint floorplanning (CCFP) problem based on B-tree representation.