Evolving reversible circuits for the even-parity problem

TL;DR

This paper presents an algorithm using Multi Expression Programming to design reversible digital circuits, successfully addressing the even-parity problem with circuits up to size 8, advancing reversible computing methods.

Contribution

It introduces a novel MEP-based algorithm for designing reversible circuits, specifically applied to the even-parity problem, demonstrating its effectiveness.

Findings

Successfully designed reversible circuits for even-8-parity problem

MEP-based algorithm outperforms traditional methods in circuit design

Reversible circuits achieved with minimal power consumption

Abstract

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.