The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
BDD-based synthesis of reversible logic for large functions
Abstract
Reversible logic is the basis for several emerging technologies such as quantum computing, optical computing, or DNA computing and has further applications in domains like low-power design and nanotechnologies. However, current methods for the synthesis of reversible logic are limited, i.e. they are applicable to relatively small functions only. In this paper, we propose a synthesis approach, that can cope with Boolean functions containing more than a hundred of variables. We present a technique to derive reversible circuits for a function given by a Binary Decision Diagram (BDD). The circuit is obtained using an algorithm with linear worst case behavior regarding run-time and space requirements. Furthermore, the size of the resulting circuit is bounded by the BDD size. This allows to transfer theoretical results known from BDDs to reversible circuits. Experiments show better results (with respect to the circuit cost) and a significantly better scalability in comparison to previous synthesis approaches.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 18,842
Graph-Based Algorithms for Boolean Function Manipulation
Bryant (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676819 · Cited by 8,891
Irreversibility and heat generation in the computing process
Landauer, R. (1961) · IBM Journal of Research and Development · doi:10.1147/rd.53.0183 · Cited by 4,980
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
Logical Reversibility of Computation
Bennett, C. H. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.176.0525 · Cited by 3,679 · cited 2×
“INTRODUCTION Reversible logic [1, 2, 3] realizes n-input n-output functions that map each possible input vector to a unique output vector (i.”
BackgroundIrreversibility and heat generation in the computing process
Landauer, R. (2000) · IBM Journal of Research and Development · doi:10.1147/rd.441.0261 · Cited by 2,585
Fredkin, E., & Toffoli, T. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857727 · Cited by 1,896 · cited 1×
“Besides the Fredkin gate [18] and the Peres gate [19]), (multiple controlled) Toffoli gates [3] are widely used.”
Toffoli, T. (1980) · Lecture Notes in Computer Science · doi:10.1007/3-540-10003-2_104 · Cited by 1,523 · cited 3×
“Besides the Fredkin gate [18] and the Peres gate [19]), (multiple controlled) Toffoli gates [3] are widely used.”
Fredkin, E., & Toffoli, T. (2001) · Cited by 1,302
Reversible logic and quantum computers
Peres, A. (1985) · Physical Review A · doi:10.1103/physreva.32.3266 · Cited by 892
Synthesis of reversible logic circuits
Shende, V. V., Prasad, A. K., Markov, I. L., & Hayes, J. P. (2003) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2003.811448 · Cited by 568
RevLib: An Online Resource for Reversible Functions and Reversible Circuits
Wille, R., Gro, D., Teuber, L., Dueck, G. W., & Drechsler, R. (2008) · 38th International Symposium on Multiple Valued Logic (ismvl 2008) · doi:10.1109/ismvl.2008.43 · Cited by 495
Self-citationA transformation based algorithm for reversible logic synthesis
Miller, D. M., Maslov, D., & Dueck, G. W. (2003) · Proceedings of the 40th annual Design Automation Conference · doi:10.1145/775832.775915 · Cited by 493
An Algorithm for Synthesis of Reversible Logic Circuits
Gupta, P., Agrawal, A., & Jha, N. K. (2006) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2006.871622 · Cited by 379
Hung, W. N. N., Song, X., Yang, G., Yang, J., & Perkowski, M. (2006) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2005.858352 · Cited by 261
Toffoli network synthesis with templates
Maslov, D., Dueck, G. W., & Miller, D. M. (2005) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2005.847911 · Cited by 227
Reversible Cascades With Minimal Garbage
Maslov, D., & Dueck, G. W. (2004) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2004.836735 · Cited by 212
Techniques for the synthesis of reversible Toffoli networks
Maslov, D., Dueck, G. W., & Miller, D. M. (2007) · ACM Transactions on Design Automation of Electronic Systems · doi:10.1145/1278349.1278355 · Cited by 187
Exact Multiple-Control Toffoli Network Synthesis With SAT Techniques
Grosse, D., Wille, R., Dueck, G. W., & Drechsler, R. (2009) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2009.2017215 · Cited by 181
Self-citationReversible electronic logic using switches
Merkle, R. C. (1993) · Nanotechnology · doi:10.1088/0957-4484/4/1/002 · Cited by 178
Data structures and algorithms for simplifying reversible circuits
Prasad, A. K., Shende, V., Markov, I. L., Hayes, J. P., & Patel, K. N. (2006) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/1216396.1216399 · Cited by 106
Effect of BDD Optimization on Synthesis of Reversible and Quantum Logic
Wille, R., & Drechsler, R. (2010) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2010.02.006 · Cited by 59
Self-citationMaslov, D., & Miller, D. M. (2007) · IET Computers & Digital Techniques · doi:10.1049/iet-cdt:20060070 · Cited by 50
Using Crosspoint Faults in Simplifying Toffoli Networks
Zhong, J., & Muzio, J. C. (2006) · doi:10.1109/newcas.2006.250942 · Cited by 25
Cited by
Synthesis and optimization of reversible circuits—a survey
Saeedi, M., & Markov, I. L. (2013) · ACM Computing Surveys · doi:10.1145/2431211.2431220 · Cited by 298
Metadata
- Authors
- Wille, R., & Drechsler, R.
- Venue
- Proceedings of the 46th Annual Design Automation Conference
- Publisher
- ACM
- Published
- 2009-07-26
- Pages
- 270-275
- ISSN
- 0738-100X (ISSN-L)
- OpenAlex
- W2122701426
- Cited by
- 323
- References
- 25
- FWCI
- 22.25
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.