期刊文献+

Discrete ternary particle swarm optimization for area optimization of MPRM circuits 被引量:9

Discrete ternary particle swarm optimization for area optimization of MPRM circuits
原文传递
导出
摘要 Having the advantage of simplicity, robustness and low computational costs, the particle swarm optimization (PSO) algorithm is a powerful evolutionary computation tool for synthesis and optimization of Reed- Muller logic based circuits. Exploring discrete PSO and probabilistic transition rules, the discrete ternary particle swarm optimization (DTPSO) is proposed for mixed polarity Reed-Muller (MPRM) circuits. According to the characteristics of mixed polarity OR/XNOR expression, a tabular technique is improved, and it is applied in the polarity conversion of MPRM functions. DTPSO is introduced to search the best polarity for an area of MPRM circuits by building parameter mapping relationships between particles and polarities. The computational results show that the proposed DTPSO outperforms the reported method using maxterm conversion starting from POS Boolean functions. The average saving in the number of terms is about 11.5%; the algorithm is quite efficient in terms of CPU time and achieves 12.2% improvement on average. Having the advantage of simplicity, robustness and low computational costs, the particle swarm optimization (PSO) algorithm is a powerful evolutionary computation tool for synthesis and optimization of Reed- Muller logic based circuits. Exploring discrete PSO and probabilistic transition rules, the discrete ternary particle swarm optimization (DTPSO) is proposed for mixed polarity Reed-Muller (MPRM) circuits. According to the characteristics of mixed polarity OR/XNOR expression, a tabular technique is improved, and it is applied in the polarity conversion of MPRM functions. DTPSO is introduced to search the best polarity for an area of MPRM circuits by building parameter mapping relationships between particles and polarities. The computational results show that the proposed DTPSO outperforms the reported method using maxterm conversion starting from POS Boolean functions. The average saving in the number of terms is about 11.5%; the algorithm is quite efficient in terms of CPU time and achieves 12.2% improvement on average.
出处 《Journal of Semiconductors》 EI CAS CSCD 2013年第2期118-123,共6页 半导体学报(英文版)
基金 Project supported by the National Natural Science Foundation of China(No.61076032) the S&T Plan of Zhejiang Provincial Science and Technology Department(No.2010C31012) the S&T Plan of Zhejiang Provincial Education Department(No.Y201016317) the S&T Plan of Ningbo University(No.xk1089) the K.C.Wong Magna Fund in Ningbo University
关键词 area optimization DTPSO algorithm MPRM circuits polarity conversion area optimization DTPSO algorithm MPRM circuits polarity conversion
  • 相关文献

参考文献1

共引文献10

同被引文献45

  • 1Yang 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
  • 2WANG P, LI H, WANG Z. MPRM expressions minimi-zation based on simulated annealing genetic algorithm[CJ//IEEE. Proceedings of the 2010 International Con-ference on Intelligent Systems and Knowledge Engineer-ing. New York, USA: IEEE Press, 2010: 261-265.
  • 3AL-JASSANI B A, URQUHART N, ALMAINI A E A.Manipulation and optimisation techniques for Boolean log-ic[ J]. IET Computers and Digital Techniques, 2010,4(3): 227-239.
  • 4BEYER H G,SCHWEFEL H P. Evolution strategies: acomprehensive introduction [ J ]. Natural Computing,2002,1(1) : 3-52.
  • 5BANKS A, VINCENT J,ANYAKOHA C. A review ofparticle swarm optimization. Part I: background and de-velopment[ J] . Natural Computing, 2007 , 6(4): 467-484.
  • 6BLACKWELL T, BRANKE J. Multi-swarm optimizationin dynamic environments[ J]. Lecture Notes in ComputerScience, 2004 , 3005 : 489-500.
  • 7DRECHSLER R, BECKER B. Ordered Kronecker func-tional decision diagrams-a data structure for representa-tion and manipulation of Boolean functions [ J ]. IEEETransactions on Computer-Aided Design of Integrated Cir-cuits and Systems, 1998,17(10) : 965-973.
  • 8GLOVER F, KOCHENBERGER G A. Handbook of me- taheuristics [ M ]. New York: Springer, 2003 : 287-319.
  • 9KOUYELIS P, CHIANG W C. A simulated annealingprocedure for single row layout problems in flexible man-ufacturing systems [ J]. International Journal of Produc-tion Research, 1992, 30(4) : 717-732.
  • 10LV H, LU C, ZHA J. A hybrid DPSO-SA approach toassembly sequence planning [ C]// IEEE. Proceedingsof the 2010 International Conference on Mechatronics andAutomation. New York, USA: IEEE Press, 2010: 1998-2003.

引证文献9

二级引证文献21

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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