YOR: A yield optimizing routing algorithm by minimizing critical areas and vias
Publisher
The University of Arizona.Rights
Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.Abstract
Traditionally, the goal of channel routing algorithms is to route the nets with as few tracks as possible to minimize the chip area and achieve 100 percent connection. However, the manufacturing yield may not reach a satisfactory level if care is not taken to reduce the critical areas which are susceptible to defects. Our approach is to systematically eliminate critical areas by floating, burying, and bumping net segments as well as shifting vias. The yield optimizing routing (YOR) algorithm also minimizes the number of vias since vias in a chip increase the manufacturing complexity which again degrades the yield. The algorithm has been implemented and applied to benchmark routing layouts in the literature. The 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 the Deutsch's difficult problem.Type
textThesis-Reproduction (electronic)
Degree Name
M.S.Degree Level
mastersDegree Program
Graduate CollegeElectrical and Computer Engineering