BCDRouter: Global routing considering CMP and via reduction

Chemical-mechanical polishing (CMP) is one of the fundamental problems that should be considered for improving design for manufacturability (DFM) in routing. This paper presents a global routing algorithm, which is BCDRouter, to consider CMP. The algorithm uses the routing density of GRC to simulate the density of CMP, and reduces routing and congestion densities simultaneously. This will make the continuous CMP plainer. So that DFM, reliability and yield can be improved. The experimental results show that the algorithm is effective in reducing maximum GRC congestion and congestion variance.

[1]  Jun Gu,et al.  SSTT: Efficient local search for GSI global routing , 2003, Journal of Computer Science and Technology.

[2]  Minsik Cho,et al.  Wire Density Driven Global Routing for CMP Variation and Timing , 2006, 2006 IEEE/ACM International Conference on Computer Aided Design.

[3]  Andrew B. Kahng,et al.  Area fill synthesis for uniform layout density , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Xianlong Hong,et al.  FREe: A Fast Routability Estimator , 2006, 2006 International Conference on Communications, Circuits and Systems.

[5]  Martin D. F. Wong,et al.  Model-based dummy feature placement for oxide chemical-mechanicalpolishing manufacturability , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Andrew B. Kahng,et al.  Filling algorithms and analyses for layout density control , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..