期刊文献+

基于子种群保留的可逆电路合成混合算法 被引量:1

Species conservation-based hybrid algorithm for reversible circuit synthesis
原文传递
导出
摘要 为了进一步降低4bit以上中小规模可逆逻辑电路的量子代价,提出一种基于子种群保留的变长染色体编码混合算法.该算法在已有变长染色体编码混合算法的基础上,将子种群保留策略用于变长编码种群的进化,以保持种群多样性,避免陷入局部最优解;定义了变长编码染色体的近似度,以此作为种子提取和子种群划分的基础;提出了子种群重新启动策略和新的启发式子种群更新操作,克服变长编码种群进化过程中的遗传漂移,从而提高可行解率和解的质量.对4bit以上常用标准可逆函数测试结果表明该算法能大大降低合成可逆电路的量子代价. In order to decrease the quantum cost of small and medium‐sized reversible functions with more than 4 bit ,a species conservation‐based variable‐length encoding hybrid algorithm for reversible logic circuit synthesis was proposed based on an existing variable‐length encoding hybrid algorithm . Firstly ,the species conservation mechanism was customized and introduced into variable‐length enco‐ding population to maintain the diversity of the population .The similarity definition between chromo‐somes with different lengths was given ,based on which seeds subtraction and species differentiation were conducted .Then ,the species restart strategy and heuristic species update were proposed to a‐void the genetic draft of the population with variable‐length encoding .The experimental results show that the proposed algorithm can reduce the quantum cost of common reversible benchmarks and im‐prove the feasible ratio greatly .
出处 《华中科技大学学报(自然科学版)》 EI CAS CSCD 北大核心 2015年第11期51-57,共7页 Journal of Huazhong University of Science and Technology(Natural Science Edition)
基金 国家重点基础研究发展计划资助项目(2013CB329402) 国家自然科学基金资助项目(61422209 61203303)
关键词 可逆电路合成 子种群 变长染色体编码 多样性保持 量子代价 reversible circuits synthesis species conservation variable-length chromosome encoding diversity conserving quantum cost
  • 相关文献

参考文献19

  • 1Saeedi M,Markov I L.Synthesis and optimization of reversible circuits-a survey[J].ACM Computing Surveys,2013,45(2):94-111.
  • 2Prasad A K,Shende V V,Markov I L,et al.Data structures and algorithms for simplifying reversible circuits[J].ACM Journal on Emerging Technologies in Computing Systems,2006,2(4):277-293.
  • 3Yang G,Song X,Hung W N N,et al.Bi-directional synthesis of 4-bit reversible circuits[J].The Computer Journal,2008,51(2):207-215.
  • 4Li Z,Chen H,Xu B,et al.Fast algorithm for 4-qubit reversible logic circuits synthesis[C]∥The Proceedings of IEEE World Congress on Computational Intelligence.Piscataway:IEEE,2008:2202-2207.
  • 5Golubitsky O,Maslov D.A study of optimal 4-bit reversible Toffoli circuits and their synthesis[J].IEEE Transactions on Computers,2012,61(9):1341-1353.
  • 6Maslov D,Dueck G W,Miller D M.Techniques for the synthesis of reversible Toffoli networks[J].ACM Transactions on Design Automation of Electronic Systems,2007,12(4):42.1-42.28.
  • 7Wille R,Drechsler R.Effect of BDD optimization on synthesis of reversible and quantum logic[J].Electronic Notes in Theoretical Computer Science,2010,253(6):57-70.
  • 8Pang Y,Yan Y,Lin J,et al.An efficient method to synthesize reversible logic by using positive davio decision diagrams[J].Circuits,Systems,and Signal Processing,2014,33(10):1-15.
  • 9Bandyopadhyay C,Rahaman H,Drechsler R.A cube rairing approach for synthesis of ESOP-based reversible circuit[C]∥The Proceedings of the 44th International Symposium on Multiple-valued Logic.Piscataway:IEEE,2014:109-114.
  • 10Arabzadeh M,Zamani M S,Sedighi M,et al.Depth-optimized reversible circuit synthesis[J].Quantum Information Processing,2013,12(4):1677-1699.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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