ACM Home Page
Please provide us with feedback. Feedback
Optical proximity correction (OPC): friendly maze routing
Full text PdfPdf (542 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 41st annual Design Automation Conference table of contents
San Diego, CA, USA
SESSION: Methods for a priori feasible layout generation table of contents
Pages: 186 - 191  
Year of Publication: 2004
ISBN:1-58113-828-8
Authors
Li-Da Huang  Texas Instruments, Austin, TX
Martin D. F. Wong  University of Illinois at Urbana-Champaign, Urbana, IL
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 20,   Downloads (12 Months): 98,   Citation Count: 16
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/996566.996622
What is a DOI?

ABSTRACT

As the technology migrates into the deep submicron manufacturing(DSM) era, the critical dimension of the circuits is getting smaller than the lithographic wavelength. The unavoidable light diffraction phenomena in the sub-wavelength technologies have become one of the major factors in the yield rate. Optical proximity correction (OPC) is one of the methods adopted to compensate for the light diffraction effect as a post layout process.However, the process is time-consuming and the results are still limited by the original layout quality. In this paper, we propose a maze routing method that considers the optical effect in the routing algorithm. By utilizing the symmetrical property of the optical system, the light diffraction is efficiently calculated and stored in tables. The costs that guide the router to minimize the optical interferences are obtained from these look-up tables. The problem is first formulated as a constrained maze routing problem, then it is shown to be a multiple constrained shortest path problem. Based on the Lagrangian relaxation method, an effective algorithm is designed to solve the problem.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
N. Cobb and A. Zakhor. "Large Area Phase-Shift Mask Design". SPIE, 2197:348--359, 1994.
 
3
N. Cobb, A. Zakhor, and E. Miloslavsky. "Mathematical and CAD Framework for Proximity Correction". SPIE, 2726:208--222, 1996.
 
4
 
5
C.-C. Fu, T. Yang, and D. R. Stone. "Enhancement of lithography patterns by using serif features". IEEE Trans. Electron Devices, 38(12):2599--2603, Dec. 1991.
 
6
K. Harazaki, Y. Hasegawa, Y. Shichijo, H. Tabuchi, and K. Fujii. "High Accurate Optical Proximity Correction under the Influences of Lens Aberration in 0.15 um Logic Process ". In International Microprocesses and Nanotechnology Conference, pages 14--15, 2000.
 
7
M. D. Levenson, N. Viswanathan, and R. A. Simpson. "Improving Resolution in Photolithography with a Phase-Shifting Mask". IEEE Trans. Electron Devices, 29(12):1828--1836, Dec. 1982.
 
8
C. A. Mack. "Understanding focus effects in submicrometer optical lithography: a review". Optical Engineering, 32(10):2350--2362, Oct. 1993.
 
9
Y. Pati, Y.-T. Wang, J.-W. Liang, and T. Kailiath. "Phase-Shift Masks: Automated Design and Mask Requirements". SPIE, 2197:314--327, 1994.
 
10
 
11
TSMC. In U.S. Technology Symposium, 2003.
 
12
K. Yamamoto, S. Kobayashi, T. Uno, T. Kotani, S. Tanaka, S. Inoue, S. Watanabe, and H. Higurashi. "Hierarchical optical proximity correction on contact hole layers". In International Microprocesses and Nanotechnology Conference, pages 40--41, 2000.

CITED BY  16

Collaborative Colleagues:
Li-Da Huang: colleagues
Martin D. F. Wong: colleagues