{'fraction_non_alphanumeric': 0.022271714922048998, 'fraction_numerical': 0.0022271714922048997, 'mean_word_length': 5.164383561643835, '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 New Delay Model for Distributed RLC Trees

In current VLSI circuits, interconnect delay dominates gate delay. As a result, high-level synthesis and physical layout tools are taking interconnect delay into account. Interconnects are generally in the form of a tree rather than a single line. Thus, accurate simulation and efficient calculation of propagation delay for interconnect trees are critical to performance driven synthesis and layout [1].