CN115796111B - Method, computer equipment and readable storage medium suitable for agf file processing - Google Patents
Method, computer equipment and readable storage medium suitable for agf file processing Download PDFInfo
- Publication number
- CN115796111B CN115796111B CN202211379995.8A CN202211379995A CN115796111B CN 115796111 B CN115796111 B CN 115796111B CN 202211379995 A CN202211379995 A CN 202211379995A CN 115796111 B CN115796111 B CN 115796111B
- Authority
- CN
- China
- Prior art keywords
- file
- information
- unit
- chip
- vertex
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application relates to a file processing method, a computer device and a readable storage medium, which are applicable to agf files, wherein the file processing method comprises the steps of obtaining a target file, wherein layout information of at least one chip unit is stored in the target file; the method comprises the steps of reading layout information of each chip unit from a target file, storing the layout information in a unit file corresponding to each chip unit, establishing index information corresponding to each unit file, wherein the index information is used for recording storage positions of the layout information in each unit file, and taking the index information as file names of the corresponding unit files. When the information is read, searching the storage position of the information to be searched in the unit file in the file name of the unit file according to the information name, and reading the information to be searched. The application stores the index information of the file content as the file name, can quickly inquire and acquire the information, and improves the operation efficiency of multi-process data processing.
Description
Technical Field
The application relates to the technical field of data processing, in particular to a file processing method, computer equipment and a readable storage medium applicable to agf.
Background
In the chip design process, it is necessary to perform design specification verification (DRC) and circuit Layout Verification (LVS) before extracting parasitic parameters. The most commonly used DRC and LVS tools at present are calibre, the output of which is CCI file, which contains the layout connection information of the chip after LVS extraction, and is a common input file of parasitic parameter extraction software. Of CCI files, agf is a binary file storing all graphic information in the layout in a hierarchical structure (hierarchy), agf is a basic unit of a chip unit (cell) containing an instance (instance) of a chip subunit inside the chip unit, and graphics under different masks (masks).
When reading the agf file in the CCI file, the existing parasitic parameter reading software mainly reads all information from the agf file in sequence according to the GDSII specification and keeps the information in a memory. When the chip scale is large, a multi-process method is generally adopted to process data, and finally, the processing results are integrated. However, since each process is independent of the other, the information obtained from the agf file needs to be distributed to each process, and not only does the distribution process waste a lot of time, but repeated data also occupies a lot of memory, resulting in inefficiency.
Disclosure of Invention
In view of the above technical problems, the present application provides a file processing method, an information reading method, a computer device and a storage medium, which store index information of file contents as file names, and can quickly query and acquire information, thereby improving the operation efficiency of multi-process data processing.
Technical solution one
A method for processing a file, which is applicable to agf files, comprising the following steps:
step1, a writing step, which is used for establishing a database, specifically comprises the following steps:
obtaining a target file, wherein the target file stores layout information of at least one chip unit;
Reading layout information of each chip unit from the target file, and storing the layout information in a unit file corresponding to each chip unit;
Establishing index information corresponding to each unit file, wherein the index information is used for recording the storage position of layout information in each unit file;
taking the index information as a file name of a corresponding unit file;
Step 2, an information reading step, namely reading the file processed in the step 1, and specifically comprises the following steps:
Acquiring an information name of information to be searched;
Searching the storage position of the information to be searched in the unit file in the file name of the unit file according to the information name;
And reading the information to be searched from the unit file according to the storage position.
The method is characterized in that the reading the layout information of each chip unit from the target file comprises the following steps:
obtaining a unit name of the at least one chip unit from a netlist file;
and respectively searching the layout information of each chip unit in the target file according to the unit name of the at least one chip unit.
The method is characterized in that the index information comprises an information name of layout information, the number of elements of the information and an offset address of the information.
The method is characterized in that the step of establishing index information corresponding to each of the unit files includes:
Determining initial index information, wherein the initial index information comprises information names of layout information of chip units, element numbers of the information and initial offset addresses of the information;
writing layout information with the number of elements not being 0 into the unit file, and recording an actual offset address;
and assigning the actual offset address to the initial offset address to generate index information of the unit file.
The method is characterized in that the method further comprises the following steps:
Before determining initial index information, counting the maximum file size of the unit file according to layout information, and creating a unit file;
And after the index information of the unit file is generated, resetting the file size of the unit file according to the value of the maximum offset address in the unit file.
The method is characterized in that the storing the layout information in the unit file corresponding to each chip unit comprises the following steps:
Obtaining graphic data of the same layer of graphics in the layout information, wherein the graphic data comprises vertex coordinates of each graphic;
Ordering the vertex coordinates, and determining the position attribute of each vertex of the same layer of graph;
and taking the vertex coordinates and the position attribute of the corresponding vertex as converted graphic data, and storing the graphic data in a unit file corresponding to each chip unit.
The method is characterized in that the step of sequencing the vertex coordinates and determining the position attribute of each vertex of the same layer of graph comprises the following steps:
Respectively sequencing the abscissa and the ordinate of the vertex coordinates of all the graphics;
determining sequence marks of each abscissa and each ordinate according to the sequencing result;
Mapping each vertex coordinate into a sequence array formed by a sequence mark of an abscissa and a sequence mark of an ordinate so as to obtain the position attribute of the corresponding vertex;
the step of using the vertex coordinates and the position attribute of the corresponding vertex as the converted graphic data and storing the converted graphic data in the unit file corresponding to each chip unit includes:
Combining the vertex name and the vertex position attribute in a 2D vector format;
and taking the combined data and the vertex coordinates as converted graphic data, and storing the converted graphic data in unit files corresponding to the chip units.
The computer device is characterized by comprising a memory and a processor, wherein the memory stores an operation program, and the processing program realizes the method when being executed by the processor.
A readable storage medium having stored thereon a computer program which when executed by a processor performs the method.
The file processing method comprises the steps of obtaining a target file, wherein layout information of at least one chip unit is stored in the target file, reading the layout information of each chip unit from the target file and storing the layout information in a unit file corresponding to each chip unit, establishing index information corresponding to each unit file, wherein the index information is used for recording storage positions of the layout information in each unit file, and taking the index information as file names of the corresponding unit files. When the information is read, searching the storage position of the information to be searched in the unit file in the file name of the unit file according to the information name, and reading the information to be searched. The application stores the index information of the file content as the file name, can quickly inquire and acquire the information, and improves the operation efficiency of multi-process data processing.
Drawings
FIG. 1 is a flow chart of a method for processing a file according to an embodiment of the application;
FIG. 2 is a graph showing the comparison of the effects of graphics data before (a) and after (b) conversion according to an embodiment of the present application.
Detailed Description
Further advantages and effects of the present application will become apparent to those skilled in the art from the disclosure of the present application, which is described by the following specific examples.
In the following description, reference is made to the accompanying drawings which describe several embodiments of the application. It is to be understood that other embodiments may be utilized and that mechanical, structural, electrical, and operational changes may be made without departing from the spirit and scope of the present application. The following detailed description is not to be taken in a limiting sense, and the scope of embodiments of the present application is defined only by the claims of the issued patent. The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application.
Although the terms first, second, etc. may be used herein to describe various elements in some examples, these elements should not be limited by these terms. These terms are only used to distinguish one element from another element.
Furthermore, as used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context indicates otherwise. It will be further understood that the terms "comprises," "comprising," "includes," and/or "including" specify the presence of stated features, steps, operations, elements, components, items, categories, and/or groups, but do not preclude the presence, presence or addition of one or more other features, steps, operations, elements, components, items, categories, and/or groups. The terms "or" and/or "as used herein are to be construed as inclusive, or meaning any one or any combination. Thus, "A, B or C" or "A, B and/or C" means "any of A, B, C, A and B, A and C, B and C, A, B and C". An exception to this definition will occur only when a combination of elements, functions, steps or operations are in some way inherently mutually exclusive.
Fig. 1 is a flow chart illustrating a file processing method according to an embodiment of the application. As shown in fig. 1, the file processing method according to the embodiment of the present application includes the following steps:
S1, acquiring a target file, wherein layout information of at least one chip unit is stored in the target file;
s2, reading layout information of each chip unit from the target file, and storing the layout information in a unit file corresponding to each chip unit;
S3, establishing index information corresponding to each unit file, wherein the index information is used for recording storage positions of layout information in each unit file;
s4, taking the index information as the file name of the corresponding unit file.
By the method, the data read in the target file can be saved in the memory, but only index information can be saved in the hard disk, so that the method is more suitable for operation of a distributed system. When the multi-process scheme is used, each process does not need to copy layout information with huge data quantity, but transmits lightweight index information, and when certain information is needed, the data can be quickly searched and acquired according to the guidance of the index information, so that the operation efficiency of multi-process data processing is effectively improved. In addition, the index information is used as the file name, so that the storage position of the searched information in the file can be quickly positioned, and the data query speed is improved.
The object file may be a agf file, which stores all graphic information in the layout in a structure of hierarchy, and the agf file uses a chip unit (cell) as a basic unit, and the chip unit includes an instance (instance) of a chip subunit and graphics under different masks (masks). It will be appreciated that the type of the object file is not limited to this, and may be any other type suitable for storing layout information of the chip unit.
Optionally, in step S2, reading layout information of each chip unit from the target file, including:
obtaining the unit name of at least one chip unit from the netlist file;
And respectively searching layout information of each chip unit in the target file according to the unit name of at least one chip unit.
The method comprises the steps of storing unit names of all chip units in a netlist file (. Nl) corresponding to a layout design, acquiring the unit name of at least one chip unit from the netlist file, searching the position of each chip unit in a target file, and further reading and obtaining layout information of each chip unit. Taking the object file as a file agf, the operation is read-only for the file agf, and all the chip units are arranged in parallel in the file agf, so that the reading work of all the chip units can be independent of each other, and the reading work of all the chip units can be completed in parallel. After the layout information of each chip unit is read from the target file, the layout information is stored in the unit file corresponding to each chip unit.
Optionally, the unit file of each chip unit may include a file name and file content, where the file name is named by index information, and the file content includes layout information such as an instance (instance) of a chip subunit and graphics under different masks (masks). Alternatively, the index information includes an information name of layout information, the number of elements of the information, an offset address of the information, wherein the elements may be an instance of a chip subunit, a pattern of a mask, and the like.
Optionally, step S3 includes:
determining initial index information, wherein the initial index information comprises the information name of layout information of a chip unit, the element number of the information and an initial offset address of the information;
writing layout information with the number of elements not being 0 into the unit file, and recording an actual offset address;
The actual offset address is assigned to the initial offset address to generate index information of the unit file.
Wherein, the initial offset address is assigned as-1, and is the default offset address of the information when the element number is 0. Writing layout information with the number of elements not being 0 into the tail of the file, and recording a corresponding actual offset address, wherein the actual offset address is optionally the actual offset address of the first element. Then, the actual offset address is assigned to the initial offset address, and at this time, the information name of the layout information of the chip unit, the number of elements of the information and the actual offset address of the information form index information of the unit file, and the index information of one unit file may be schematically as follows:
instance_list 3 36
mask_num 2 100
mask_offset 2 108,
Wherein, the first row represents an example of the chip unit including three chip subunits, the offset address of the first chip subunit is 36, and the specific layout information of the first chip subunit can be obtained by locating the 36 th position of the unit file. The second and third rows describe the graphics of the chip unit, and the index information can also be used for quickly acquiring all the graphics information of the specified mask.
Optionally, the method of the present embodiment may further include:
Before determining initial index information, counting the maximum size of the unit file according to layout information, and creating a unit file;
after the index information of the unit file is generated, the size of the unit file is reset according to the value of the maximum offset address in the unit file.
When information is read from a target file to be stored, the maximum size of the file can be counted according to the existing information, and a unit file is newly built and set. After setting the file name is completed, in order to avoid the file from being excessively large, the size of the file may be reset according to the value of the maximum offset address in the file.
The layout information read from the target file is typically also in the same form as it is stored in the target file, for example, the agf file, the graphics data exists in the following form:
It can be seen that in the original graphics data, a layer of graphics contains several polygons, where each polygon is formed by interconnected edges, each edge further being formed by two vertices. However, in EDA tools, a large number of operations are often performed on graphics, such as boolean operations on different mask graphics, or obtaining relationships between graphics within the same mask, such as overlapping, connected, adjacent relationships, etc., the above described manner will make the relative relationships between polygons not readily available, because all polygons are typically required to operate in pairs, thus resulting in unacceptable O (N2) complexity. When some fast algorithms are introduced, temporary data structure conversion is needed for the polygons, and when the operation times are huge, the conversion time is not negligible. In this regard, the application provides a mode for converting the graphic data, which can clearly describe the position relation of the graphic, thereby saving the space (compressing the repeated point and coordinate information) and being more beneficial to the subsequent rapid graphic operation algorithm introduction. The method can be used for storing the chip unit data or converting the graphic format, can be completed in linear time and can be completed in parallel, so that the operation speed of the EDA tool is increased as a whole.
Based on the above concept of converting graphics data, optionally, in step S2, storing layout information in a unit file corresponding to each chip unit, including the following steps:
obtaining graphic data of the same layer of graphics in the layout information, wherein the graphic data comprises vertex coordinates of each graphic;
ordering the vertex coordinates, and determining the position attribute of each vertex of the same layer of graph;
And taking the vertex coordinates and the position attribute of the corresponding vertex as the converted graphic data, and storing the converted graphic data in a unit file corresponding to each chip unit.
The relative position relation of the vertexes of the same layer of graph can be defined by determining the position attribute of the vertexes of the same layer of graph. Taking fig. 2 as an example, in (a), the two graphics have 8 vertex coordinates corresponding to each other, there is no clear relative positional attribute between each other before conversion, such as arrangement order, and in (b), the 8 vertex coordinates are converted into 8 points in a sequential relationship of P1 to P8, with a specific order. Taking the example of finding adjacent patterns, if the pattern format in the agf file is used directly, as shown in fig. 2 (a), it is very difficult to visually see the adjacent relationship of the patterns, and when checking and comparing all other patterns with respect to a certain pattern, O (N2) and above complexity is easily generated. After converting the graphic data, the adjacency relationship of the graphic can be represented in the relative positions of the points as shown in fig. 2 (b), and based on this structure, it becomes simple to extract the adjacency relationship by defining a scanning line and starting the scanning from the bottom up. Firstly, two points P2 and P3 are scanned, the positions and information of the points P2 and P3 are recorded on a scanning line, then, when the points P6 and P7 are scanned, the adjacency of the polygon where the point P7 and the point P2 are positioned can be judged based on the record on the scanning line, and the like, and all the mutual adjacency relations of the graphics can be obtained as long as data are scanned along a certain direction, so that the calculation between irrelevant graphics can be reduced as much as possible by utilizing a new format, and the efficiency of graphic operation is improved.
Optionally, the step of ordering the vertex coordinates to determine the position attribute of each vertex of the same layer of graph includes:
Respectively sequencing the abscissa and the ordinate of the vertex coordinates of all the graphics;
determining sequence marks of each abscissa and each ordinate according to the sequencing result;
and mapping each vertex coordinate into a sequence array formed by the sequence marks of the abscissa and the sequence marks of the ordinate so as to obtain the position attribute of the corresponding vertex.
Firstly, taking the example shown in fig. 2 (b), 8 independent points can be obtained by traversing the polygon once, and an abscissa sequence and an ordinate sequence of the vertex coordinates can be obtained by traversing the points, so that the following results are obtained:
x position list[3.2,3.53,1.24,1.82]
y position list[-0.12,-2.1,-0.95],
the abscissa and the ordinate are unordered at this time, and the abscissas and the ordinates of the vertex coordinates of all the figures are respectively ordered, with the following results:
x position list[1.24 1.82 3.2 3.53]
y position list[-2.1 -0.95 -0.12],
At this time, from the sorting result, it may be determined that the sequence mark of each abscissa and each ordinate, for example, the sequence mark corresponding to the abscissa 1.82 is 1, that is, it is the 2 nd element in the x-position list (similarly, the sequence mark of the first element 1.24 is 0). The purpose of using sequence markers is to facilitate subsequent graphic operations while also enabling quick access to the original coordinate values. According to the sorting result, the corresponding relation between the coordinates and the sequence marks is as follows:
Position-index map
Next, mapping each vertex coordinate into a sequence array formed by a sequence mark of an abscissa and a sequence mark of an ordinate, and completing the conversion of the sequence marks of all points, wherein the process is to traverse all points once, take the values of the sequence marks through the coordinate table lookup of the points, and the method for representing 8 points of two rectangles after conversion is as follows:
Point position-index mapping
P1:(3.2,-0.12)->(2,2)
P2:(3.2,-2.1)->(2,0)
P3:(3.53,-2.1)->(3,0)
P4:(3.53,-0.12)->(3,2)
P5:(1.24,-0.12)->(0,2)
P6:(1.24,-0.95)->(0,1)
P7:(1.82,-0.95)->(1,1)
P8:(1.82,-0.12)->(1,2),
Thus, taking P2 (2, 0) as an example, when the output result requires a real coordinate, the real coordinate of P2 can be obtained by querying the sequence of the abscissa or the ordinate with the sequence mark as follows:
x_position_list[2]=3.2;y_position_list[0]=-2.1
P2(2,0)->P2(3.2,-2.1)。
After determining the position attribute of each vertex of the same layer of graphics, optionally, using the vertex coordinates and the position attribute of the corresponding vertex as the converted graphics data, and storing the converted graphics data in a unit file corresponding to each chip unit, where the step includes:
Combining the vertex name and the vertex position attribute in a 2D vector format;
And taking the combined data and the vertex coordinates as converted graphic data, and storing the converted graphic data in a unit file corresponding to each chip unit.
The method comprises the steps of sorting a series of points according to sequence marks into unit files, specifically, sorting all the points according to an ordinate, and sorting the points located on the same ordinate according to an abscissa. Taking the format of 2D vector as an example, the final output result is as follows:
Point 2D vector
y=0:{(2,P2),(3,P3)};
y=1:{(0,P6),(1,P7)};
y=2:{(0,P5),(1,P8),(2,P1),(3,P4)},
Finally, combining the information to obtain the graph data of a layer of graph in the converted chip unit:
x position list[1.24 1.82 3.2 3.53]
y position list[-2.1 -0.95 -0.12]
Point 2D vector
y=0:{(2,P2),(3,P3)};
y=1:{(0,P6),(1,P7)};
y=2:{(0,P5),(1,P8),(2,P1).(3,P4)}。
in actual implementation, in the layout design process, there is a unified requirement on decimal places (dbu) and precision places (k) of the graph, so that coordinate values can be converted into integers through decimal places and precision places provided in a design file, and then sorting can be performed.
The file processing method comprises the steps of obtaining a target file, wherein the target file stores layout information of at least one chip unit, reading the layout information of each chip unit from the target file and storing the layout information in a unit file corresponding to each chip unit, establishing index information corresponding to each unit file, wherein the index information is used for recording the storage position of the layout information in each unit file, and taking the index information as the file name of the corresponding unit file. When the information is read, searching the storage position of the information to be searched in the unit file in the file name of the unit file according to the information name, and reading the information to be searched. The application stores the index information of the file content as the file name, can quickly inquire and acquire the information, and improves the operation efficiency of multi-process data processing.
After the file is obtained by processing by the file processing method in the above embodiment, information in the file can be read based on the file name of the unit file.
As shown in fig. 1, the process of reading information includes the steps of:
s5, obtaining the information name of the information to be searched;
s6, searching a storage position of the information to be searched in the unit file in the file name of the unit file according to the information name;
S7, reading the information to be searched from the unit file according to the storage position.
The file name of the unit file, namely index information of the content stored in the unit file, can be quickly searched and acquired according to the guidance of the index information when certain information is needed, and the data searching speed is improved. In addition, when the multi-process scheme is used, each process does not need to copy layout information with huge data quantity, but transmits lightweight index information, so that the operation efficiency of multi-process data processing is effectively improved. The detailed manner of setting the index information is described above, and is not described herein.
The application also provides computer equipment, which comprises a memory and a processor, wherein the memory stores an operation program, and the processing program realizes the method according to the embodiment when being executed by the processor.
The application also provides a readable storage medium having stored thereon a computer program which, when executed by a processor, implements a method as described in the above embodiments.
The above embodiments are merely illustrative of the principles of the present application and its effectiveness, and are not intended to limit the application. Modifications and variations may be made to the above-described embodiments by those skilled in the art without departing from the spirit and scope of the application. Accordingly, it is intended that all equivalent modifications and variations of the application be covered by the claims, which are within the ordinary skill of the art, be within the spirit and scope of the present disclosure.
Claims (8)
1. A method for agf file processing, comprising the steps of:
step 1, a writing step, which is used for establishing a database, specifically comprises the following steps:
obtaining a target file, wherein the target file stores layout information of at least one chip unit;
Reading layout information of each chip unit from the target file, and storing the layout information in a unit file corresponding to each chip unit;
Establishing index information corresponding to each unit file, wherein the index information is used for recording the storage position of layout information in each unit file;
taking the index information as a file name of a corresponding unit file;
Step 2, an information reading step, namely reading the file processed in the step 1, and specifically comprises the following steps:
Acquiring an information name of information to be searched;
Searching the storage position of the information to be searched in the unit file in the file name of the unit file according to the information name;
Reading the information to be searched from the unit file according to the storage position;
Storing the layout information in a unit file corresponding to each chip unit, wherein the method comprises the following steps:
Obtaining graphic data of the same layer of graphics in the layout information, wherein the graphic data comprises vertex coordinates of each graphic;
Ordering the vertex coordinates, and determining the position attribute of each vertex of the same layer of graph;
and taking the vertex coordinates and the position attribute of the corresponding vertex as converted graphic data, and storing the graphic data in a unit file corresponding to each chip unit.
2. The method of claim 1, wherein the reading layout information of each of the chip units from the target file comprises:
obtaining a unit name of the at least one chip unit from a netlist file;
and respectively searching the layout information of each chip unit in the target file according to the unit name of the at least one chip unit.
3. The method of claim 1, wherein the index information includes an information name of the layout information, the number of elements of the information, an offset address of the information.
4. A method according to claim 3, wherein said step of creating index information corresponding to each of said unit files comprises:
Determining initial index information, wherein the initial index information comprises information names of layout information of chip units, element numbers of the information and initial offset addresses of the information;
writing layout information with the number of elements not being 0 into the unit file, and recording an actual offset address;
and assigning the actual offset address to the initial offset address to generate index information of the unit file.
5. The method according to claim 4, further comprising:
Before determining initial index information, counting the maximum file size of the unit file according to layout information, and creating a unit file;
And after the index information of the unit file is generated, resetting the file size of the unit file according to the value of the maximum offset address in the unit file.
6. The method of claim 1, wherein the step of ordering the vertex coordinates to determine the location attribute of each vertex of the same layer of graphics comprises:
Respectively sequencing the abscissa and the ordinate of the vertex coordinates of all the graphics;
determining sequence marks of each abscissa and each ordinate according to the sequencing result;
Mapping each vertex coordinate into a sequence array formed by a sequence mark of an abscissa and a sequence mark of an ordinate so as to obtain the position attribute of the corresponding vertex;
the step of using the vertex coordinates and the position attribute of the corresponding vertex as the converted graphic data and storing the converted graphic data in the unit file corresponding to each chip unit includes:
Combining the vertex name and the vertex position attribute in a 2D vector format;
and taking the combined data and the vertex coordinates as converted graphic data, and storing the converted graphic data in unit files corresponding to the chip units.
7. A computer device comprising a memory, a processor, wherein the memory has stored thereon an operating program which when executed by the processor implements the method of any of claims 1-6.
8. A readable storage medium, characterized in that it has stored thereon a computer program which, when executed by a processor, implements the method according to any of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211379995.8A CN115796111B (en) | 2022-11-04 | 2022-11-04 | Method, computer equipment and readable storage medium suitable for agf file processing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211379995.8A CN115796111B (en) | 2022-11-04 | 2022-11-04 | Method, computer equipment and readable storage medium suitable for agf file processing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115796111A CN115796111A (en) | 2023-03-14 |
| CN115796111B true CN115796111B (en) | 2025-03-14 |
Family
ID=85435723
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211379995.8A Active CN115796111B (en) | 2022-11-04 | 2022-11-04 | Method, computer equipment and readable storage medium suitable for agf file processing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115796111B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117576249B (en) * | 2024-01-19 | 2024-04-02 | 弈芯科技(杭州)有限公司 | Chip layout data processing method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101211376A (en) * | 2006-12-26 | 2008-07-02 | 北京中电华大电子设计有限责任公司 | Domain data format dedicated for parasitic parameter extracting tool |
| CN115270687A (en) * | 2022-07-21 | 2022-11-01 | 北京市商汤科技开发有限公司 | Chip layout method, device, equipment and storage medium |
-
2022
- 2022-11-04 CN CN202211379995.8A patent/CN115796111B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101211376A (en) * | 2006-12-26 | 2008-07-02 | 北京中电华大电子设计有限责任公司 | Domain data format dedicated for parasitic parameter extracting tool |
| CN115270687A (en) * | 2022-07-21 | 2022-11-01 | 北京市商汤科技开发有限公司 | Chip layout method, device, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115796111A (en) | 2023-03-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP1989685B1 (en) | A method for comparing a first computer-aided 3d model with a second computer-aided 3d model | |
| JP2000114379A (en) | Integrated circuit design method and integrated circuit design device | |
| CN118135261B (en) | Graph matching method and system for ultra-large scale layout | |
| CN115796111B (en) | Method, computer equipment and readable storage medium suitable for agf file processing | |
| CN114861590A (en) | An indexing method applied to large-scale layout data | |
| US20130195368A1 (en) | Scalable pattern matching between a pattern clip and a pattern library | |
| US7849038B2 (en) | Method for using the second homotopy group in assessing the similarity of sets of data | |
| CN109634960A (en) | Key assignments date storage method, device, equipment and storage medium | |
| CN108427572B (en) | Land survey database updating method and updating increment package generating method thereof | |
| JP3649430B2 (en) | Graphic data management method and system, and storage medium | |
| US8136058B2 (en) | Method and system for representing geometrical layout design data in electronic design systems | |
| CN114834043B (en) | Laser three-dimensional processing model slice data processing method | |
| US6850638B1 (en) | System for naming faces and vertices in an adaptive hierarchical subdivision surface | |
| CN115481592A (en) | Data processing method, data structure generation method and query method | |
| US6481002B2 (en) | System and method for compressing LSI mask writing data | |
| US7818708B2 (en) | Method and system for developing post-layout electronic data automation (EDA) applications | |
| US7653498B2 (en) | Apparatus for and method of calculating many-body problem | |
| CN119068014B (en) | Interconnection line graph processing method, computing device and computer readable storage medium | |
| CN119067962B (en) | Information processing method, parasitic parameter extraction method, device and medium | |
| JP4346090B2 (en) | Graphic data management method and system, and storage medium | |
| JP2786294B2 (en) | Graphic data inspection and storage method | |
| CN119647388A (en) | Method, device, equipment and storage medium for determining chip ID layout | |
| CN116051892A (en) | Mask processing method, electronic equipment and storage medium | |
| CN119808694A (en) | A method and system for extracting the bottom layer of a block | |
| CN117215487A (en) | Method for storing chip design file data, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |