摘要： 提出并证明正反控制(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

中图分类号: 

• TP391