Single-Sequence的边界约束条件  

Boundary Constraints Using Single-Sequence Representation

作　　者：李康[1] 虞厥邦[1] 于永斌[1] 

机构地区：[1]电子科技大学电子工程学院

出　　处：《电子科技大学学报》2008年第1期70-73,共4页Journal of University of Electronic Science and Technology of China

摘　　要：在VLSI物理设计中,分层设计和连线优化都要求某些模块放置在布局的边界位置。该文针对一般的具有不可二划分结构的布图规划问题,在SS编码的基础上解决VLSI物理设计中有边界约束的布局布图规划的问题;证明SS的放置顺序是表示模块的数字在SS中出现的位置先后顺序;提出模块放置在四个边界(上、下、左、右边界)在SS编码中应满足的充要条件及证明;并给出模块位于四个边界在SS编码中相应的表达式和计算方法。In practice of floorplan/placement of very large scale integration （VLSI） physical design, it is very critical to place some modules along the boundaries of the chip so that connections between inputs and outputs and among units in hierarchical design mode are shortened. Based on non-slicing representation single-sequence （SS）, boundary constraints in VLSI layout design are solved. The packing sequence of a SS is proved to be the appearance sequence of integer, which represents module in a SS code. Further, a necessary and sufficient condition of a module to be placed on four boundaries （top, bottom, left, and right） in a SS code is proposed and proved.

关 键 词：边界约束 布图规划 布局 VLSI物理设计 

分 类 号：TP391.7[自动化与计算机技术—计算机应用技术]