期刊文献+

An efficient and fast polarity optimization approach for mixed polarity Reed-Muller logic circuits 被引量:7

An efficient and fast polarity optimization approach for mixed polarity Reed-Muller logic circuits
原文传递
导出
摘要 Although the genetic algorithm has been widely used in the polarity optimization of mixed polarity Reed- Muller (MPRM) logic circuits, few studies have taken into account the polarity conversion sequence. In order to im- prove the efficiency of polarity optimization of MPRM logic circuits, we propose an efficient and fast polarity optimiza- tion approach (FPOA) considering the polarity conversion se- quence. The main idea behind the FPOA is that, firstly, the best polarity conversion sequence of the polarity set wait- ing for evaluation is obtained by using the proposed hybrid genetic algorithm (HGA); secondly, each of polarity in the polarity set is converted according to the best polarity con- version sequence obtained by HGA. Our proposed FPOA is implemented in C and a comparative analysis has been pre- sented for MCNC benchmark circuits. The experimental re- suits show that for the circuits with more variables, the FPOA is highly effective in improving the efficiency of polarity op- timization of MPRM logic circuits compared with the tradi- tional polarity optimization approach which neglects the po- larity conversion sequence and the improved polarity opti- mization approach with heuristic technique. Although the genetic algorithm has been widely used in the polarity optimization of mixed polarity Reed- Muller (MPRM) logic circuits, few studies have taken into account the polarity conversion sequence. In order to im- prove the efficiency of polarity optimization of MPRM logic circuits, we propose an efficient and fast polarity optimiza- tion approach (FPOA) considering the polarity conversion se- quence. The main idea behind the FPOA is that, firstly, the best polarity conversion sequence of the polarity set wait- ing for evaluation is obtained by using the proposed hybrid genetic algorithm (HGA); secondly, each of polarity in the polarity set is converted according to the best polarity con- version sequence obtained by HGA. Our proposed FPOA is implemented in C and a comparative analysis has been pre- sented for MCNC benchmark circuits. The experimental re- suits show that for the circuits with more variables, the FPOA is highly effective in improving the efficiency of polarity op- timization of MPRM logic circuits compared with the tradi- tional polarity optimization approach which neglects the po- larity conversion sequence and the improved polarity opti- mization approach with heuristic technique.
出处 《Frontiers of Computer Science》 SCIE EI CSCD 2017年第4期728-742,共15页 中国计算机科学前沿(英文版)
关键词 genetic algorithm polarity optimization MIXED genetic algorithm, polarity optimization, mixed
  • 相关文献

参考文献4

二级参考文献37

  • 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
  • 2Tan E C, Yang H. Optimization of fixed-polarity Reed-Muller circuits using dual-polarity property [J]. Circuits Systems Signal Process, 2000, 19(6): 535-548.
  • 3Jaroslaw F B, Claudia L C, Susanto R. Column polarity matrix algorithm for ternary fixed polarity Reed-Muller expansions [J]. Journal of Circuits, Systems and Computers, 2006, 15(2): 243-262.
  • 4Wang L, Almaini A E A. Exact minimization of large multiple output FPRM function [J]. Computers and Digital Techniques, 2002, 149(5): 203-212.
  • 5Xu H, Yang M, Wang L, et al. An efficient transformation method for DFRM expansions [A]. ASICON '07. 7th International Conference on 2007 [C]. Guilin, 2007, 10(22-25): 1158- 1161.
  • 6Cheng J, Chen X, Faraj K M, Almainni, A E A. 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.
  • 7Pierre Hansen, Nenad Mladenovic, Moreno Perez, et al. Variable neighborhood search [J]. European Journal of Operation Research, 2008, 191(3): 593-595.
  • 8LING Ningning, YING Wuchen, KE Weiyang, et al. A hybrid approach combining an improved genetic algorithm and optimization strategies for the asymmetric traveling salesman problem [J]. Engineering Applications of Artificial intelligence, 2008, 21(8): 1370-1380.
  • 9L U Foulds著组合最优化[M].沈明刚,周素琴,孙根娣译.上海翻译出版公司,1995.195-199.
  • 10夏银水,毛科益,叶锡恩.逻辑函数适于双逻辑实现的探测算法[J].计算机辅助设计与图形学学报,2007,19(12):1522-1527. 被引量:8

共引文献28

同被引文献35

引证文献7

二级引证文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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