首页|期刊导航|机电工程技术|基于自适应迭代的软硬模块混合布图面积最小化启发式方法

基于自适应迭代的软硬模块混合布图面积最小化启发式方法OA

A Heuristic Method for Area Minimization in Soft-hard Module Hybrid Floorplanning Based on Adaptive Iteration

中文摘要英文摘要

随着集成电路设计复杂度的提高,如何在有限芯片面积内合理布置功能模块,提升资源利用率,已成为电子设计自动化领域的重要研究课题.为解决集成电路布图规划问题中的软硬模块混合布图面积最小化问题,提升布图紧凑性,提出了一种基于自适应迭代的启发式算法.该算法采用分层枚举策略生成模块组合,并将问题分解为一系列硬模块面积最小化子问题.在迭代过程中,算法自适应地选择合适的子问题进行计算,并结合天际线启发式方法与局部搜索策略提升布图质量.同时,引入记忆池策略进一步扩大解的搜索范围.实验结果表明,所提出的方法在不同软模块占比情况下的平均填充率均能达到98%以上.在包含硬模块的11个测试实例中,其中8个实例的填充率略优于文献中相关算法.

As the complexity of integrated circuit design increases,how to effectively arrange functional modules within the limited chip area to enhance resource utilization has become a significant research topic in the field of electronic design automation.To address the mixed soft-hard module floorplanning area minimization problem in integrated circuit floorplanning and enhance layout compactness,a heuristic algorithm based on adaptive iteration is proposed.The algorithm employs a hierarchical enumeration strategy to generate module combinations and decomposes the problem into a series of hard module area minimization subproblems.During the iterative process,the algorithm adaptively selects appropriate subproblems for computation and improves floorplanning quality by integrating the skyline heuristic method with a local search strategy.Additionally,a memory pool strategy is introduced to further expand the solution search space.The experimental results demonstrate that the proposed method achieves an average fill rate of over 98%under varying proportions of soft modules.Among the 11 test instances containing hard modules,8 instances exhibit a slightly higher filling rate than those achieved by related algorithms in the literature.

张浩;姚绍文;魏丽军

广东工业大学机电工程学院,广州 510006广东工业大学机电工程学院,广州 510006广东工业大学机电工程学院,广州 510006

信息技术与安全科学

布图规划面积最小化条带装箱启发式算法

floorplanningarea minimizationstrip packingheuristic algorithm

《机电工程技术》 2026 (4)

1-7,19,8

国家自然科学基金(72271062)

10.3969/j.issn.1009-9492.2025.00054

评论