{'fraction_non_alphanumeric': 0.0106951871657754, 'fraction_numerical': 0.0, 'mean_word_length': 5.545454545454546, '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}}
Predicting the functional complexity of combinational circuits by symbolic spectral analysis of Boolean functions

Spectral analysis of Boolean functions represents an elegant approach to the problem of estimating the complexity of digital designs. In general, however, the use of spectral techniques in logic synthesis has been very limited in the past because Boolean functions associated with circuits of interest are usually too large and complex to allow the computation of their corresponding spectral representations using traditional techniques. In this paper we present a symbolic formulation of the logic complexity prediction problem, and we propose an ADD-based algorithm that performs well, in terms of both execution time and accuracy in the estimation, on circuits that are sensibly larger than the ones usually handled by the tools currently available. Experimental results on discussed in detail to support this claim.