Iterative Construct of Reversible Network Based on Cascade Operation

Article Preview

Abstract:

Reversible logic synthesis has become a fast developing area. In order to construct reversible logic gate network, this paper presents an algorithm of iterative construct reversible network by cascade operation. The cascade operation was implemented with Boolean permutation. We proposed two important decision condition of Boolean permutation, and changed to choose balance function of suffice Boolean permutation condition for the problem of construct reversible network. The result of algorithm analysis show that it is can be implemented fleetly.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 798-799)

Pages:

419-422

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] R. Landauer, Irreversibility and heat generation in the computational process, IBM Journal of Research and Development, (1961) 183-191.

Google Scholar

[2] Wille R.,  Grosse D.,  Dueck G.W.,   Drechsler R., Reversible Logic Synthesis with Output Permutation, VLSI Design, (2009)189-194.

DOI: 10.1109/vlsi.design.2009.40

Google Scholar

[3] Masahiro Iwahashi, Hitoshi Kiya, Optimumization of lifting structure of reversible KLT based on permutation of signal's order and sign. ICIP, (2010) 465-468.

DOI: 10.1109/icip.2010.5651844

Google Scholar

[4] D. Deutsch, Quantum computational networks, Royal Society of London Series A, 42(5) , (1989)73-90.

Google Scholar

[5] M. Saeedi, M. Sedighi, and M. S. Zamani. A novel synthesis algorithm for reversible circuits. In Int'l Conf. on CAD, (2007)65-68.

Google Scholar

[6] M. Honard, Heys, E. stafford and Tavares, Substitution-permutation Networks Resistant to Differential and Linear Cryptanalysis, Journal of Cryptology , 9(1), (1996)1-9.

DOI: 10.1007/bf02254789

Google Scholar