{'fraction_non_alphanumeric': 0.0221606648199446, 'fraction_numerical': 0.002770083102493075, 'mean_word_length': 5.63302752293578, '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}}
Delay constrained optimization by simultaneous fanout tree construction, buffer insertion/sizing and gate sizing

We present a novel algorithm for delay constrained optimization of combinational logic, extending the state-of-the-art sizing algorithm based on Lagrangian relaxation. We tightly integrate fanout tree construction, buffer insertion/sizing and gate sizing, thereby achieving more optimization than if they were performed independently. We consider the network in its entirety, thereby taking full advantage of the slacks available on the noncritical paths. We have implemented our algorithm and experimented with it on ISCAS-89 benchmark circuits; the results demonstrate that it is effective as well as fast.