YOR: a yield-optimizing routing algorithm by minimizing critical areas and vias

The author points out that the goal of a channel routing algorithm is to route all the nets with as few tracks as possible to minimize chip areas and achieve 100% connection. However, the manufacturing yield may not reach a satisfactory level if care is not taken to reduce critical areas which are susceptible to defects. These critical areas are caused by the highly compacted adjacent wires and vias in the routing region. A channel routing algorithm, the yield optimizing routing (YOR) algorithm, is presented to deal with this problem. It systematically eliminates critical areas by floating, burying, and bumping net segments as well as shifting vias. The YOR algorithm also minimizes the number of vias since vias in a chip will increase manufacturing complexity and hence degrade the yield. YOR has been implemented and applied to benchmark routing layouts in the literature. Experimental results show that large reduction in the number of critical areas and significant improvement in yield are achieved, particularly for practical size channels such as Deutsch's difficult problem. >

[1]  Martin D. F. Wong,et al.  Compacted channel routing with via placement restrictions , 1986, Integr..

[2]  C. H. Stapper,et al.  On yield, fault distributions, and clustering of particles , 1986 .

[3]  T. Ohtsuki,et al.  Recent advances in VLSI layout , 1990, Proc. IEEE.

[4]  Charles H. Stapper,et al.  Modeling of Defects in Integrated Circuit Photolithographic Patterns , 1984, IBM J. Res. Dev..

[5]  Charles H. Stapper,et al.  Large-Area Fault Clusters and Fault Tolerance in VLSI Circuits: A Review , 1989, IBM J. Res. Dev..

[6]  Suchai Thanawastien,et al.  DTR: A Defect-Tolerant Routing Algorithm , 1989, 26th ACM/IEEE Design Automation Conference.

[7]  John Paul Shen,et al.  Inductive Fault Analysis of MOS Integrated Circuits , 1985, IEEE Design & Test of Computers.

[8]  Wojciech Maly,et al.  Modeling of Lithography Related Yield Losses for CAD of VLSI Circuits , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  Jason Cong,et al.  Via Minimization by Layout Modification , 1989, 26th ACM/IEEE Design Automation Conference.

[10]  Takeshi Yoshimura,et al.  Efficient Algorithms for Channel Routing , 1982, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[11]  Sumio Masuda,et al.  Via Minimization for Gridless Layouts , 1987, 24th ACM/IEEE Design Automation Conference.

[12]  Charles H. Stapper,et al.  Modeling of Integrated Circuit Defect Sensitivities , 1983, IBM J. Res. Dev..