• Articles • Previous Articles     Next Articles

A Yield-Driven Gridless Router

Qiang Zhou, Yi-Ci Cai, Duo Li, and Xian-Long Hong   

  1. Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China
  • Received:2006-09-06 Revised:2007-07-02 Online:2007-09-15 Published:2007-09-10

A new gridless router to improve the yield of IC layout is presented. The improvement of yield is achieved by reducing the critical areas where the circuit failures are likely to happen. This gridless area router benefits from a novel cost function to compute critical areas during routing process, and heuristically lays the patterns on the chip area where it is less possible to induce critical area. The router also takes other objectives into consideration, such as routing completion rate and nets length. It takes advantage of gridless routing to gain more flexibility and a higher completion rate. The experimental results show that critical areas are effectively decreased by 21% on average while maintaining the routing completion rate over 99%.

Key words: hybrid diagnosis; formal model;



[1] Chiluvuri V, Koren I. Layout synthesis techniques for yield enhancement. -\it IEEE Trans. Semiconductor Manufacturing}, 1995, 8(2): 178$\sim$187.

[2] Kahng A B. Design for yield needed for further scaling. -\it Electronics Systems and Software}, 2004, 2(2): 48.

[3] Koren I. Should yield be a design objective In -\it Proc. IEEE 2000 First International Symposium on Quality Electronic Design}, San Jose, CA, March, 2000, pp.115$\sim$120.

[4] Edenfeld D, Kahng A, Rodgers M, Zorian Y. 2003 Technology Roadmap for Semiconductors. -\it Computer}, 2004, 37(1): 47$\sim$56.

[5] Raghvendra S, Hurat P. DFM: Linking design and manufacturing. In -\it Proc. International Conference on VLSI Design}, Kolkata, India, Jan. 2005, pp.705$\sim$708.

[6] Bourai Y, Shi C J R. Layout compaction for yield optimization via critical area minimization. In -\it Proc. Design, Automation and Test in Europe Conference and Exhibition}, Paris, France, March 2000, pp.122$\sim$125.

[7] Allan G A. Targeted layout modifications for semiconductor yield-/reliability enhancement. -\it IEEE Trans. Semiconductor Manufacturing}, Nov. 2004, 17(4): 573$\sim$581.

[8] Kuo S Y. YOR: A yield-optimizing routing algorithm by minimizing critical areas and vias. -\it IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems}, Sept. 1993, 12(9): 1303$\sim$1311.

[9] Minghorng Lai, Wong D F. Maze routing with buffer insertion and wiresizing. -\it IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems}, Oct. 2002, 21(10): 1205$\sim$1209.

[10] Gang Xu, Li-Da Huang, Pan D Z, Wong M D F. Redundant-via enhanced maze routing for yield improvement. In -\it Proc. Asia and South Pacific Design Automation Conference}, Shanghai, China, Jan. 18-21, 2005, pp.1148$\sim$1151.

[11] Hailong Yao, Yici Cai, Qiang Zhou, Xianlong Hong. Multilevel routing with redundant via insertion. -\it IEEE Trans. Circuits and Systems-II: Express Briefs}, 2006, 53(10): 1148$\sim$1152.

[12] Li-Da Huang, Wong M D F. Optical proximity correction (OPC) --Friendly maze routing. In -\it Proc. Design Automation Conference}, San Diego, CA, Jun. 2004, pp.186$\sim$191.

[13] Stapper C H. Modeling of integrated circuit defect sensitivities. -\it IBM J. Res. Develop}., Nov. 1983, 27: 549$\sim$557.

[14] Xue H, Di C, Jess J A G. Fast multi-layer critical area computation. In -\it Proc. IEEE Int. Workshop on Defect and Fault Tolerance in VLSI Systems}, Venice, Italy, Oct. 1993, pp.117$\sim$124.

[15] Ousterhout J K. Corner stitching: A data-structuring technique for VLSI layout tools. -\it IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems}, 1984, 3(1): 87$\sim$100.

[16] Nilsson N. Problem-Solving Methods in Artificial Intelligence. New York: McGraw-Hill, 1971.

[17] Zhang Y, Wang B, Cai Y, Hong X. Area routing oriented hierarchical corner stitching with partial bin. In -\it Proc. Asia and South Pacific Design Automation Conference}, Yokohama, Japa, Jan. 25-28, 2000, pp.105$\sim$110.

[18] Tsai C C, Chen S J, Feng W S. An H-V alternating router. -\it IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems}, 1992, 11(8): 976$\sim$991.
[1] De-Shuai Han, Qi-Liang Yang, Jian-Chun Xing, Guang-Lian Ma. EasyModel: A Refinement-Based Modeling and Verification Approach for Self-Adaptive Software [J]. Journal of Computer Science and Technology, 2020, 35(5): 1016-1046.
[2] Issam W. Damaj. Higher-Level Hardware Synthesis of the KASUMI Algorithm [J]. , 2007, 22(1): 60-70 .
[3] Yu-Yue Du and Chang-Jun Jiang. Verifying Functions in Online Stock Trading Systems [J]. , 2004, 19(2): 0-0.
[4] SHEN Yidong;. A Theory of Hybrid Diagnosis [J]. , 1999, 14(4): 363-371.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!

ISSN 1000-9000(Print)

         1860-4749(Online)
CN 11-2296/TP

Home
Editorial Board
Author Guidelines
Subscription
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
Tel.:86-10-62610746
E-mail: jcst@ict.ac.cn
 
  Copyright ©2015 JCST, All Rights Reserved