Pattern Matching for Feasible and Efficient Physical Design Verification of Cell Libraries

被引:0
|
作者
Wu, Chan-Liang [1 ]
Lu, Chih-Wen [1 ,2 ,3 ]
机构
[1] Natl Tsing Hua Univ, Dept Engn & Syst Sci, Hsinchu 30013, Taiwan
[2] Natl Yang Ming Chiao Tung Univ, Inst Photon Syst, Tainan 71150, Taiwan
[3] Natl Cheng Kung Univ, Program Integrated Circuit Design, Tainan 701, Taiwan
关键词
pattern matching; physical verification; cell libraries; layer; density; physical design;
D O I
10.1587/transele.2024ECP5032
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This study introduces a pattern-matching method to enhance the efficiency and accuracy of physical verification of cell libraries. The pattern-matching method swiftly compares layouts of all I/O units within a specific area, identifying significantly different I/O units. Utilizing random sampling or full permutation can improve the efficiency of verification of I/O cell libraries. All permutations within an 11-unit I/O unit library can produce 39,916,800 I/O units (11!), far exceeding the capacity of current IC layout software. However, the proposed algorithm generates the layout file within 1 second and significantly reduces the DRC verification time from infinite duration to 63 seconds executing 415 DRC rules. This approach effectively improves the potential to detect layer density errors in I/O libraries. While conventional processes detect layer density and DRC issues only when adjacent I/O cells are placed due to layout size and machine constraints, in this work, the proposed algorithm selectively generates multiple distinct combinations of I/O cells for verification, crucial for improving the accuracy of physical design.
引用
收藏
页码:34 / 45
页数:12
相关论文
共 50 条
  • [31] PLS pattern matching in design of experiment, batch process data
    Gunther, J. C.
    Conner, J. S.
    Seborg, D. E.
    CHEMOMETRICS AND INTELLIGENT LABORATORY SYSTEMS, 2008, 94 (01) : 43 - 50
  • [32] Automatic Business Process Pattern Matching for Enterprise Services Design
    Gacitua-Decar, Veronica
    Pahl, Claus
    2009 WORLD CONFERENCE ON SERVICES PART, 2009, : 111 - 118
  • [33] Design and Analysis of Pattern Matching Algorithms Based on QuRAM Processing
    Soni, Kapil Kumar
    Malviya, Ashwini Kumar
    ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2021, 46 (04) : 3829 - 3851
  • [34] Design and Analysis of Pattern Matching Algorithms Based on QuRAM Processing
    Kapil Kumar Soni
    Ashwini Kumar Malviya
    Arabian Journal for Science and Engineering, 2021, 46 : 3829 - 3851
  • [35] In-Design Process Hotspot Repair Using Pattern Matching
    Jang, Daehyun
    Ha, Naya
    Jeon, Junsu
    Kang, Jae-Hyun
    Paek, Seung Weon
    Choi, Hungbok
    Kim, Kee Sup
    Lai, Ya-Chieh
    Hurat, Philippe
    Luo, Wilbur
    DESIGN FOR MANUFACTURABILITY THROUGH DESIGN-PROCESS INTEGRATION VI, 2012, 8327
  • [36] Efficient concise deterministic pattern-matching automata for ambiguous patterns
    Nedjah, N
    Mourelle, LD
    ACM SIGPLAN NOTICES, 2002, 37 (02) : 57 - 67
  • [37] Efficient Algorithm for Solving Strict Pattern Matching Under Nonoverlapping Condition
    Wu Y.-X.
    Liu X.
    Yan W.-J.
    Guo L.
    Wu X.-D.
    Wu, You-Xi (wuc567@163.com); Wu, You-Xi (wuc567@163.com); Wu, You-Xi (wuc567@163.com), 1600, Chinese Academy of Sciences (32): : 3331 - 3350
  • [38] Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform
    Daykin, J. W.
    Groult, R.
    Guesnet, Y.
    Lecroq, T.
    Lefebvre, A.
    Leonard, M.
    Mouchard, L.
    Prieur-Gaston, E.
    Watson, B.
    INFORMATION PROCESSING LETTERS, 2019, 147 : 82 - 87
  • [39] Efficient automata-driven pattern-matching for equational programs
    Nedjah, N
    Walter, CD
    Eldridge, SE
    SOFTWARE-PRACTICE & EXPERIENCE, 1999, 29 (09): : 793 - 813
  • [40] GenieHD: Efficient DNA Pattern Matching Accelerator Using Hyperdimensional Computing
    Kim, Yeseong
    Imani, Mohsen
    Moshiri, Niema
    Rosing, Tajana
    PROCEEDINGS OF THE 2020 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE 2020), 2020, : 115 - 120