{'fraction_non_alphanumeric': 0.016538037486218304, 'fraction_numerical': 0.0, 'mean_word_length': 5.439716312056738, '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}}
Common-Centroid Constrained Analog Placement

In the layout design of analog integrated circuits, common centroid constraints can effectively reduce parasitic mismatch and thermal gradients, which may otherwise degrade circuit performance. In this paper, we first survey the frontline research of common-centroid-aware layout placement algorithms and implement a graph-based packing approach to handle common centroid constraints in the analog layout design. Then we develop a naive center-based packing approach that features fast execution speed although not competitive in terms of area and dead space. By comparing both approaches above, we further propose a contour-based packing scheme that can achieve the best performance of area and dead space with slight increase in CPU time. Our experimental results demonstrate the effectiveness of the proposed scheme and validate a new direction in this area.