Calculation method of parallel projection length between layout graphics and computer storage medium

By proposing an efficient parallel projection length calculation method in electronic design automation, combining high-performance graphics computing engine and distributed computing system, the problem of low computing efficiency in the existing technology is solved, and PRL rules in large-scale integrated circuits are realized Check the efficiency and support of different scales of granularity.

CN117574847BActive Publication Date: 2024-11-19SHENZHEN GOUWEIXIN TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202311606962.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-11-29
Publication Date
2024-11-19
Estimated Expiration
2043-11-29

AI Technical Summary

Technical Problem

The prior art has low computational efficiency when calculating parallel projection lengths between metal layers, especially when the spacing is greater than or equal to the distance required by the parallel projection length rule, resulting in parallel projection length check efficiency in physical verification of large-scale integrated circuits. Not high.

Method used

A method for calculating parallel projection lengths between layout graphics is proposed. By obtaining the outer contour of the graphics, filling the rectangular clusters, building the smallest boundary rectangle, and calculating the parallel projection lengths based on the number of rectangular clusters and the arrangement direction, combining the high-performance graphics calculation engine and Distributed parallel computing system to realize efficient PRL rule checking.

Benefits of technology

It realizes the efficiency of PRL rule checking in large-scale integrated circuit physical verification design rule checking, optimizes the parallel projection length calculation process, reduces the computation time complexity, and supports inspection of different scales of granularity, simplifies user-level use and maintenance.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117574847B_ABST
    Figure CN117574847B_ABST
Patent Text Reader

Abstract

The present invention discloses a method for calculating the parallel projection length between layout graphics and a computer storage medium. The method for calculating the parallel projection length between layout graphics is used to calculate the parallel projection length between a first graphic to be tested and a second graphic to be tested, including: obtaining the outer contours of the first graphic to be tested and the second graphic to be tested, and filling a rectangular cluster in the common area between the first graphic to be tested and the second graphic to be tested; detecting the number of the rectangular clusters, and determining whether the number of the rectangular clusters is greater than a preset number; when the determination is yes, constructing a minimum bounding rectangle for all the rectangular clusters, and obtaining the parallel projection length based on the minimum bounding rectangle. Compared with the prior art, the present invention can optimize the calculation process of the parallel projection length, and can effectively reduce the time required for parallel projection length inspection.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention relates to the field of electronic design automation, in particular to a parallel projection length calculation method and a computer storage medium. Background Art

[0002] In Electronic Design Automation (EDA), Design Rule Checking (DRC) is a physical verification process that checks whether the layout data complies with the process manufacturing rules to ensure that the layout design meets the manufacturing requirements and avoids adverse effects such as short circuits and open circuits caused by violations of design rules. The most basic design rules include width rules, spacing rules, enclosed rules, parallel run length (PRL) rules, etc.

[0003] In the metal layer manufacturing process, the small spacing between metals will lead to a highly complex manufacturing process and a high probability of metal line short circuits. In addition, the reliability check of time-dependent dielectric breakdown (TDDB) is also very dependent on the spacing between metal layers. Generally speaking, the probability of failure caused by metal layer short circuit is related to the spacing between metal layer patterns and the parallel projection length between patterns. From this, we can define the following empirical rules:

[0004]

[0005] Among them, K is the normalization parameter, PRL is the parallel projection length between the two figures, and S is the distance between the two figures.

[0006] PRL value calculation is generally divided into sum mode and split mode.

[0007] The sum mode calculates the length of consecutive projections between edge pairs, such as Figure 1 As shown,<e1,e3> ,<e4,e1> ,<e3,e2> ,<e4,e2> The PRL of is equal to L;

[0008] The split mode calculates the projection length of each edge pair, such as Figure 2 As shown, L1, L2, and L3 correspond to the projection lengths of e1-e3, e1-e4, and e2-e4, respectively.

[0009] However, both the sum mode and the split mode have the problem of obtaining the parallel projection length, especially when the spacing between the two figures is greater than or equal to the distance value required by the parallel projection length rule. Since it is necessary to traverse and search for the horizontal and vertical edges of the violating multi-deformation, there will be computational efficiency problems when checking the parallel projection length in physical verification of large-scale integrated circuits.

[0010] Therefore, how to design a parallel projection length calculation method and computer storage medium that can optimize the calculation process of the parallel projection length is a technical problem that needs to be solved urgently in the industry. Summary of the invention

[0011] In view of the problem of computational efficiency in the prior art for obtaining the parallel projection length, the present invention proposes a method for calculating the parallel projection length between layout graphics and a computer storage medium.

[0012] The technical solution of the present invention is to propose a method for calculating the parallel projection length between layout graphics, which is used to calculate the parallel projection length between a first graphic to be tested and a second graphic to be tested, comprising:

[0013] Obtaining the outer contours of the first figure to be tested and the second figure to be tested, and filling a rectangular cluster in a common area between the first figure to be tested and the second figure to be tested;

[0014] Detecting the number of the rectangular clusters, and determining whether the number of the rectangular clusters is greater than a preset number;

[0015] When the determination is yes, a minimum bounding rectangle is constructed for all the rectangular clusters, and the parallel projection length is obtained according to the minimum bounding rectangle.

[0016] Further, obtaining the outer contours of the first pattern to be measured and the second pattern to be measured includes:

[0017] Traversing the horizontal edges of the first figure to be tested and the second figure to be tested in sequence;

[0018] Obtain all vertical edges connected to the horizontal edge and having interior angles of 90 degrees or 270 degrees;

[0019] All the horizontal edges and the vertical edges are connected in a traversal order, and the connected broken lines are used as the outer contours of the first figure to be measured and the second figure to be measured.

[0020] Further, filling a rectangular cluster in a common area between the first pattern to be tested and the second pattern to be tested includes:

[0021] Acquire the positions of the vertical edges of the first figure to be tested and the second figure to be tested in a common area;

[0022] Dividing the common area into a plurality of sub-areas according to the vertical edges, the number of the sub-areas being the number of vertical edges not in the same position as the horizontal edge plus one;

[0023] Each of the sub-regions is filled, and a graphic after each of the sub-regions is filled is used as the rectangular cluster.

[0024] Further, a minimum bounding rectangle is constructed for all the rectangular clusters, including:

[0025] Obtain the first vertex located at the outermost side in the horizontal direction and the second vertex located at the outermost side in the vertical direction of all the rectangular clusters;

[0026] The minimum bounding rectangle is constructed by using the first vertex and the second vertex as vertices of the minimum bounding rectangle.

[0027] Further, obtaining the parallel projection length according to the minimum bounding rectangle includes:

[0028] Determining the arrangement direction of the first pattern to be tested and the second pattern to be tested;

[0029] When the arrangement direction of the first pattern to be tested and the second pattern to be tested is horizontal, the length of the minimum boundary rectangle is used as the parallel projection length;

[0030] When the arrangement direction of the first pattern to be tested and the second pattern to be tested is a vertical direction, the width of the minimum boundary rectangle is used as the parallel projection length.

[0031] Furthermore, the preset number is 1.

[0032] Further, when it is determined that the number of the rectangular clusters is not greater than a preset number, the parallel projection length calculation method includes:

[0033] The obtained rectangle cluster is directly used as the minimum bounding rectangle, and the parallel projection length is obtained using the minimum bounding rectangle.

[0034] Further, when the first pattern to be measured and the second pattern to be measured have no common area, the parallel projection length calculation method includes:

[0035] Acquire a third vertex on the first figure to be tested that is closest to the second figure to be tested, and a fourth vertex on the second figure to be tested that is closest to the first figure to be tested;

[0036] The minimum bounding rectangle is constructed by using the third vertex and the fourth vertex as vertices of the minimum bounding rectangle.

[0037] Further, when the first figure to be measured and the second figure to be measured have no common area, obtaining the parallel projection length according to the minimum boundary rectangle includes:

[0038] Determining the arrangement direction of the first pattern to be tested and the second pattern to be tested;

[0039] When the arrangement direction of the first pattern to be tested and the second pattern to be tested is horizontal, the opposite value of the length of the minimum boundary rectangle is used as the parallel projection length;

[0040] When the arrangement direction of the first pattern to be measured and the second pattern to be measured is a vertical direction, the opposite value of the width of the minimum boundary rectangle is used as the parallel projection length.

