Evolving reversible circuits for the even-parity
problem
M. Oltean. Applications of Evolutionary Computing,
EvoWorkshops2005: EvoBIO, EvoCOMNET, EvoHOT,
EvoIASP, EvoMUSART, EvoSTOC, volume 3449 of LNCS, page 225--234. Lausanne, Switzerland, Springer Verlag, (30 March-1 April 2005)
DOI: doi:10.1007/b106856
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.
%0 Conference Paper
%1 oltean:evows05
%A Oltean, Mihai
%B Applications of Evolutionary Computing,
EvoWorkshops2005: EvoBIO, EvoCOMNET, EvoHOT,
EvoIASP, EvoMUSART, EvoSTOC
%C Lausanne, Switzerland
%D 2005
%E Rothlauf, Franz
%E Branke, Juergen
%E Cagnoni, Stefano
%E Corne, David W.
%E Drechsler, Rolf
%E Jin, Yaochu
%E Machado, Penousal
%E Marchiori, Elena
%E Romero, Juan
%E Smith, George D.
%E Squillero, Giovanni
%I Springer Verlag
%K MEP algorithms, computation, evolutionary genetic programming,
%P 225--234
%R doi:10.1007/b106856
%T Evolving reversible circuits for the even-parity
problem
%V 3449
%X 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.
%@ 3-540-25396-3
@inproceedings{oltean:evows05,
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.},
added-at = {2008-06-19T17:46:40.000+0200},
address = {Lausanne, Switzerland},
author = {Oltean, Mihai},
biburl = {https://www.bibsonomy.org/bibtex/2ea17233f46507733bcce7dfb05c6b55a/brazovayeye},
booktitle = {Applications of Evolutionary Computing,
EvoWorkshops2005: {EvoBIO}, {EvoCOMNET}, {EvoHOT},
{EvoIASP}, {EvoMUSART}, {EvoSTOC}},
doi = {doi:10.1007/b106856},
editor = {Rothlauf, Franz and Branke, Juergen and Cagnoni, Stefano and Corne, David W. and Drechsler, Rolf and Jin, Yaochu and Machado, Penousal and Marchiori, Elena and Romero, Juan and Smith, George D. and Squillero, Giovanni},
interhash = {a0a6c22dc215e04b5975c3196ad38f5c},
intrahash = {ea17233f46507733bcce7dfb05c6b55a},
isbn = {3-540-25396-3},
issn = {0302-9743},
keywords = {MEP algorithms, computation, evolutionary genetic programming,},
month = {30 March-1 April},
notes = {EvoWorkshops2005},
pages = {225--234},
publisher = {Springer Verlag},
publisher_address = {Berlin},
series = {LNCS},
timestamp = {2008-06-19T17:48:53.000+0200},
title = {Evolving reversible circuits for the even-parity
problem},
volume = 3449,
year = 2005
}