{'fraction_non_alphanumeric': 0.014517506404782237, 'fraction_numerical': 0.0, 'mean_word_length': 5.136125654450262, '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 Multilevel Circuit Partitioning Algorithm Based on the Improved KL Algorithm

Very Large Scale Integration (VLSI) includes circuit partition, layout planning, layout, overall routing, detailed routing and packaging. How to design a reasonable circuit partition to reduce the complexity of VLSI design is a crucial step in the physical design of VLSI. Combining with the idea of the improved KL algorithm and the multilevel partitioning algorithm, a multilevel circuit partitioning algorithm based on the improved KL algorithm is proposed. The algorithm is based on the theory of the balanced bipartition theory of graphs, which is improved by giving a reasonable initial partition. And the coarsening phase uses the improved HEM algorithm to shrink the matching vertices to form a series of smaller graphs. When the scale of the graph is small enough, the improved KL algorithm is applied to the initial partition; then the initial partition of smaller graphs is mapped to the partition of the upper detailed graph in turn. The experimental results show that the algorithm has lower time complexity and better robustness while ensuring the accuracy of the solution.