Via-Aware Global Routing for Good VLSI Manufacturability and High Yield

  • Authors:
  • Yang Yang;Tong Jing;Xianlong Hong;Yu Hu;Qi Zhu;Xiaodong Hu;Guiying Yan

  • Affiliations:
  • Computer Science & Technology Dept. Tsinghua Univ. Beijing, P. R. China;Computer Science & Technology Dept. Tsinghua Univ. Beijing, P. R. China;Computer Science & Technology Dept. Tsinghua Univ. Beijing, P. R. China;Computer Science & Technology Dept. Tsinghua Univ. Beijing, P. R. China;EECS Dept. UC at Berkeley U. S. A.;Inst Applied Math CAS Beijing, P. R. China;Inst Applied Math CAS Beijing, P. R. China

  • Venue:
  • ASAP '05 Proceedings of the 2005 IEEE International Conference on Application-Specific Systems, Architecture Processors
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

CAD tools have become more and more important for integrated circuit (IC) design since a complicated system can be designed into a single chip, called system-on-a-chip (SOC), in which physical design tool is an essential and critical part. We try to consider the via minimization problem as early as possible in physical design. We propose a routing method focusing on minimizing vias while considering routability and wire-length constraint. That is, in the global routing phase, we minimize the number of bends, which is closely related to the number of vias. Previous work only dealt with very small nets, but our algorithm is general for the nets with any size. Experimental results show that our algorithm can greatly reduce the count of bends for various sizes of nets while meeting the constraints of congestion and wire-length.