计算机工程 ›› 2012, Vol. 38 ›› Issue (16): 287-290.doi: 10.3969/j.issn.1000-3428.2012.16.075

• 开发研究与设计技术 • 上一篇    下一篇

基于正反控制门的可逆网络化简

程学云,管致锦,陈林山,杨爱琴   

  1. (南通大学计算机科学与技术学院,江苏 南通 226019)
  • 收稿日期:2011-10-17 修回日期:2011-12-06 出版日期:2012-08-20 发布日期:2012-08-17
  • 作者简介:程学云(1978-),女,讲师,主研方向:逻辑设计,可逆计算;管致锦,教授;陈林山,本科生;杨爱琴,讲师
  • 基金项目:
    国家自然科学基金资助项目(60873069);南通市应用研究基金资助项目(K2010004);南通大学自然科学基金资助项目(03040846)

Simplification of Reversible Network Based on Positive/Negative Control Gate

CHENG Xue-yun, GUAN Zhi-jin, CHEN Lin-shan, YANG Ai-qin   

  1. (College of Computer Science and Technology, Nantong University, Nantong 226019, China)
  • Received:2011-10-17 Revised:2011-12-06 Online:2012-08-20 Published:2012-08-17

摘要: 提出并证明正反控制(PNC)门级联电路中的合并、移动和分解规则,利用此规则给出基于PNC门的可逆网络的化简算法。根据移动规则对门序列进行正向和反向双向扫描,寻找符合化简条件的两门,直到可逆网络不发生变化为止。所有3变量可逆函数上的实验结果表明,该算法能减少PNC门级联网络的门数和控制位数,降低可逆网络的代价。

关键词: 可逆逻辑综合, 可逆网络, 可逆函数, 正反控制门, 模板, 化简规则

Abstract: This paper presents and proves merging, moving and splitting rules of the Positive/Negative Control(PNC) gates, and gives the simplification algorithm for the reversible network based on PNC gates by virtue of these rules. The reversible network is scanned bidirectionally according to the moving rules, and two gates which satisfy the simplification conditions are looked for until the reversible network dose not change. Experimental results on all 3 bit functions show that the number of gates and control bits can be reduced by utilizing the algorithm and the cost of the network can be decreased greatly.

Key words: reversible logic synthesis, reversible network, reversible function, Positive/Negative Control(PNC) gate, template, simplification rule

中图分类号: