Name
Abstract | ||
|---|---|---|
Reversible circuits and their synthesis methods have been actively studied in order to realize reversible computation. However, there are few known ways to debug erroneous reversible circuits. In this paper, we propose new algorithms for debugging problems. For single gate error, we improve the theoretical efficiency of previous methods, which use worst case exponential time algorithms such as SAT or decision diagrams. We also propose an algorithm debugging multiple gate error circuits by using pi DDs, decision diagrams for permutation sets. We evaluate our algorithms theoretically and experimentally, and confirm significant improvement. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-20860-2_12 | REVERSIBLE COMPUTATION, RC 2015 |
Keywords | Field | DocType |
Reversible computation, Circuit design, Permutations, Algorithms, Decision diagrams, Dynamic programming | Dynamic programming,Exponential function,Computer science,Permutation,Algorithm,Circuit design,Theoretical computer science,Electronic circuit,Computation,Debugging | Conference |
Volume | ISSN | Citations |
9138 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 8 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuma Inoue | 1 | 3 | 2.44 |
| Shin-ichi Minato | 2 | 725 | 84.72 |