{'fraction_non_alphanumeric': 0.014492753623188406, 'fraction_numerical': 0.0, 'mean_word_length': 6.517006802721088, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Reversible synthesis of incompletely specified Boolean functions using functional decomposition

Conventional microelectronic technology reaches its limits, and reversible logic circuits might address at least one of the problems: unwanted energy dissipation. Unfortunately, current methods of reversible function synthesis have certain limitations, including suboptimal handling of incompletely specified Boolean functions and yielding circuit sizes (and costs) that can be vastly improved upon. This paper presents the application of functional decomposition as a crucial step in synthesis of reversible logic that cost-efficiently implements incompletely specified Boolean functions. A decomposition of an incompletely specified Boolean function into a network of smaller sub-functions, subsequently synthesized into reversible blocks and composed into a reversible system, yields significantly better results than direct reversible synthesis of the original, incompletely specified Boolean function. The experimental results presented in this paper demonstrate the potential of the proposed approach.