[0041] The present invention also proposes a computer storage medium storing computer executable instructions. When the executable instructions are executed by a processor, the processor executes the above-mentioned parallel projection length calculation method.

[0042] Compared with the prior art, the present invention has at least the following beneficial effects:

[0043] The present invention proposes an efficient parallel projection length calculation method, which realizes the high efficiency of PRL rule checking in large-scale integrated circuit physical verification design rule checking (DRC). From the algorithm implementation level, the present invention combines a high-performance graphics computing engine, a query engine and a distributed parallel computing system, so that the parallel projection length check of different scale granularities can be met, and the calculation of the parallel projection length can be realized according to the specified PRL_mode. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative labor.

[0045] Figure 1 It is a schematic diagram of two calculation modes of parallel projection length in the prior art;

[0046] Figure 2 It is a schematic diagram of the parallel projection length when the distance S between two graphics is less than the PRL value in the sum mode in the prior art;

[0047] Figure 3 It is a schematic diagram of the parallel projection length when the distance S between two graphics is greater than the PRL value in the sum mode in the prior art;

[0048] Figure 4 A schematic diagram of filling a rectangular cluster in the parallel projection length calculation used in the present invention;

[0049] Figure 5 It is a schematic diagram of the model flow of parallel projection length in the present invention;

[0050] Figure 6 It is the overall flow chart of parallel projection length calculation in the present invention;

[0051] Figure 7 This is a schematic diagram of a model flow chart when the parallel projection length is a negative value in another embodiment of the present invention;

[0052] Figure 8 It is the SVRF (Standard Verification Rule Format) syntax in the prior art;

[0053] Fig. 9 The OOVF (Object Oriented Verification Format) syntax provided by the present invention. DETAILED DESCRIPTION

[0054] In order to make the technical problems, technical solutions and beneficial effects to be solved by the present invention more clearly understood, the present invention is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention.

[0055] Thus, a feature indicated in this specification will be used to illustrate one of the features of an embodiment of the present invention, rather than implying that each embodiment of the present invention must have the described feature. In addition, it should be noted that this specification describes many features. Although some features can be combined together to illustrate possible system designs, these features can also be used in other combinations that are not explicitly described. Thus, unless otherwise stated, the described combinations are not intended to be limiting.

[0056] The principle and structure of the present invention are described in detail below with reference to the accompanying drawings and embodiments.

[0057] Figure 1 is a schematic diagram of two calculation modes of parallel projection length in the prior art, Figure 1 The upper part is a schematic diagram of the sum mode. Figure 1 The lower part is a schematic diagram of the split mode. Compared with the sum mode, the split mode has a more complicated traversal process. In terms of algorithm formation, the current mainstream sum mode is mainly divided into two cases:

[0058] like Figure 2 For the first case (the spacing S between the two graphics is less than the parallel projection spacing PRL), it includes the steps of:

[0059] 1) Construct a PRL( Figure 2 In the upper part of the figure, the line segment between the two figures) is a closed small rectangle with a width of 1dbu unit length ( Figure 2 The rectangle between the two figures in the lower part of );

[0060] 2) Then determine the projection area between the two figures ( Figure 2 In the calculation, we can determine whether the polygon formed by the area between the two figures can contain the constructed closed small rectangle, so as to determine whether the parallel projection length meets the rule requirements.

[0061] like Figure 3 For the second case (the spacing S between the two graphics is greater than the parallel projection spacing PRL), it includes the steps of:

[0062] 1) First, we need to find a rectangular cluster that meets the conditions ( Figure 3 In the figure, the horizontal edge of the area R1, R2, R3) between the two figures.

[0063] 2) Then find the vertical side that is adjacent to the horizontal side and has an interior angle of 90° and an exterior angle of 270°.

