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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17(6), 525–532 (1973)
Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Comp. 35(8), 677–691 (1986)
Cuykendall, R., Andersen, D.R.: Reversible optical computing circuits. Optics Letters 12(7), 542–544 (1987)
Davio, M., Deschamps, J., Thayse, A.: Discrete and Switching Functions. McGraw-Hill, New York (1978)
Desoete, B., Vos, A.D.: A reversible carry-look-ahead adder using control gates. INTEGRATION, the VLSI Jour. 33(1-2), 89–104 (2002)
Fazel, K., Thornton, M.A., Rice, J.E.: ESOP-based Toffoli gate cascade generation. In: IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, pp. 206–209 (2007)
Finder, A., Drechsler, R.: An evolutionary algorithm for optimization of pseudo kronecker expressions. In: Int’l Symp. on Multi-Valued Logic, pp. 150–155 (2010)
Goldberg, D., Lingle, R.: Alleles, loci, and the traveling salesman problem. In: Int’l Conference on Genetic Algorithms, pp. 154–159 (1985)
Gupta, P., Agrawal, A., Jha, N.K.: An algorithm for synthesis of reversible logic circuits. IEEE Trans. on CAD 25(11), 2317–2330 (2006)
Keijzer, M., Merelo, J.J., Romero, G., Schoenauer, M.: Evolving objects: a general purpose evolutionary computation library. In: Int’l Conference in Evolutionary Algorithms. pp. 231–244 (2001), the EO library is available at eodev.sourceforge.net
Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5, 183 (1961)
Merkle, R.C.: Reversible electronic logic using switches. Nanotechnology 4, 21–40 (1993)
Miller, D.M., Maslov, D., Dueck, G.W.: A transformation based algorithm for reversible logic synthesis. In: Design Automation Conference, pp. 318–323 (2003)
Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge Univ. Press, Cambridge (2000)
Reed, I.: A class of multiple-error-correcting codes and their decoding scheme. IRE Trans. on Inf. Theory 3, 6–12 (1954)
Shende, V.V., Prasad, A.K., Markov, I.L., Hayes, J.P.: Synthesis of reversible logic circuits. IEEE Trans. on CAD 22(6), 710–722 (2003)
Soeken, M., Frehse, S., Wille, R., Drechsler, R.: RevKit: a toolkit for reversible circuit design. In: Workshop on Reversible Computation (2010), RevKit is available at http://www.revkit.org
Somenzi, F.: CUDD: CU Decision Diagram Package Release 2.3.1. University of Colorado at Boulder (2001), CUDD is available at www.vlsi.colorado.edu/~fabio/CUDD/
Song, N., Perkowski, M.: Minimization of exclusive sum of products expressions for multi-output multiple-valued input, incompletely specified functions. IEEE Trans. on CAD 15(4), 385–395 (1996)
Thomson, M.K., Glück, R.: Optimized reversible binary-coded decimal adders. J. of Systems Architecture 54, 697–706 (2008)
Toffoli, T.: Reversible computing. In: de Bakker, W., van Leeuwen, J. (eds.) Automata, Languages and Programming, p. 632. Springer, Heidelberg (1980), technical Memo MIT/LCS/TM-151, MIT Lab. for Comput. Sci.
Whitley, D., Starkweather, T., Fuquay, D.: Scheduling problems and traveling salesman: The genetic edge recombination operator. In: Int’l Conference on Genetic Algorithms, pp. 133–140 (1989)
Wille, R., Drechsler, R.: BDD-based synthesis of reversible logic for large functions. In: Design Automation Conference, pp. 270–275 (2009)
Zhirnov, V.V., Cavin, R.K., Hutchby, J.A., Bourianoff, G.I.: Limits to binary logic switch scaling – a gedanken model. Proc. of the IEEE 91(11), 1934–1939 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Drechsler, R., Finder, A., Wille, R. (2011). Improving ESOP-Based Synthesis of Reversible Logic Using Evolutionary Algorithms. In: Di Chio, C., et al. Applications of Evolutionary Computation. EvoApplications 2011. Lecture Notes in Computer Science, vol 6625. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20520-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-20520-0_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20519-4
Online ISBN: 978-3-642-20520-0
eBook Packages: Computer ScienceComputer Science (R0)