{'fraction_non_alphanumeric': 0.020429009193054137, 'fraction_numerical': 0.0, 'mean_word_length': 5.24203821656051, '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}}
Software to support logic synthesis from behavioral specifications

A logic synthesis package (LSP) is presented in connection with a method for generation of a logic specification from a behavioral description of a digital circuit. LSP is designed to be attached to a silicon compiler, providing a series of primitives which support typical logical synthesis operations like translation into a lower level form, verification, and minimization. The method was applied to the BELA compiler, a FSM (Finite State Machine) synthesizer tool. For the purpose of presentation, the logic synthesis method was divided into two parts. The first part involves synthesis of purely combinational logic. The second part concerns verification, the extraction of a functional form from the input description and involves sequencing. This paper covers the fist part of the synthesis method. A future paper, using the concepts developed here, shall present the second part of the synthesis method.