{'fraction_non_alphanumeric': 0.02098635886673662, 'fraction_numerical': 0.001049317943336831, 'mean_word_length': 4.925465838509317, '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}}
A Technology-Adaptive Allocation of Functional Units and Connections

A new algorithm of allocating functional units and connections in the data path synthesis has been developed. The algorithm determines the types and numbers of both functional units and connections simultaneously based on their cost (i.e., area) obtained from the input technology data. The algorithm performs trade-off between the functional units and connections to produce data paths with minimal cost. The algorithm is adaptive to different technologies: if the cost of a functional unit changes or if a new functional unit becomes available, the algorithm produces a new data path optimized in the new environment. The algorithm has O(n/sup 3/) timing complexity in the worst case, where n is the number of operations in the input problem. Experiments show that costs of data paths constructed by our algorithm are smaller than or as much as those by other published approaches.