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 条
  • [21] Quasi Text-Independent Speaker-Verification based on Pattern Matching
    Gerber, Michael
    Beutler, Rene
    Pfister, Beat
    INTERSPEECH 2007: 8TH ANNUAL CONFERENCE OF THE INTERNATIONAL SPEECH COMMUNICATION ASSOCIATION, VOLS 1-4, 2007, : 93 - 96
  • [22] Efficient Pattern Matching on CPU-GPU Heterogeneous Systems
    Sanz, Victoria
    Pousa, Adrian
    Naiouf, Marcelo
    De Giusti, Armando
    ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING (ICA3PP 2019), PT I, 2020, 11944 : 391 - 403
  • [23] More efficient left-to-right matching for overlapping pattern
    Nedjah, Nadia
    Mourelle, Luiza de Macedo
    JOURNAL OF DISCRETE ALGORITHMS, 2005, 3 (2-4) : 230 - 247
  • [24] Efficient Regular Expression Pattern Matching on Graphics Processing Units
    Ponnemkunnath, Sudheer
    Joshi, R. C.
    CONTEMPORARY COMPUTING, 2011, 168 : 92 - 101
  • [25] A memory efficient multiple pattern matching architecture for network security
    Song, Tian
    Zhang, Wei
    Wang, Dongsheng
    Xue, Yibo
    27TH IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (INFOCOM), VOLS 1-5, 2008, : 673 - 681
  • [26] Space-Efficient String Indexing for Wildcard Pattern Matching
    Lewenstein, Moshe
    Nekrich, Yakov
    Vitter, Jeffrey Scott
    31ST INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2014), 2014, 25 : 506 - 517
  • [27] Efficient hardware support for pattern matching in network intrusion detection
    Guinde, Nitesh B.
    Ziavras, Sotirios G.
    COMPUTERS & SECURITY, 2010, 29 (07) : 756 - 769
  • [28] Efficient and secure pattern matching with wildcards using lightweight cryptography
    Darivandpour, Javad
    Atallah, Mikhail J.
    COMPUTERS & SECURITY, 2018, 77 : 666 - 674
  • [29] A distributed hierarchical genetic algorithm for efficient optimization and pattern matching
    Garai, Gautam
    Chaudhuri, B. B.
    PATTERN RECOGNITION, 2007, 40 (01) : 212 - 228
  • [30] Pattern-Based Design and Verification of Secure Service Compositions
    Pino, Luca
    Spanoudakis, George
    Krotsiani, Maria
    Mahbub, Khaled
    IEEE TRANSACTIONS ON SERVICES COMPUTING, 2020, 13 (03) : 515 - 528