Sie verwenden einen Browser, in dem JavaScript deaktiviert ist. Dadurch wird verhindert, dass Sie die volle Funktionalität dieser Webseite nutzen können. Zur Navigation müssen Sie daher die Sitemap nutzen.

You are currently using a browser with deactivated JavaScript. There you can't use all the features of this website. In order to navigate the site, please use the Sitemap .

Constructive Reversible Logic Synthesis for Boolean Functions with Special Properties

Authors:: Chattopadhyay, A. , Majumder, S. , Chandak, C. , Chowdhury, N.
Editors:: Yamashita, S.
Book Title:: 6th Conference on Reversible Computation, Kyoto
Publisher:: Springer International Publishing
Series:: Lecture Notes in Computer Science
Volume:: 8507
Pages:: p.p. 95-110
Date:: Jul. 2014
ISBN:: 978-3-31908-493-0
DOI:: 10.1007/978-3-319-08494-7_8
Language:: English
Abstract:: Reversible computation is gaining increasing relevance in the context of several post-CMOS technologies, the most prominent of those being quantum computing. The problem of implementing a given Boolean function using a set of elementary reversible logic gates is known as reversible logic synthesis. Though several generic reversible logic synthesis methods have been proposed so far, yet the scalability and implementation efficiency of these methods pose a difficult challenge. Compared to these generic synthesis methods, few reversible logic synthesis approaches for restricted classes of Boolean functions demonstrated better implementation efficiency and scalability. In this paper, we propose a novel constructive reversible logic synthesis technique for Boolean functions with special properties. The proposed techniques are scalable, fast and outperforms state-of-the-art generic reversible synthesis methods in terms of quantum cost, gate count and the number of lines.
Download:: BibTeX