Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Embedding of Large Boolean Functions for Reversible Logic

Embedding of Large Boolean Functions for Reversible Logic Embedding of Large Boolean Functions for Reversible Logic MATHIAS SOEKEN, ROBERT WILLE, and OLIVER KESZOCZE, Faculty of Mathematics and Computer Science, University of Bremen, Germany, Cyber-Physical Systems, DFKI GmbH, Germany D. MICHAEL MILLER, Department of Computer Science, University of Victoria, BC, Canada ROLF DRECHSLER, Faculty of Mathematics and Computer Science, University of Bremen, Germany, Cyber-Physical Systems, DFKI GmbH, Germany Reversible logic represents the basis for many emerging technologies and has recently been intensively studied. However, most of the Boolean functions of practical interest are irreversible and must be embedded into a reversible function before they can be synthesized. Thus far, an optimal embedding is guaranteed only for small functions, whereas a significant overhead results when large functions are considered. We study this issue in this article. We prove that determining an optimal embedding is coNP-hard already for restricted cases. Then, we propose heuristic and exact methods for determining both the number of additional lines and a corresponding embedding. For the approaches, we considered sum of products and binary decision diagrams as function representations. Experimental evaluations show the applicability of the approaches for large functions. Consequently, the reversible embedding of large functions is enabled as a precursor to subsequent http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Journal on Emerging Technologies in Computing Systems (JETC) Association for Computing Machinery

Embedding of Large Boolean Functions for Reversible Logic

Download PDF
26 pages

Loading next page...
 
/lp/association-for-computing-machinery/embedding-of-large-boolean-functions-for-reversible-logic-VMv0pndpiJ

References (28)

Publisher
Association for Computing Machinery
Copyright
Copyright © 2015 by ACM Inc.
ISSN
1550-4832
DOI
10.1145/2786982
Publisher site
See Article on Publisher Site

Abstract

Embedding of Large Boolean Functions for Reversible Logic MATHIAS SOEKEN, ROBERT WILLE, and OLIVER KESZOCZE, Faculty of Mathematics and Computer Science, University of Bremen, Germany, Cyber-Physical Systems, DFKI GmbH, Germany D. MICHAEL MILLER, Department of Computer Science, University of Victoria, BC, Canada ROLF DRECHSLER, Faculty of Mathematics and Computer Science, University of Bremen, Germany, Cyber-Physical Systems, DFKI GmbH, Germany Reversible logic represents the basis for many emerging technologies and has recently been intensively studied. However, most of the Boolean functions of practical interest are irreversible and must be embedded into a reversible function before they can be synthesized. Thus far, an optimal embedding is guaranteed only for small functions, whereas a significant overhead results when large functions are considered. We study this issue in this article. We prove that determining an optimal embedding is coNP-hard already for restricted cases. Then, we propose heuristic and exact methods for determining both the number of additional lines and a corresponding embedding. For the approaches, we considered sum of products and binary decision diagrams as function representations. Experimental evaluations show the applicability of the approaches for large functions. Consequently, the reversible embedding of large functions is enabled as a precursor to subsequent

Journal

ACM Journal on Emerging Technologies in Computing Systems (JETC) – Association for Computing Machinery

Published: Dec 9, 2015

There are no references for this article.