期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于PSO算法的FPRM电路延时和面积优化 被引量：9

Delay and area optimization for FPRM circuits based on PSO algorithm
下载PDF
导出
摘要 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.
作者 王振海 汪鹏君 俞海珍 张会红
机构地区 宁波大学电路与系统研究所
出处 《电路与系统学报》 CSCD 北大核心 2012年第5期75-80,共6页 Journal of Circuits and Systems
基金 国家自然科学基金(61076032) 浙江省自然科学基金(Z1111219 Y1101078) 浙江省科技厅项目(2010C31012 2011R09021-04)
关键词 延时和面积优化 PSO算法 FPRM电路 极性搜索 delay and area optimization PSO algorithm FPRM circuits polarity search
分类号 TN79 [电子电信—电路与系统]
  • 相关文献

参考文献11

  • 1T Hirayama: Y Nishitani. Exact minimization of AND-EXOR expressions of practical benchmark functions [J]. Journal of Circuits, Systemsand Computers, 2009, 18(3): 465-486.
  • 2H Rahaman, D K Das, B B Bhattacharya. Testable design of AND-EXOR logic networks with universal test sets [J]. Computers and Electrical Engineering, 2009, 35(5): 644-658.
  • 3M Yang, L Wang, J R Tong, et al. Techniques for dual forms of Reed-Muller expansion conversion [J]. Integration, the VLSI Journal, 2008, 41(1): 113-122.
  • 4汪鹏君,陆金刚.基于XNOR／OR逻辑的低功耗最佳极性搜索[J].电子学报,2008,36(5):993-997. 被引量：11
  • 5李辉,汪鹏君.基于动态逻辑的MPRM电路低功耗优化设计[J].电路与系统学报,2010,15(5):99-105. 被引量：3
  • 6T K Shahana, R K ames, K P Jacob, et al. Automated synthesis of delay-reduced Reed-muller universal logic module networks [A]. in: Proceedings of 23rd NORCHIP Conference [C]. Oulu, 2005~ 1-4.
  • 7F Mauge(, C Chandre, T Uzer. Simulated annealing algorithm for finding periodic orbits of multi-electron atomic systems [J]. Communications in Nonlinear Science and Numerical Simulation, 2011, 16(7): 2845-2852.
  • 8C J Liao, C T Tseng, P Luarn. A discrete version of particle swarm optimization for flowshop scheduling problems [J]. Computers and Operations Research, 2007, 34(I 0): 3099-3111.
  • 9W N Chen, J Zhang, H S H Chung, et al. A novel set-based particle swarm optimization method for discrete optimization problems [J]. IEEE Transactions on Evolutionary Computation, 2010, 14(2): 278-300.
  • 10B A AI Jassani, N Urquhart, A E A. Almaini. Manipulation and optimisation techniques for Boolean logic [J]. IET Computers and Digital Techniques, 2010, 4(3): 227-239.

二级参考文献14

  • 1Wang Pengjun,Chen Xiexiong.TABULAR TECHNIQUES FOR OR-COINCIDENCE LOGIC[J].Journal of Electronics(China),2006,23(2):269-273. 被引量：12
  • 2K Roy, S C Prasad. Low-Power CMOS VLSI Circuit Design [M]. Canada: simultaneously, 2000.
  • 3H Zhou, D F Wong. Optimal low power XOR gate decomposition [A]. in: Design Automation Conference [C]. Los Angeles: 2000. 104-107.
  • 4S N Pradhan, S. Chattopadhyay. Two-level AND-XOR Network Synthesis with Area-Power Trade-off [J]. International Journal of Computer Science and Network Security, 2008, 8(9): 368-375.
  • 5S Kang, Y Leblebici. CMOS Digital Integrated Circuits: Analysis and Design [M]. New York: McGraw-Hill Science, 2002.
  • 6B A AI Jassani, N Urquhart, A E A Almaini. Manipulation and optimisation techniques for Boolean logic [J]. Computers and Digital Techniques, 2010, 4(3): 227-239.
  • 7H Li, P Wang, J Dai. Area Minimization of MPRM Circuits [A]. in: IEEE 8th International Conference on ASIC [C]. Changsha, 2009. 521-524.
  • 8C Y Tsui, M Pendram, A M Despain. Technology decomposition and mapping targeting low power dissipation [A]. in: Design Automation Conference [C]. Dallas, 1993.68-73.
  • 9J Cheng, X Chen, K M Faraj, et al. Expansion of logical function in the OR-coincidence system and the transform between it and maxterm expansion [J]. Computers and Digital Techniques, 2003, 150(6): 397-402.
  • 10A E A Aimaini, L McKenzie. Tabular techniques for generating Kronecker expansions [J]. Computers and Digital Techniques, 1996, 143(4): 205-212.

共引文献12

同被引文献46

  • 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
  • 2AL JASSANI B A, URQUHART N, ALMAINI A E A. Manipulation and optimisation techniques for Boole- an logic[J].IET Computers and Digital Techniques,2010,4(3):227-239.
  • 3HABIB M K. A new approach to generate fixed-polari- ty Reed-Muller expansions for completely and incom- pletely specified functions[J]. International Journal of Electronics, 2002,89 (11) : 845-876.
  • 4ZHANG Xiaoying, WANG Lingli, ZHOU Xuegong. Efficient RM conversion algorithm for large multiple output funetions[C]//9th International Conference on Solid-State and Integrated-Circuit Technology. Shang- hai: IEEE Electron Devices Society, 2008:2300- 2303.
  • 5Air JASSANI B A, URQUHART N, ALMAINI A E A. Minimization of incompletely specified mixed po- larity reed muller functions using Genetic Algorithm [C]//2009 3rd International Conference on Signals, Circuits and Systems. Tunis: IEEE Circuits and Sys terns Society and the 1EEE Signal Processing Society, 2009:1- 6.
  • 6AL JASSANI B A,URQUHART N,ALMAINI A E A.Manipulation and optimization techniques for Boolean logic[J].IET Computers and Digital Techniques,2010,4(3):227-239.
  • 7RAHAMAN H,DAS D K,BHATTACHARYA B B.Testable design of AND-EXOR logic networks with universal test sets[J].Computers and Electrical Engineering,2009,35(5):644-658.
  • 8FALKOWSKI B J,CHENG Fu.Polynomial expansions over GF (3) based on fastest transformation[C]//33rd Inter-national Symposium on Multiple-Valued Logic.Tokyo,Japan:IEEE,2003:40-45.
  • 9FALKOWSKI B J,CHENG Fu.Fastest classes of linearly independent transforms over GF (3) and their properties[J].IEE Proceedings-Computers and Digital Techniques,2005,152(5):567-576.
  • 10CHENG FU,FALKOWSKI B J.Ternary fixed polarity linear Kronecker transforms and their comparison with ternary Reed Muller transform[J].Journal of Circuits,Systems,and Computers,2005,14(4):721-733.

引证文献9

二级引证文献22

电路与系统学报
2012年 第5期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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