Sponsor
P. Kerntopf was supported in part by the Polish Ministry of Science and Higher Education under Grant 4180/B/T02/2010/38.
Published In
Facta universitatis-series: Electronics and Energetics
Document Type
Article
Publication Date
12-2011
Subjects
Reversible computing, Quantum computers, Logic circuits -- Design and construction
Abstract
We present a novel approach to the synthesis of incompletely specified reversible logic functions. The method is based on cube grouping; the first step of the synthesis method analyzes the logic function and generates groupings of same cubes in such a manner that multiple sub-functions are realized by a single Toffoli gate. This process also reorders the function in such a manner that not only groups of similarly defined cubes are joined together but also don’t care cubes. The proposed method is verified on standard benchmarks for both reversible and irreversible logic functions. The obtained results show that for functions with a significant portion of don’t cares the proposed method outperforms previously proposed synthesis methods.
DOI
10.2298/FUEE1103403L
Persistent Identifier
http://archives.pdx.edu/ds/psu/12816
Citation Details
Lukac, Martin, Michitaka Kameyama, Marek Perkowski, and Pawel Kerntopf. "Decomposition of reversible logic function based on cube-reordering." Facta universitatis-series: Electronics and Energetics 24, no. 3 (2011): 403-422.
Description
Originally appeared in Facta universitatis-series: Electronics and Energetics, published by Niš University, and may be found at http://casopisi.junis.ni.ac.rs/index.php/FUElectEnerg.