Determining the Minimal Number of Lines for Large Reversible Circuits
Wille R, Keszoecze O, Drechsler R (2011)
Publication Status: Published
Publication Type: Conference contribution, Conference Contribution
Publication year: 2011
Pages Range: 1204-1207
Event location: Grenoble
ISBN: 9783981080186
DOI: 10.1109/date.2011.5763314
Abstract
Synthesis of reversible circuits is an active research area motivated by its applications e.g. in quantum computation or low-power design. The number of used circuit lines is thereby a crucial criterion. In this paper, we introduce several methods (including a theoretical upper bound) for the efficient computation or at least approximation of the minimal number of lines needed to realize a given function in reversible logic. While the proposed exact approach requires a significant amount of run-time (exponential in the worst case), the heuristic methods lead to very precise approximations in very short run-time. Using this, it can be shown that current synthesis approaches for large functions are still far away from producing optimal circuits with respect to the number of lines.
Involved external institutions
Germany (DE)How to cite
APA:
Wille, R., Keszoecze, O., & Drechsler, R. (2011). Determining the Minimal Number of Lines for Large Reversible Circuits. In Proceedings of the 14th Design, Automation and Test in Europe Conference and Exhibition, DATE 2011 (pp. 1204-1207). Grenoble.
MLA:
Wille, Robert, Oliver Keszoecze, and Rolf Drechsler. "Determining the Minimal Number of Lines for Large Reversible Circuits." Proceedings of the 14th Design, Automation and Test in Europe Conference and Exhibition, DATE 2011, Grenoble 2011. 1204-1207.
BibTeX: Download