[0064] 3) Finally, take out the horizontal edges connected to the vertical edges and combine them into a broken line ( Figure 3 ), the polyline composed of horizontal and vertical edges is constructed into a polygon with a width of 1dbu ( Figure 3 The horizontal length of the polygon is calculated as the parallel projection length PRL value.

[0065] Figure 8 In the prior art, the SVRF (Standard Verification Rule Format) syntax at the user level has a relatively clear logic, but it is extremely cumbersome and complex, not easy to use, and difficult to maintain later.

[0066] From the above, it can be seen that in the current calculation method of parallel projection length, whether it is sum mode or split mode, there is a problem in obtaining the parallel projection length, especially when the distance between the two figures is greater than or equal to the distance value required by the parallel projection length rule. Since it is necessary to traverse and search for the horizontal and vertical edges of the illegal multi-deformation, there will be a problem of calculation efficiency when checking the parallel projection length in the physical verification of large-scale integrated circuits.

[0067] The idea of ​​the present invention is to propose a method for calculating the parallel projection length between layout graphics, which is used to calculate the parallel projection length between a first graphic to be tested and a second graphic to be tested. The method specifically includes the following steps:

[0068] Obtaining the outer contours of the first figure to be tested and the second figure to be tested, and filling a rectangular cluster in a common area between the first figure to be tested and the second figure to be tested;

[0069] Detecting the number of rectangular clusters and determining whether the number of rectangular clusters is greater than a preset number;

[0070] When the judgment is yes, a minimum bounding rectangle is constructed for all rectangular clusters, and the parallel projection length is obtained according to the minimum bounding rectangle.

[0071] The calculation method of the present invention unifies the calculation methods in the two cases of the sum mode, and combines high-performance graphics calculation and query engine to calculate the parallel projection length (PRL value), which can meet the parallel projection length check of different scale granularities, and realize the calculation of the parallel projection length according to the specified PRL_mode.

[0072] Among them, in the above steps, obtaining the outer contours of the first figure to be measured and the second figure to be measured includes:

[0073] Traversing the horizontal edges of the first figure to be tested and the second figure to be tested in sequence;

[0074] Get all vertical edges that are connected to the horizontal edge and whose internal angles are 90 degrees or 270 degrees;

[0075] All horizontal edges and vertical edges are connected in a traversal order, and the connected polylines are used as the outer contours of the first figure to be tested and the second figure to be tested.

[0076] The present invention can facilitate the subsequent filling of the rectangular cluster by acquiring the outer contours of the first figure to be tested and the second figure to be tested, thereby meeting the design requirements of the present invention.

[0077] Specifically, in the above steps, filling a rectangular cluster in a common area between the first pattern to be tested and the second pattern to be tested includes:

[0078] Acquire the positions of the vertical edges of the first figure to be tested and the second figure to be tested in the common area;

[0079] Divide the common area into multiple sub-areas according to the vertical edges, and the number of sub-areas is the number of vertical edges that are not in the same position as the horizontal edge plus one;

[0080] Fill each sub-region and use the filled graphics of each sub-region as a rectangular cluster.

[0081] like Figure 4As shown, it is a schematic diagram of filling a rectangular cluster in the present invention. Figure 4 The upper part of is a first figure to be tested, which has a vertical edge;

[0082] Figure 4 The lower part is a second figure to be tested, which has a vertical edge;

[0083] Meanwhile, the vertical edges of the first figure to be tested and the second figure to be tested are not at the same horizontal position, so the number of vertical edges used for determination in the present invention is 2, and thus the number of rectangular clusters is 3. Figure 4 The sub-regions in the middle are divided according to the vertical edges of the present invention, namely R1, R2, and R3, and the rectangular clusters finally obtained by the division.

[0084] Furthermore, in the above steps, the minimum bounding rectangle is constructed for all rectangular clusters, including:

[0085] Get the first vertex located at the outermost side in the horizontal direction and the second vertex located at the outermost side in the vertical direction of all rectangular clusters;

[0086] Construct a minimum bounding rectangle using the first vertex and the second vertex as the vertices of the minimum bounding rectangle.

[0087] like Figure 5 As shown, Figure 5 The left part is the rectangular clusters R1, R2, and R3 obtained in the present invention. Figure 5 The upper right part is a graph obtained by extracting the rectangular clusters R1, R2, and R3. According to the above method, the first vertex in the present invention is the vertex at the upper left corner of the rectangular cluster R1 and the vertex at the lower right corner of the rectangular cluster R3;

[0088] The second vertex is the vertex at the upper left corner of the rectangular cluster R1 and the vertex at the lower right corner of the rectangular cluster R3;

[0089] In this embodiment, the first vertex and the second vertex are completely consistent, so the minimum bounding rectangle can be constructed using the above two vertices. The obtained minimum bounding rectangle is the minimum rectangle that can just include all rectangular clusters. Then, based on the length or width of the minimum bounding rectangle, the parallel projection length can be directly obtained.

[0090] Furthermore, in the above steps, obtaining the parallel projection length according to the minimum bounding rectangle includes:

[0091] Determining the arrangement direction of the first pattern to be tested and the second pattern to be tested;

[0092] When the arrangement direction of the first pattern to be tested and the second pattern to be tested is horizontal, the length of the minimum boundary rectangle is used as the parallel projection length;

[0093] When the arrangement direction of the first pattern to be tested and the second pattern to be tested is perpendicular to each other, the width of the minimum boundary rectangle is used as the parallel projection length.

[0094] Since the arrangement directions of the first and second patterns to be tested may be both horizontal or vertical, after obtaining the minimum bounding rectangle, the horizontal side cannot be directly used as the parallel projection length, but needs to be confirmed based on the arrangement directions of the first and second patterns to be tested. Figure 4 and Figure 5 In this embodiment, the arrangement directions of the first and second patterns to be tested are both horizontal, so after obtaining the minimum bounding rectangle, the horizontal side of the minimum bounding rectangle can be directly used as the parallel projection length. It should be pointed out that the horizontal side here is determined by the side parallel to the first and second patterns to be tested.

[0095] Furthermore, in the calculation process of the present invention, whether the number of rectangular clusters is greater than a preset number is determined because when the number of rectangular clusters is 1, the area between the first figure to be tested and the second figure to be tested is already a minimum boundary rectangle, and there is no vertical edge, so the parallel projection length can be directly obtained.

[0096] According to the above principle, the preset number is set to 1 in the present invention.

[0097] In the above steps, when it is determined that the number of rectangular clusters is not greater than the preset number, the parallel projection length calculation method includes:

[0098] The obtained rectangle cluster is directly used as the minimum bounding rectangle, and the parallel projection length is obtained using the minimum bounding rectangle.

[0099] See also Figure 7 The present invention can also realize the check of the parallel projection length being a negative number, which comprises the following steps:

[0100] When the first figure to be measured and the second figure to be measured have no common area, the parallel projection length calculation method includes:

[0101] Obtaining a third vertex on the first figure to be tested that is closest to the second figure to be tested, and a fourth vertex on the second figure to be tested that is closest to the first figure to be tested;

[0102] A minimum bounding rectangle is constructed using the third and fourth vertices as vertices of the minimum bounding rectangle.

[0103] like Figure 7 As shown, the first figure to be tested is the two figures above, the second figure to be tested is the figure below, and the third vertex is Figure 7 The vertex at the lower right corner of the left figure above and Figure 7 The vertex at the lower left corner of the right figure above;

[0104] The fourth vertex is Figure 7 The vertices in the upper left corner and the upper right corner of the figure below;

[0105] Since there are two first graphics to be tested in the present invention, two minimum bounding rectangles can be obtained, which are respectively Figure 7 The vertex at the lower right corner of the left figure above is Figure 7 The top left vertex of the following figure forms the first minimum bounding rectangle, and Figure 7 The vertex at the lower left corner of the right figure above is Figure 7 The vertex at the upper right corner of the figure below constructs the second minimum bounding rectangle.

[0106] After obtaining the minimum bounding rectangle, the parallel projection length can be obtained. The specific methods include:

[0107] Determining the arrangement direction of the first pattern to be tested and the second pattern to be tested;

[0108] When the arrangement direction of the first pattern to be tested and the second pattern to be tested is horizontal, the opposite value of the length of the minimum boundary rectangle is used as the parallel projection length;

[0109] When the arrangement direction of the first pattern to be tested and the second pattern to be tested is perpendicular to each other, the opposite value of the width of the minimum boundary rectangle is used as the parallel projection length.

[0110] Figure 7 In the embodiment, the arrangement directions of the first pattern to be measured and the second pattern to be measured are both horizontal, so after obtaining the first minimum bounding rectangle and the second minimum bounding rectangle, the opposite value of their lengths can be used as the parallel projection length.

[0111] See also Figure 6 , the overall process of the present invention can be divided into:

[0112] 1) Initialization: allocate some variables for storing information about the offending rectangle cluster, and a graph query engine for searching the input graph;

