You are here

Decomposition of Reversible Logic Function Based on Cube-Reordering

Description: 
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.
Record Format: 
application/pdf
Record Date: 
2011-12-01T08:00:00Z
Publisher: 
PDXScholar
Subject: 
Reversible computing
Quantum computers
Logic circuits -- Design and construction
Electrical and Computer Engineering
Type: 
text
Raw Url: 
https://pdxscholar.library.pdx.edu/do/oai/?metadataPrefix=&verb=GetRecord&identifier=oai:pdxscholar.library.pdx.edu:ece_fac-1179
Source: 
Electrical and Computer Engineering Faculty Publications and Presentations
Repository Record Id: 
oai:pdxscholar.library.pdx.edu:ece_fac-1179
SetSpec: 
publication:ece
publication:communities
publication:mcecs
publication:ece_fac
Record Title: 
Decomposition of Reversible Logic Function Based on Cube-Reordering
Identifier: 
https://pdxscholar.library.pdx.edu/ece_fac/180
https://pdxscholar.library.pdx.edu/cgi/viewcontent.cgi?article=1179&context=ece_fac
Author: 
Lukac, Martin
Kameyama, Michitaka
Perkowski, Marek
Kerntopf, Pawel
Database: 
Resource OE Format: 
randomness