偶宇称问题的演化可逆电路
Evolving reversible circuits for the even-parity problem
摘要：
可逆计算基本上意味着使用更少或根本不使用电力的计算。由于标准的二进制门通常不可逆，我们使用Fredkin门来实现可逆性。本文提出了一种设计可逆数字电路的算法。该算法是基于多表达式编程（MEP），一个遗传编程变种与线性表示的个人。数字电路的情况下，偶奇偶校验问题进行了研究。数值实验表明，基于MEP的算法是能够很容易地设计可逆数字电路的偶数8-奇偶校验问题。
英文摘要：
Reversible computing basically means computation with less or not at all electrical power. Since the standard binary gates are not usually reversible we use the Fredkin gate in order to achieve reversibility. An algorithm for designing reversible digital circuits is described in this paper. The algorithm is based on Multi Expression Programming (MEP), a Genetic Programming variant with a linear representation of individuals. The case of digital circuits for the even-parity problem is investigated. Numerical experiments show that the MEP-based algorithm is able to easily design reversible digital circuits for up to the even-8-parity problem.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
