{'fraction_non_alphanumeric': 0.014066496163682864, 'fraction_numerical': 0.0, 'mean_word_length': 5.314516129032258, '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 global routing algorithm for analog circuits using a resistor array model

We propose a global routing method which considers all the nets simultaneously on the whole layout surface by incorporating a concept of "probability of routing". In contrast to conventional routing methods which look for a routing path net by net locally, our method gradually defines all the routing paths considering wire length, crosstalk and congestion in every routing channel, thereby a globally optimized solution can be expected. A resistor array model is developed to evaluate the probability of routing under global consideration of all the routing channels. Experimental examples confirm that our method can adjust trade-offs among analog-related constraints such as crosstalk and wire length.