求解FPRM电路极性优化问题的改进多目标粒子群算法  

An Improved Multi-objective Particle Swarm Optimization Algorithm for Polarity Optimization of FPRM Circuits

作　　者：符强[1,2] 汪鹏君[1] 王铭波 童楠[2] 张会红[1] Fu Qiang;Wang Pengjun;Wang Mingbo;Tong Nan;Zhang Huihong(Institute of Circuits and Systems,Ningbo University,Ningbo 315211;College of Science and Technology,Ningbo University,Ningbo 315212)

机构地区：[1]宁波大学电路与系统研究所,宁波315211 [2]宁波大学科学技术学院,宁波315212

出　　处：《计算机辅助设计与图形学学报》2018年第3期540-548,共9页Journal of Computer-Aided Design & Computer Graphics

基　　金：国家自然科学基金(61306041;61234002);宁波市自然科学基金(2016A610065)

摘　　要：针对多目标要求下较大规模固定极性Reed-Muller(FPRM)逻辑电路的极性优化问题,提出一种基于改进多目标粒子群算法的求解方法.首先根据延时、面积及功耗的综合要求建立FPRM电路极性优化的多目标决策模型;然后利用外部档案库引导粒子种群进行兼顾全局搜索及局部开发的双重更新,并通过Pareto占优进行粒子优劣性评价,以获取满足延时短、面积小、功耗低的最优极性解集;最后利用MCNC Benchmark电路进行性能测试,并与3种当前较优算法进行对比,验证了文中算法的有效性.To optimize the multi-objective polarity design of large-scale FPRM circuits,a solution based on improved multi-objective particle swarm optimization(IMOPSO)algorithm is proposed.Firstly,the multi-objective decision model is established according to the delay,area and power of large-scale MPRM circuits.Then,based on the principle of the exploration and exploitation,the particles,representing the circuits’polarities,achieve evolution by means of repository and gain quality evaluation from Pareto analysis,to obtain the Pareto optimal set for delay-area-power trade-off.Finally,the proposed solution is compared with the three currently preferred algorithms on MCNC Benchmark with PLA format,and the results verify the effectiveness of the solution.

关 键 词：多目标粒子群算法 PARETO FPRM逻辑电路 极性搜索 延时、面积与功耗优化 

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