[0113] 2) Traverse the violation rectangle cluster: traverse all violation rectangle clusters based on the violation rectangle cluster query method in the high-performance graph query engine;

[0114] 3) Calculate PRL and record related attributes: Based on the violation rectangle clusters found in step 2, calculate the number of violation rectangle clusters.

[0115] If the number of clusters of violation rectangles is 1, the parallel projection length of the violation rectangles is calculated according to whether the figure is horizontal and the filtering conditions required by the rule, and then the violation rectangles that meet the requirements are stored in the output;

[0116] Otherwise, the minimum bounding rectangle is first obtained through the minimum bounding rectangle query method, and then the parallel projection length of the merged minimum bounding rectangle is calculated according to the filtering conditions required by the rule and whether the graphic is horizontal. Finally, the violation rectangle cluster that meets the filtering conditions required by the rule is stored in the output result.

[0117] The following combination Figure 4 , Figure 5 , Figure 6 The above process is described in detail.

[0118] Define some variables for storing the attribute of the violation rectangle cluster (that is, the rectangle cluster mentioned above), such as the size of the violation rectangle cluster, output, etc., and use an efficient graph query engine to retrieve the violation rectangle cluster.

[0119] Call the cluster query method of the high-performance graph query engine, traverse all violation rectangle clusters, and calculate the size of each violation rectangle cluster.

