Evolving Reversible Circuits for the Even-Parity Problem

10 years 8 months ago
Evolving Reversible Circuits for the Even-Parity Problem
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-8parity problem.
Mihai Oltean
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where EVOW
Authors Mihai Oltean
Comments (0)