Paper
20 March 2019 Fast detection of largest repeating layout pattern
Author Affiliations +
Abstract
Several tools in the mask data preparation flow utilize the repetitions of patterns within a layout to reduce processing time. Conventionally, this is achieved by an analysis of the design hierarchy. However, intermediate processing in the data preparation flow can distort the hierarchy. Also, some repetitions in small-grain structures may not be represented in the hierarchy. An alternative is to learn repeating patterns and their frequency by analyzing the layout as a flat data structure. This paper demonstrates a methodology for learning the largest repeating patterns in a layout without the use of hierarchy, purely by referencing the layout as a flat data structure. The experimental results show its efficacy for layouts containing hundreds of thousands of polygons, as well as its efficiency in terms of computing time and memory usage. The results indicate that it is practical to use a distributed process to directly learn the largest repeating patterns without resorting to design hierarchy, in a reasonable runtime and memory usage.
© (2019) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jingsong Chen, James Shiely, and Evangeline F. Y. Young "Fast detection of largest repeating layout pattern", Proc. SPIE 10962, Design-Process-Technology Co-optimization for Manufacturability XIII, 109620A (20 March 2019); https://doi.org/10.1117/12.2517194
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Detection and tracking algorithms

Integrated circuits

Lithography

Pattern recognition

RELATED CONTENT

Shape optimization for DSA
Proceedings of SPIE (March 22 2016)
Normalization of correlations
Proceedings of SPIE (November 01 1991)
Algorithm for point inclusion testing based on vector
Proceedings of SPIE (October 30 2009)

Back to Top