计算机科学 ›› 2010, Vol. 37 ›› Issue (11): 117-121.

• 计算机网络与信息安全 • 上一篇    下一篇

基于可逆函数复杂性的正反控制门可逆网络综合

倪丽惠,管致锦,聂志浪   

  1. (南通大学电子信息学院 南通226019);(南通大学计算机科学与技术学院 南通226019)
  • 出版日期:2018-12-01 发布日期:2018-12-01
  • 基金资助:
    本文受国家自然科学基金(60873069),国家高技术研究发展计划(863计划)项目(2007AA01Z404)和南通大学博上基金((09807)资助。

Reversible Network Synthesis for Positive/Negative Control Gates Based on Reversible Function's Complexity

NI Li-hui,GUAN Zhi-jin,NIE Zhi-lang   

  • Online:2018-12-01 Published:2018-12-01

摘要: 提出了基于可逆函数复杂性的正反控制(PNC, Positive/Negative ControD门可逆网络综合方法。该方法根据可逆函数的输出排列,逐次交换输出向量,在交换过程中减少函数的复杂性,直至复杂性为零。每一次向量的交换对应一个独立的PNC门。利用该方法综合部分可逆函数,并将实验结果与国际上代表性文献采用的实验用例进行比较。结果表明,构造的可逆网络在可逆门数上有一定程度的改善。

关键词: 可逆网络,PNC门,复杂性

Abstract: A methodology on synthesizing reversible network for positive/negative control (PNC) gates based on reversible function's complexity was proposed in this paper. According to the reversible function's output permutation,we exchanged the positions of two output vectors step by step to reduce the function's complexity until the complexity was zero. Each output switching corresponded to an individual PNC gate. Through synthesizing part of reversible funclions and comparing the results with the international representative cases used in other literatures, our reversible network created by the proposed method had an improvement in the number of gates.

Key words: Reversible network, PNC gates, Complexity

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!