메뉴 건너뛰기




Volumn , Issue , 2008, Pages 504-509

ELIAD: Efficient lithography aware detailed router with compact post-OPC printability prediction

Author keywords

Lithography; Manufacturability; OPC; Routing; VLSI

Indexed keywords

LITHOGRAPHY; MANUFACTURABILITY; OPC; ROUTING; VLSI;

EID: 51549106356     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DAC.2008.4555869     Document Type: Conference Paper
Times cited : (26)

References (25)
  • 8
    • 51549104354 scopus 로고    scopus 로고
    • Design of Integrated-Circuit Interconnects with Accurate Modeling of CMP
    • Mar
    • L. He, A. B. Kahng, K. Tarn, and J. Xiong. Design of Integrated-Circuit Interconnects with Accurate Modeling of CMP. In Proc. SPIE 5756, Mar. 2005.
    • (2005) Proc. SPIE 5756
    • He, L.1    Kahng, A.B.2    Tarn, K.3    Xiong, J.4
  • 9
    • 51549106003 scopus 로고    scopus 로고
    • http://www.cs.mcgill.ca/̃aghnei/mmain.html.
  • 10
    • 34748818857 scopus 로고    scopus 로고
    • Pattern sensitive placement for manufacturability
    • Mar
    • S. Hu and J. Hu. Pattern sensitive placement for manufacturability. In Proc. Int. Symp. on Physical Design, Mar. 2007.
    • (2007) Proc. Int. Symp. on Physical Design
    • Hu, S.1    Hu, J.2
  • 11
    • 4444331730 scopus 로고    scopus 로고
    • Optical Proximity Correction (OPC)-Friendly Maze Routing
    • June
    • L. Huang and D. F. Wong. Optical Proximity Correction (OPC)-Friendly Maze Routing. In Proc. Design Automation Conf., June 2004.
    • (2004) Proc. Design Automation Conf
    • Huang, L.1    Wong, D.F.2
  • 12
    • 51549112587 scopus 로고    scopus 로고
    • A. B. Kahng, C.-H. Park, and X. Xu. Fast Dual-Graph Based Hot-Spot Detection. In Proc. BACUS Symp. on Photomask Technology and Management, 2006.
    • A. B. Kahng, C.-H. Park, and X. Xu. Fast Dual-Graph Based Hot-Spot Detection. In Proc. BACUS Symp. on Photomask Technology and Management, 2006.
  • 14
    • 0027668505 scopus 로고
    • YOR: A yield-optimizing routing algorithm by minimizing critical areas and vias
    • Sep
    • S.-Y. Kuo. YOR: a yield-optimizing routing algorithm by minimizing critical areas and vias. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 12(9):1303-1311, Sep. 1993.
    • (1993) IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems , vol.12 , Issue.9 , pp. 1303-1311
    • Kuo, S.-Y.1
  • 16
    • 0038158890 scopus 로고    scopus 로고
    • Layout impact of resolution enhancement techniques: Impediment or opportunity?
    • L. W. Liebmann. Layout impact of resolution enhancement techniques: impediment or opportunity? In Proc. Int. Symp. on Physical Design, pages 110-117, 2003.
    • (2003) Proc. Int. Symp. on Physical Design , pp. 110-117
    • Liebmann, L.W.1
  • 17
    • 27944510181 scopus 로고    scopus 로고
    • RADAR: RET-Aware Detailed Routing Using Fast Lithography Simulations
    • Jun
    • J. Mitra, P. Yu, and D. Z. Pan. RADAR: RET-Aware Detailed Routing Using Fast Lithography Simulations. In Proc. Design Automation Conf., Jun 2005.
    • (2005) Proc. Design Automation Conf
    • Mitra, J.1    Yu, P.2    Pan, D.Z.3
  • 19
    • 24644496136 scopus 로고    scopus 로고
    • Full-chip lithography simulation and design analysis: How OPC is changing IC design
    • C. Spence. Full-chip lithography simulation and design analysis: how OPC is changing IC design. In Proc. SPIE 5751., pages 1-14, 2005.
    • (2005) Proc. SPIE , vol.5751 , pp. 1-14
    • Spence, C.1
  • 23
    • 50249163822 scopus 로고    scopus 로고
    • Accurate Detection for Process-Hotspots with Vias and Incomplete Specification
    • Nov
    • J. Xu, S. Sinha, and C. C. Chiang. Accurate Detection for Process-Hotspots with Vias and Incomplete Specification. In Proc. Int. Conf. on Computer Aided Design, Nov. 2007.
    • (2007) Proc. Int. Conf. on Computer Aided Design
    • Xu, J.1    Sinha, S.2    Chiang, C.C.3
  • 25
    • 0031338210 scopus 로고    scopus 로고
    • Crosstalk-Constrained Maze Routing Based on Lagrangian Relaxation
    • Nov
    • H. Zhou and D. Wong. Crosstalk-Constrained Maze Routing Based on Lagrangian Relaxation. In Proc. IEEE Int. Conf. on Computer Design, Nov. 1997.
    • (1997) Proc. IEEE Int. Conf. on Computer Design
    • Zhou, H.1    Wong, D.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.