检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:邓沛锟 魏丽军 Deng Peikun;Wei Lijun(School of Electromechanical Engineering,Guangdong University of Technology,Guangzhou 510006,China)
出 处:《机电工程技术》2025年第2期44-49,共6页Mechanical & Electrical Engineering Technology
基 金:国家自然科学基金面上项目(22010315221906772)。
摘 要:VLSI布局是VLSI设计流程的核心环节,该问题属于空间布局优化问题。目前该方向的研究较少考虑混合尺寸电路模块的线长最小化布局,提出了一种启发式算法求解混合电路模块的线长最小化布局问题。该算法首先采用大模块固定算法、子布局划分线确定算法和模块划分算法生成布局初始解;然后采用L-BFGS算法和合法化函数对布局初始解合法化;最后通过局部调优算法优化布局得到布局最终解。该算法与VLSI布局最新文献的算法采用相同的经典测试集IBM-HB和IBM-HB+进行测试,两个测试集中有35个测试案例。实验结果表明,该算法比对比算法有22个测试案例取得更优结果,其中将测试集IBM-HB+的归一化线长减小了1.73%。VLSI layout is the core of VLSI design process,which belongs to space layout optimization problem.At present,there is relatively little research in this direction that considers the layout of minimizing the line length of mixed size circuit modules,a heuristic algorithm is proposed to solve the problem of line length minimization layout of hybrid circuit modules.In this algorithm,large module fixing algorithm,sublayout line determination algorithm and module partition algorithm are used to generate the initial layout solution.Then L-BFGS algorithm and legalization function are used to legalize the initial solution of the layout.Finally,the local optimization algorithm is used to optimize the layout and get the final solution.The algorithm is tested with the same classical test sets IBM-HB and IBM-HB+as those in the latest VLSI layout literature.There are 35 test cases in the two test sets.Experimental results show that the proposed algorithm achieves better results than the comparison algorithm in 22 test cases,in which the normalized line length of the test set IBM-HB+is reduced by 1.73%.
分 类 号:TP27[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7