A Robust Detailed Placement for MixedSize IC Designs

Abstract — The rapid increase in IC design complexity and wide-spread use of intellectual-property (IP) blocks have made the so-called mixed-size placement a very important topic in re-cent years. Although several algorithms have been proposed for mixed-sized placements, most of them primarily focus on the global placement aspect. In this paper we propose a three-step approach, named XDP, for mixed-size detailed placement. First, a combination of constraint graph and linear programming is used to legalize macros. Then, an enhanced greedy method is used to legalize the standard cells. Finally, a sliding-window-based cell swapping is applied to further reduce wirelength. The impact of individual techniques is analyzed and quantified. Experiments show that when applied to the set of global placement results gen-erated by APlace [1], XDP can produce wirelength comparable to the native detailed placement of APlace, and 3 % shorter wire-length compared to Fengshui 5.0 [2]. When applied to the set of global placements generated by mPL6 [3], XDP is the only de-tailed placement that successfully produces legal placement for all the examples, while APlace and Fengshui fail for and of the examples. For cases where legal placements can be compared, the wirelength produced by XDP is shorter by 3 % on average compared to APlace and Fengshui. Furthermore, XDP displays a higher robustness than the other tools by covering a broader spectrum of examples by different global placement tools. I