[0120] If the number of clusters of violation rectangles is equal to 1, the parallel projection length is calculated according to the filtering conditions required by the rule and whether the graphic is horizontal, and the relevant attributes of the violation rectangles that meet the filtering conditions required by the rule are stored in the output;

[0121] If the number of violation rectangle clusters is not equal to 1, first obtain the minimum bounding rectangle through the minimum bounding matrix retrieval method, then calculate the parallel projection length of the merged minimum bounding rectangle according to the filtering conditions required by the rule and whether the graphic is horizontal, and finally write the cluster that meets the filtering conditions required by the rule back to the output. After each cluster traversal, remove all data stored in the violation rectangle cluster, and finally return the number of violation rectangles that meet the filtering conditions required by the rule after traversing all clusters.

[0122] In terms of user-oriented use, the present invention provides an OOVF (Object Oriented Verification Format) syntax, which is simpler and easier to use than the industry's. Specific examples are as follows: Fig. 9 As shown:

[0123] The user can calculate the PRL value by setting the four attribute keywords: is_PRL, PRL, PRL_mode and PRL_distance. The description of the attribute keywords is as follows:

[0124] is_PRL: Determines whether the edge pair meets the PRL constraints based on the PRL, PRL_distance, and PRL_mode of all rules.

[0125] PRL: Run length constraint when judging whether an edge pair meets the run length and space requirements.

[0126] PRL_mode: selectable sum or split mode.

[0127] PRL_distance: Space constraint when determining whether an edge pair meets the run length and space requirements.

[0128] The present invention also proposes a computer storage medium storing computer executable instructions. When the executable instructions are executed by a processor, the processor executes the above-mentioned parallel projection length calculation method.

[0129] Compared with the prior art, the present invention proposes an efficient parallel projection length rule checking method, which realizes the high efficiency of PRL rule checking in large-scale integrated circuit physical verification design rule checking (DRC). From the algorithm implementation level, the algorithm combines a high-performance graphics computing engine, a query engine and a distributed parallel computing system, which can meet the parallel projection length checking of different scale granularities, and can realize the calculation of parallel projection length according to the specified PRL_mode, that is, sum mode or split mode.

