Cross point assignment algorithm based on analysis of net type

Cross Point Assignment (CPA) is a routing process in the routing system between global routing and detailed routing. The aim of this process is to decide the precise physical position on the boundaries of the global routing cells (GRCs). This paper gives a new heuristic algorithm for the CPA, which bases on the analysis of the net type after global routing and takes into account the effect of the obstacles inside the GRC during the process of the CPA. This algorithm translates the CPA for the whole routing area into a sequence of single column (row) cross point assignment, and makes the CPA using the classic linear assignment algorithm.