Improving ESOP-based synthesis of reversible logic using evolutionary algorithms

Authors:
Rolf Drechsler;Alexander Finder;Robert Wille
Affiliations:
Institute of Computer Science, University of Bremen, Bremen, Germany;Institute of Computer Science, University of Bremen, Bremen, Germany;Institute of Computer Science, University of Bremen, Bremen, Germany
Venue:
EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part II
Year:
2011

Citing 16
Cited 1

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Quantum computation and quantum information

Quantum computation and quantum information
A reversible carry-look-ahead adder using control gates

Integration, the VLSI Journal
AllelesLociand the Traveling Salesman Problem

Proceedings of the 1st International Conference on Genetic Algorithms
Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator

Proceedings of the 3rd International Conference on Genetic Algorithms
Reversible Computing

Proceedings of the 7th Colloquium on Automata, Languages and Programming
Evolving Objects: A General Purpose Evolutionary Computation Library

Selected Papers from the 5th European Conference on Artificial Evolution
A transformation based algorithm for reversible logic synthesis

Proceedings of the 40th annual Design Automation Conference
Optimized reversible binary-coded decimal adders

Journal of Systems Architecture: the EUROMICRO Journal
BDD-based synthesis of reversible logic for large functions

Proceedings of the 46th Annual Design Automation Conference
Irreversibility and heat generation in the computing process

IBM Journal of Research and Development
Logical reversibility of computation

IBM Journal of Research and Development
An Evolutionary Algorithm for Optimization of Pseudo Kronecker Expressions

ISMVL '10 Proceedings of the 2010 40th IEEE International Symposium on Multiple-Valued Logic
Minimization of exclusive sum-of-products expressions for multiple-valued input, incompletely specified functions

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Synthesis of reversible logic circuits

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
An Algorithm for Synthesis of Reversible Logic Circuits

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Exploiting negative control lines in the optimization of reversible circuits

RC'13 Proceedings of the 5th international conference on Reversible Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reversible circuits, i.e. circuits which map each possible input vector to a unique output vector, build the basis for emerging applications e.g. in the domain of low-power design or quantum computation. As a result, researchers developed various approaches for synthesis of this kind of logic. In this paper, we consider the ESOP-based synthesis method. Here, functions given as Exclusive Sum of Products (ESOPs) are realized. In contrast to conventional circuit optimization, the quality of the resulting circuits depends thereby not only on the number of product terms, but on further criteria as well. In this paper, we present an approach based on an evolutionary algorithm which optimizes the function description with respect to these criteria. Instead of ESOPs, Pseudo Kronecker Expression (PSDKRO) are thereby utilized enabling minimization within reasonable time bounds. Experimental results confirm that the proposed approach enables the realization of circuits with significantly less cost.