基于矩形宏模块的片上系统布图规划算法

布图规划和布局是集成电路片上系统物理设计的基本问题之一。总结了作者提出的几个新的布图规划和布局优化算法及其特点。基于随机优化算法 ,提出了角模块序列表示方法和基于这一表示方法的包含各种布图约束的布图规划和布局算法。提出的基于约束图的布图规划表示 ,为研究序列队 (SP)、变形网格 (BSG)、有序树 (O- tree)等表示之间的关系奠定了理论基础。基于“最小自由度优先原则”,提出了迄今最快的确定性布图规划与布局算法。提出了基于解空间平滑的布图规划和布局算法。该算法与基于模拟退火的算法相比性能更加健壮稳定。在解空间平滑中首次考虑了局部平滑效应 ,这是对解空间平滑方法从原理上的重要改进

Rectangle-packing-based floorplanning algorithms for system-on-a-chip design

Floorplanning is critical to the physical VLSI system on a chip design. Several new floorplanning algorithms are summarized in this paper. A new floorplanning representation called the corner block list (CBL) was developed based on the stochastic optimization algorithm. Many algorithms for different floorplanning constraints based on the CBL were designed and tested. A constraint graph based representation was designed to study the relationship between various floorplanning representations, such as sequence pairs, bounded slice line grids, O trees, and CBL. The "less flexible first" optimization principle was used to design the fastest deterministic placement algorithm so far. The first floorplanning algorithm based on solution space smoothing was also designed and tested. Local smoothing provided significantly improved results with the solution space smoothing method.