期刊文献+

基于全离散粒子群优化的纳电子MPRM电路面积优化算法

Nanoelectronic MPRM circuit area optimization algorithm based on fully discretized particle swarm optimization
下载PDF
导出
摘要 针对具有较多输入数的可编程阵列结构纳电子混合极性Reed-Muller电路的面积优化问题,提出一种全离散粒子群优化算法。通过将粒子速度合并到位置更新方程,充分挖掘粒子群优化中的学习因素得到全离散化的粒子更新方程,在此基础之上设计FDPSO算法,并使用探索概率作为算法参数控制算法全局探索与局部开拓间的平衡。对一组输入数大于20的MCNC电路进行优化的实验结果表明,与其他能够用于可编程阵列结构纳电子混合极性Reed-Muller电路面积优化的智能算法相比,全离散粒子群优化算法具有较强的全局收敛能力和结果稳定性,能够以较高时间效率获得较好的优化结果。 In allusion to the area optimization problem of programmable array-structured nanoelectronic mixed-polarity ReedMuller(MPRM) circuit with many input numbers,a fully discretized particle swarm optimization(FDPSO) algorithm is proposed. The learning factors in particle swarm optimization are fully mined by integrating particle velocity into the location update equation to obtain the fully discretized particle update equation. On this basis,FDPSO algorithm is designed and the exploration probability is used as the algorithm parameter to control the balance between global exploration and local exploitation of the algorithm. The optimization experiment for microelectronics center of North Carolina(MCNC)circuit whose input numbers are larger than 20 was carried out. The results show that,in comparison with other intelligent algorithms that can be applied to area optimization of programmable array-structured nanoelectronic MPRM circuit,FDPSO algorithm has stronger global convergence capability and result stability,and can achieve better optimization results with higher time efficiency.
作者 卜登立
出处 《现代电子技术》 北大核心 2018年第4期78-82,共5页 Modern Electronics Technique
基金 国家自然科学基金(61640412) 流域生态与地理环境监测国家测绘地理信息局重点实验室资助课题(WE2016012) 江西省教育厅科技计划项目(GJJ160746)~~
关键词 纳电子 MPRM电路 面积优化 粒子群优化 更新方程 算法参数 nanoelectronic MPRM circuit area optimization particle swarm optimization update equation algorithm parameter
  • 相关文献

参考文献6

二级参考文献47

  • 1Wang Pengjun,Chen Xiexiong.TABULAR TECHNIQUES FOR OR-COINCIDENCE LOGIC[J].Journal of Electronics(China),2006,23(2):269-273. 被引量:12
  • 2Yang Meng,A.E.A. Almaini,Wang Pengjun.FPGA PLACEMENT OPTIMIZATION BY TWO-STEP UNIFIED GENETIC ALGORITHM AND SIMULATED ANNEALING ALGORITHM[J].Journal of Electronics(China),2006,23(4):632-636. 被引量:6
  • 3Tan E C, Yang H. Optimization of fixed-polarity Reed- Muller circuits using dual-polarity property [J]. Circuits, Systems, and Signal Processing, 2000, 19(6): 535-548. 被引量:1
  • 4Habib M K. Efficient and fast algorithm to generate minimal Reed-Muller exclusive-OR expansions with mixed polarity for completely and incompletely specified functions and its computer implementation [J]. Computers & Electrical Engineering, 1993, 19(3):193-211. 被引量:1
  • 5Habib M K. A new approach to generate fixed-polarity Reed- Muller expansions for completely and incompletely specified functions [J]. International Journal of Electronics, 2002, 89 (11) : 845-876. 被引量:1
  • 6Rahaman H, Das D K, Bhattacharya B B. Testable design of AND-EXOR logic networks with universal test sets [J]. Computers & Electrical Engineering, 2009, 35(5):644-658. 被引量:1
  • 7Wang L, Almaini A E A. Optimisation of Reed-Muller PLA implementations [J]. IEE Proceedings Circuits, Devices and Systems, 2002, 149(2): 119-128. 被引量:1
  • 8Dill K M, Perkowski M A. Baldwinian learning utilizing genetic and heuristic algorithms for logic synthesis and minimization of incompletely specified data with generalized Reed-Muller (AND-EXOR) forms [J]. Journal of Systems Architecture, 2001, 47(6): 477-489. 被引量:1
  • 9A1Jassani B A, Urquhart N, Almaini A E A. Manipulation and optimisation techniques for Boolean logic[J]. IET Computers & Digital Techniques, 2010, 4(3): 227-239. 被引量:1
  • 10Wang L, Almaini A E A. Exact minimisation of largemultiple output FPRM functions [J].IEE Proceedings Computers and Digital Techniques, 2002, 149(5): 203-212. 被引量:1

共引文献28

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部