基于PSO算法的FPRM电路延时和面积优化  

Delay and area optimization for FPRM circuits based on PSO algorithm

作　　者：王振海[1] 汪鹏君[1] 俞海珍[1] 张会红[1] 

机构地区：[1]宁波大学电路与系统研究所,浙江宁波315211

出　　处：《电路与系统学报》2012年第5期75-80,共6页Journal of Circuits and Systems

基　　金：国家自然科学基金(61076032);浙江省自然科学基金(Z1111219;Y1101078);浙江省科技厅项目(2010C31012;2011R09021-04)

摘　　要：RM(Reed-Muller)电路的极性决定其延时和面积,通过对粒子群优化(Particle Swarm Optimization,PSO)算法和FPRM表达式的研究,提出较大规模FPRM电路延时和面积优化算法。首先根据FPRM表达式特点,建立延时和面积估计模型;然后结合PSO算法和极性转换算法,对FPRM电路进行最佳延时和面积极性搜索;最后对PLA格式MCNC Benchmark电路进行测试,结果表明:与穷尽算法相比,PSO算法效率更高;与基于遗传算法的FPRM电路优化结果相比,延时平均节省6.6%,面积平均减少11.1%。Polarity determines the delay and area of the corresponding RM （Reed-Muller） circuits. By studying PSO （ Particle Swarm Optimization） algorithm and FPRM （Fixed-polarity Reed-Muller） expression, a delay and area optimization algorithm for large-scale FPRM circuits is proposed. Firstly, according to the characteristics of FPRM expression, the estimation model of delay and area is established. Secondly, combined with PSO and polarity conversion algorithm, the polarity of FPRM circuits for optimal delay and area is searched. Finally, PLA format MCNC Benchmark circuits are tested. The result shows that PSO algorithm is much more efficient than exhaustive algorithm. In addition, compared with the result optimized by Genetic algorithm, the average savings of delay and area is 6.6%and 11.1%, respectively.

关 键 词：延时和面积优化 PSO算法 FPRM电路 极性搜索 

分 类 号：TN79[电子电信—电路与系统]