2014
DOI: 10.1007/978-3-319-08494-7_8
|View full text |Cite
|
Sign up to set email alerts
|

Constructive Reversible Logic Synthesis for Boolean Functions with Special Properties

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2016
2016

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 24 publications
0
1
0
Order By: Relevance
“…Its effect can be observed from the last column, in which previous rows are affected but their values are not changed. Table II V. THEORETICAL RESULTS Despite significant works on the practical reversible logic synthesis, there have been very few notable attempts [13], [14], [15] to identify the theoretical bounds of different approaches, which, if determined, would serve as the key indicator of strength/weaknesses. For theoretical upper bound determination, we resort to the following reversible logic gate libraries: We do not consider the extension of bi-directional synthesis in the following discussions.…”
Section: Optimized Synthesis Using Fredkin Gatesmentioning
confidence: 99%
“…Its effect can be observed from the last column, in which previous rows are affected but their values are not changed. Table II V. THEORETICAL RESULTS Despite significant works on the practical reversible logic synthesis, there have been very few notable attempts [13], [14], [15] to identify the theoretical bounds of different approaches, which, if determined, would serve as the key indicator of strength/weaknesses. For theoretical upper bound determination, we resort to the following reversible logic gate libraries: We do not consider the extension of bi-directional synthesis in the following discussions.…”
Section: Optimized Synthesis Using Fredkin Gatesmentioning
confidence: 99%