14th Asian Test Symposium (ATS'05) 2005
DOI: 10.1109/ats.2005.9
|View full text |Cite
|
Sign up to set email alerts
|

A Family of Logical Fault Models for Reversible Circuits

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
75
0

Year Published

2007
2007
2016
2016

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 111 publications
(76 citation statements)
references
References 7 publications
0
75
0
Order By: Relevance
“…Polian et al promoted the use of a gate fault model for QC over the stuck-at model [5]. They derived a family of logical fault models for reversible circuits composed of k-CNOT (k-input controlled-NOT) gates.…”
Section: Fault Models For Quantum Logicmentioning
confidence: 99%
“…Polian et al promoted the use of a gate fault model for QC over the stuck-at model [5]. They derived a family of logical fault models for reversible circuits composed of k-CNOT (k-input controlled-NOT) gates.…”
Section: Fault Models For Quantum Logicmentioning
confidence: 99%
“…In recent days, research in the area of reversible logic has been intensified and accelerated by the promising results. As a result, besides verification [11][12][13], testing [14][15][16], simulation [17,18], optimization [19], and debugging [20] and synthesis of reversible circuits [7], approaches exploiting permutations and truth tables [21] are main research areas. Minimizing the number of garbage outputs and number of gates are the major concerns in reversible logic circuits and it is observed that proposed 4 input ALG gate achieves minimum garbage output and leading to high speed and low power reversible circuits.…”
Section: Related Workmentioning
confidence: 99%
“…As a result, reversible logic became an intensely studied research area leading to first approaches for synthesis [8]- [13], optimization [14], [15], verification [16]- [18], testing [19]- [21], and even debugging [22]. But so far only simple circuits have been considered since most of the respective synthesis approaches still rely on Boolean function descriptions like permutations [8], truth tables [9], binary decision diagrams [13], positive-polarity Reed-Muller expansion [10], or Reed-Muller spectra [11].…”
Section: Introductionmentioning
confidence: 99%