Upload_transparent

Evolving reversible circuits for the even-parity problem

 
 
 
 
 
moltean

by moltean

Value This
Doc
Scribd
Average
     
Pages: 10 43
Words: 3336 13640
Characters: 20605 81678
Lines: 153 623
     
     
Letters per word: 6.18 5.99
Words per line: 21.8 21.89
Words per page: 333.6 317.21

Add to your reading list

Flag_red Flag this document

Document Information

1,112 Reads | 0 Comments

Description

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.

Pdf_16x16 10 Pages


Date Added

08/24/2007

Category

Uncategorized.

Tags
Groups
Copyright

Attribution Non-commercial

More info »

 

or use Facebook Connect