{'fraction_non_alphanumeric': 0.006535947712418301, 'fraction_numerical': 0.0, 'mean_word_length': 5.811111111111111, '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}}
On acceleration of logic circuits optimization using implication relations

In logic synthesis the multi-level logic optimization methods using implication analysis has high performance but it needs a lot of computational time because of using test pattern generation to identify redundant faults. In this paper we proposed a fast redundancy identification method using implication relation instead of test pattern generation. Experimental results for benchmark circuits clearly show that the proposed method can accelerate the speed to identify redundancies without declining of the ability of the optimization.