{'fraction_non_alphanumeric': 0.01444043321299639, 'fraction_numerical': 0.0, 'mean_word_length': 5.507042253521127, '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 Cable Harness Routing Method Based on the Expected Maximum Crosstalk

With the increasing number of interconnected cables in electronic systems, the crosstalk between interconnected cables has played an important role in the intrasystem interference performance. However, the traditional routing method based on the shortest path cannot solve the problem of cable crosstalk. In this article, a novel cable harness routing method based on the expected maximum crosstalk is proposed. First, the closed-form expression for crosstalk based on the electrically small assumption is derived from the multiconductor transmission line (MTL) equation. According to this expression, the concept of maximum overlap length corresponding to the desired maximum crosstalk is developed. In addition, a conservative strategy is proposed to deal with higher frequency cable routing. The proposed routing method consists of the escape graph and the routing algorithm based on the maximum overlap length. A Dijkstra’s algorithm variant with the maximum overlap length as the constraint condition is proposed. The proposed method is applied to two single-ended and differential signals cable harness routing cases and compared with the traditional method to show that the routing results of the proposed method would keep the crosstalk between cable harness branches below the expected maximum crosstalk.