首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于置换群的可逆网络级联
引用本文:张义清,管致锦,吕彦明.基于置换群的可逆网络级联[J].兰州理工大学学报,2008,34(4).
作者姓名:张义清  管致锦  吕彦明
作者单位:1. 南通大学,理学院,江苏,南通,226019
2. 南京航空航天大学,信息科学与技术学院,江苏,南京,210016
基金项目:国家自然科学基金,江苏省高校自然科学基金
摘    要:通过分析可逆门逻辑网络与置换群的等价关系,把可逆门网络级联转化为对称群的轮换问题.证明了任何一个相邻3轮换置换(u,s,t)可以通过4个(n-2)-CNOT门和至少2n位的NOT门生成,以此n位的偶数二元可逆网络可通过NOT和2-CNOT门构造.给出了通过对称群轮换置换级联可逆网络的方法,实例验证了该方法的正确性.结果表明,该方法没有垃圾信息输出,同时在可逆门转换方面更加灵活有效.

关 键 词:可逆逻辑门  置换群  轮换  网络级联

Reversible network cascade based on permutation group
ZHANG Yi-qing,GUAN Zhi-jin,LU Yan-ming.Reversible network cascade based on permutation group[J].Journal of Lanzhou University of Technology,2008,34(4).
Authors:ZHANG Yi-qing  GUAN Zhi-jin  LU Yan-ming
Abstract:By means of analyzing the equivalence relation of reversible gate logic network to permutation group,the reversible gate network cascade was converted into the cycle of symmetric group.It was verified that any neighboring 3-cycle permutation (u,s,t) could be generated by four(n-2)-CNOT gates and 2n NOT gates at least.Thus,n-digit even bivariate reversible network could be constructed with NOT and 2-CNOT gates.A constructing method of reversible network cascade was proposed by means of permutation of cycle of symmetric group.The validity of this method was verified by an example.The result showed that the network was without garbage output.Meantime,the trigger of the reversible gate was even more flexible and effective.
Keywords:reversible logic gate  permutation group  cycle  network cascade
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号