论文标题
关于基于周期的三元可逆电路的复杂性
On the Complexity of the Cycles based Synthesis of Ternary Reversible Circuits
论文作者
论文摘要
本文研究了基于循环的2 x 2三元可逆电路实现的主要方面，考虑到所有362,880 2 x 2三元可逆函数的实现结果。已经表明，在大多数情况下，使用MMD+算法获得的实现比基于周期的实现更复杂（成本上）。在本文中，显示基于换位的条件实现可能比使用较大周期的实现更高或更低的成本。最后，这表明在一些特殊情况下，基于换位的实现的成本相同或可能比基于MMD+的实现更低的成本。根据2 x 2的n x n可逆电路考虑缩放性的各个方面。
The paper studies the main aspects of the realization of 2 x 2 ternary reversible circuits based on cycles, considering the results of the realization of all 362,880 2 x 2 ternary reversible functions. It has been shown that in most cases, realizations obtained with the MMD+ algorithm have a lower complexity (in terms of cost) than realizations based on cycles. In the paper it is shown under which conditions realizations based on transpositions may have a higher or a lower cost than realizations using larger cycles. Finally it is shown that there are a few special cases where realizations based on transpositions have the same cost or possibly lower cost than the MMD+ based realizations. Aspects of scaleability are considered in terms of 2 x 2-based n x n reversible circuits.
