| Abstract: | The layout of datapaths is much complexer than that of a normal IC chips, because more constraints must be considered. A novel method for eliminating the net congestion of datapath chips is presented. The main idea is to modify the placement locally according to the global routing result. The problem is abstracted to a nonlinear programming problem and could be transformed to a convex one. Experimental results demonstrate that the method can eliminate the net congestion of datapath chips effectively. |
