欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
改进了一种求解集成电路模块布局问题的启发式算法。以边界矩形周长最小为目标,设计了模块的优先序列,并在布局过程中动态调整,重新设计布局优先度,并简化模块的占边动作,重写占角动作,对模块布局放置的多个可能位置进行比较,并将其放置在优先度最高的适当区域。经实例测试,结果表明该算法简洁高效,面积利用率有较大提高。
英文摘要：
This paper presents an improved version of a heuristic algorithm for VLSI module placement.To get the minimum perimeter of the rectangular chip,the authors design the modules’s priority sequence and change it dynamically.The authors then redesign the placement priority,simplify the module’s border-occupation action,rewrite the angle-occupation action and select the position with the highest priority to place the module.Experiments show that the algorithm is effective,easy to implement and can improve the chip utilization level.
同期刊论文项目
同项目期刊论文
C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with patte
A computational improvement to the dynamic programming algorithm for the optimal cutting of equal re
位置：