arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1408.3586cs.ET
收藏

可逆逻辑中大型布尔函数的嵌入

Embedding of Large Boolean Functions for Reversible Logic

Mathias Soeken, Robert Wille, Oliver Keszocze, D. Michael Miller, Rolf Drechsler

摘要:

可逆逻辑是许多新兴技术的基础,最近得到了深入研究。然而,大多数实际感兴趣的布尔函数是不可逆的,必须在合成之前嵌入可逆函数。到目前为止,最佳嵌入仅对小函数有保证,而当考虑大函数时会产生显著的开销。在本文中,我们研究这个问题。我们证明了,确定一个最佳的嵌入是有限的情况下,已经CONP困难。然后,我们提出了启发式和精确的方法来确定额外的线的数量以及相应的嵌入。对于这些方法,我们考虑了乘积和二元决策图作为函数表示。实验评估表明,大型功能的方法的适用性。因此,大功能的可逆嵌入能够作为后续合成的前体。

英文摘要:

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. In this paper, we study this issue. 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 as well as a corresponding embedding. For the approaches we considered sums 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 synthesis.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