Title :
YOR: a yield-optimizing routing algorithm by minimizing critical areas and vias
Author_Institution :
Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan
fDate :
9/1/1993 12:00:00 AM
Abstract :
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
Keywords :
VLSI; circuit layout CAD; integrated circuit technology; minimisation; network routing; IC design; VLSI layout; YOR algorithm; benchmark routing layouts; channel routing; chip area minimisation; circuit routeing; compacted adjacent wires; critical area reduction; manufacturing yield; vias minimisation; yield-optimizing routing algorithm; Circuit faults; Costs; Degradation; Helium; Integrated circuit synthesis; Integrated circuit yield; Manufacturing; Routing; Very large scale integration; Wires;
Journal_Title :
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on