Novel construction method for integrated circuit layout data index

Abstract

The invention discloses a novel construction method of an integrated circuit layout data index. The method comprises four-stage indexing, dynamic uniform partitioning and spatial data object represented by using a minimum bounding box. Wherein the four-level indexes comprise a first-level index with a keyword being a lower left corner coordinate X, a second-level index with a keyword being a lower left corner coordinate Y, a third-level index with a keyword being an upper right corner coordinate X and a fourth-level index with a keyword being an upper right corner coordinate Y. The indexing method is low in construction cost, low in space occupation and stable and rapid in query, and can be widely applied to the field of integrated circuit electronic design automation as an indexing method of the integrated circuit layout data.

Description

technical field [0001] The invention relates to the field of database indexing in computer-aided design, and is aimed at an integrated circuit EDA tool, in particular to a new construction method of integrated circuit layout data index, in particular. Background technique [0002] The layout of an integrated circuit mainly records the spatial data such as points, rectangles, and polygons of the layout. With the development of integrated circuit technology and the increase in the complexity of design, the feature size of the device is further reduced, and the layout scale of the integrated circuit becomes larger and larger. Whether it is an integrated circuit layout automation generation EDA (Electronic Design Automation) tool or a verification EDA tool, it is inevitable to face huge layout data processing problems. For example, the layout and routing process in the layout automation generation EDA tool requires high-speed extraction and routing layout process. Another examp...

AI Technical Summary

Problems solved by technology

Quadtrees represent the division of two-dimensional space by decomposing the area into four equal quadrants, sub-quadrants, etc., until the contents of the cells meet certain data occupancy criteria. The cell size of the grid varies with data density, while The setting of the cell size also directly affects the space utilization, too small a cell will lead to a huge space occupation

[0008] 1. Quadtree or R Tree space utilization is low

[0009] 2. There is a page overlap problem in R Tree

[0010] 3. The construction cost of R Tree or R*Tree is relatively high

Images