{'fraction_non_alphanumeric': 0.01850362027353178, 'fraction_numerical': 0.0, 'mean_word_length': 5.158415841584159, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 1, '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 heuristic standard cell placement algorithm using constrained multistage graph model

A fast heuristic algorithm is presented for the constructive placement of standard cells based on the so-called constrained multistage graph (CMSG) model, which has a linear time complexity in the number of cells. The first step of this algorithm performs the row assignment of each cell by converting the circuit connectivity into the CMSG, where each stage of the CMSG corresponds to a cell-row in the final layout. In the second step, called the line sweep method, the position of each cell within the row is determined one by one so that the local channel density is minimized. Experimental results on benchmark circuits show that the proposed algorithm yields very competitive results in terms of the number of feedthrough cells and channel density, which was verified by the comparison of the proposed algorithm with the simulated annealing (SA) and other iterative methods such as pairwise interchange, or generalized force-directed relaxation. A theoretical time complexity analysis performed show that the complexity of the proposed algorithm is O(n), where n denotes the number of cells. This result is substantiated with experimental results. >