Abstract
Reversible logic studies have promising potential on energy lossless circuit design, quantum computation, nanotechnology, etc. This paper proposes an analogic selection sorting algorithm essentially based on the transformation-based algorithm. It uses an unweighted, undirected graph for the representation of all transformable paths. During the synthesis process, a sequence of transformations are performed to enable all the output patterns to appear in the right place. The whole process can be implemented by a sequence of Toffoli gates. In addition, a simplification algorithm is put forward to further optimize the generated circuit. The experimental results show that this algorithm, compared with other exact methods, can achieve optimal or nearly optimal solutions with less computation time. Furthermore, it is more easily understood and implemented.
This work was supported by The National Natural Science Foundation of China under Grant 60572071 and 60873101, Natural Science Foundation under Grant BK2007104 and BK2008209.
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
Deutsch, D.: Quantum theory, the Church-Turing principle and the universal quantum computer. J. Proc. Royal Soc. London 400, 97–117 (1985)
Wille, R., Groβe, D.: Fast exact Toffoli network synthesis of reversible logic. In: Proc. Int. Conf. Computer-Aided Design, pp. 60–64 (2007)
Wille, R., Le, H.M., Dueck, G.W., Groβe, D.: Quantified synthesis of reversible logic. In: Proc. Design Automation & Test Europe Conf., pp.1015–1020 (2008)
Shende, V.V., Prasad, A.K., Markov, I.L., Hayes, J.P.: Synthesis of reversible logic circuits. In: Proc. Int. Conf. Computer-Aided Design, pp. 353–360 (2002)
Hung, W.N.N., Song, X., Yang, G., Yang, J., Perkowski, M.: Quantum logic synthesis by symbolic reachability analysis. In: Proc. Design Automation Conf., pp. 838–841 (2004)
Miller, D.M., Dueck, G.W.: Spectral techniques for reversible logic synthesis. In: Proc. 6th Int. Symp. Representations Methodology of Future Computing Technologies, pp. 56–62. Trier (2003)
Kerntopf, P.: A new heuristic algorithm for reversible logic synthesis. In: Proc. Design Automation Conf., San Diego, pp. 834–837 (2004)
Maslov, D., Dueck, G.W., Miller, D.M.: Toffoli network synthesis with templates. J. IEEE Trans. Computer-Aided Design of Integrated Circuits & Systems. 6, 807–817 (2005)
Gupta, P., Agrawal, A., Jha, N.K.: An algorithm for synthesis of reversible logic circuits. J. IEEE Trans. Computer-Aided Design of Integrated Circuits & Systems 11, 2317–2530 (2006)
Zheng, Y., Huang, C.: A novel Toffoli network synthesis algorithm for reversible logic. In: Design Automation Conference, 2009. ASP-DAC 2009, Asia and South Pacific, pp. 739–744 (2009)
Saeedi, M., Saheb Zamani, M., Sedighi, M.: On the Behavior of Substitution-Based Reversible Circuit Synthesis Algorithms. In: Investigation and Improvement, ISVLSI, pp. 428–436 (2007)
Saeedi, M., Sedighi, M., Zamani, M.S.: A novel synthesis algorithm for reversible circuits. In: Proc. Int. Conf. Computer-Aided Design, pp. 65–68 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wan, S., Chen, H., Cao, R. (2009). A Novel Transformation-Based Algorithm for Reversible Logic Synthesis. In: Cai, Z., Li, Z., Kang, Z., Liu, Y. (eds) Advances in Computation and Intelligence. ISICA 2009. Lecture Notes in Computer Science, vol 5821. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04843-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-04843-2_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04842-5
Online ISBN: 978-3-642-04843-2
eBook Packages: Computer ScienceComputer Science (R0)