[0130] In order to solve the problem when the spacing S between the metal layer graphics is greater than or equal to PRL, the original sum mode calculation method needs to traverse the edges of the violation rectangle to find the vertical edge with an inner angle of 90° and an outer angle of 270° with the horizontal edge, and then expand the finite line segment edge formed by the horizontal edge adjacent to the vertical edge upward or downward into a polygon, which leads to the problem of high time complexity in calculating the PRL value. The improved method unifies the two calculation methods of the original sum mode into one, by directly filling the violation rectangle in the projected area between the two graphics, and then traversing the violation rectangle to calculate the PRL value. Compared with the original method of calculating the PRL value through complex edge queries and operations, the algorithm proposed in the present invention and the user-oriented OOVF syntax not only optimize the process of PRL value calculation, but also reduce the user's learning and usage costs.

[0131] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the protection scope of the present invention.

Claims

1. A method for calculating the parallel projection length between layout patterns, used to calculate the parallel projection length between a first pattern to be measured and a second pattern to be measured, characterized in that: include: Obtaining the outer contours of the first and second figures to be tested, and filling a rectangular cluster in the common area between the first and second figures to be tested, including: obtaining the positions of the vertical edges of the first and second figures to be tested in the common area; dividing the common area into a plurality of sub-areas according to the vertical edges, the number of the sub-areas being the number of vertical edges that are not at the same position of the horizontal edge plus one; filling each of the sub-areas, and using the figure after each of the sub-areas is filled as the rectangular cluster; Detecting the number of the rectangular clusters, and determining whether the number of the rectangular clusters is greater than 1; When the determination is yes, constructing a minimum bounding rectangle for all the rectangular clusters, including: obtaining a first vertex located at the outermost side in a horizontal direction and a second vertex located at the outermost side in a vertical direction in all the rectangular clusters; constructing the minimum bounding rectangle by using the first vertex and the second vertex as vertices of the minimum bounding rectangle; And obtaining the parallel projection length according to the minimum bounding rectangle, including: determining the arrangement direction of the first figure to be tested and the second figure to be tested; when the arrangement direction of the first figure to be tested and the second figure to be tested is horizontal, using the length of the minimum bounding rectangle as the parallel projection length; when the arrangement direction of the first figure to be tested and the second figure to be tested is vertical, using the width of the minimum bounding rectangle as the parallel projection length.

2. The method for calculating the parallel projection length between layout graphics according to claim 1, characterized in that: Acquiring the outer contours of the first pattern to be measured and the second pattern to be measured includes: Traversing the horizontal edges of the first figure to be tested and the second figure to be tested in sequence; Obtain all vertical edges connected to the horizontal edge and having interior angles of 90 degrees or 270 degrees; All the horizontal edges and the vertical edges are connected in a traversal order, and the connected broken lines are used as the outer contours of the first figure to be measured and the second figure to be measured.

3. The method for calculating the parallel projection length between layout graphics according to claim 1, characterized in that: When it is determined that the number of the rectangular clusters is not greater than 1, the parallel projection length calculation method includes: The obtained rectangle cluster is directly used as the minimum bounding rectangle, and the parallel projection length is obtained using the minimum bounding rectangle.

4. The method for calculating the parallel projection length between layout graphics according to claim 1, characterized in that: When the first to-be-measured pattern and the second to-be-measured pattern have no common area, the parallel projection length calculation method includes: Acquire a third vertex on the first figure to be tested that is closest to the second figure to be tested, and a fourth vertex on the second figure to be tested that is closest to the first figure to be tested; The minimum bounding rectangle is constructed by using the third vertex and the fourth vertex as vertices of the minimum bounding rectangle.

5. The method for calculating the parallel projection length between layout graphics according to claim 4, characterized in that: When the first to-be-tested figure and the second to-be-tested figure have no common area, obtaining the parallel projection length according to the minimum boundary rectangle includes: Determining the arrangement direction of the first pattern to be tested and the second pattern to be tested; When the arrangement direction of the first pattern to be tested and the second pattern to be tested is horizontal, the opposite value of the length of the minimum boundary rectangle is used as the parallel projection length; When the arrangement direction of the first pattern to be measured and the second pattern to be measured is a vertical direction, the opposite value of the width of the minimum boundary rectangle is used as the parallel projection length.

6. A computer storage medium storing computer executable instructions, characterized in that: When the executable instruction is executed by the processor, the processor executes the method for calculating the parallel projection length between layout graphics as described in any one of claims 1 to 5.