US8386967B2 - Semiconductor layout scanning method and system - Google Patents
Semiconductor layout scanning method and system Download PDFInfo
- Publication number
- US8386967B2 US8386967B2 US12/593,392 US59339208A US8386967B2 US 8386967 B2 US8386967 B2 US 8386967B2 US 59339208 A US59339208 A US 59339208A US 8386967 B2 US8386967 B2 US 8386967B2
- Authority
- US
- United States
- Prior art keywords
- edge
- proximity
- layout
- corner
- edges
- 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, expires
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/30—Circuit design
- G06F30/39—Circuit design at the physical level
- G06F30/398—Design verification or optimisation, e.g. using design rule check [DRC], layout versus schematics [LVS] or finite element methods [FEM]
Definitions
- the invention relates to a method for scanning a semiconductor layout, the layout comprising objects with edges and corners.
- the invention further relates to a computer program product and a system for scanning a semiconductor layout and to a method for producing an integrated circuit.
- Scanning of semiconductor layouts is used in layout processing or modification systems that migrate a layout to another technology, systems that make the layout smaller or systems that try to fix violations of constraints in these layouts.
- a layout migration system tries to calculate a new layout, based on an input layout, such that the new layout fulfills the design rules or constraints of the new production process for the semiconductor device.
- Layout compaction systems try to optimize a design or layout for area. The footprint of the layout has to become smaller and a compaction engine can do this such that the original design intent is still in the new layout and such that no design rule violations appear.
- a two dimensional compaction system is known from U.S. Pat. No. 6,587,992.
- position variables of edges and corner points of layout elements are determined and a system of constraints is constructed.
- the constraints describe minimum distances between edges and corners of two layout elements in the terms of position variables.
- Some constraints are one dimensional (e.g. x 2 ⁇ x 1 >d)
- other constraints are two-dimensional (e.g. (x 2 ⁇ x 1 ) 2 +(y 2 ⁇ x 1 ) 2 >d 2 ).
- An objective function is established that must be optimized for the two dimensional compaction.
- the system of constraints is solved to compact and optimize the layout in two dimensions simultaneously.
- non-linear constraints Due to the non-linear two-dimensional constraints, the system of constraints is very difficult to solve in a reasonable runtime. Therefore the non-linear constraints are represented by linear constraints (e.g. (x 2 ⁇ x 1 )+(y 2 ⁇ y 1 )>d ⁇ square root over (2) ⁇ ).
- the scanning mechanism scans the objects of the layout.
- the objects may be polygons or paths.
- the scanning mechanism identifies, in a two dimensional environment, proximity relations between neighboring object edges and between neighboring corners. Where a proximity relation is found, the corresponding edges or corners are neighbors.
- the proximity relations are found by searching for edges that have a locally closest point pair in common. Locally closest point pairs show where the interaction between two objects or edges is the most significant. The interaction is the most significant in the places where edges are close together and no other objects are in between.
- the stored proximities, together with the corresponding edges and corners are determined by the layout configuration or topology of the semiconductor design layout.
- the database provides excellent opportunities for layout analysis.
- the stored proximity information also enables fast search and look up of locations in the layout where a modification is possible or required. Because proximity relations are only identified between direct neighbors, the number of relations is kept relatively small and linear with the number of objects.
- the proximity based layout compaction or design modification that may be performed after the scanning takes far less computational power than the known methods of the prior art.
- the method for scanning a semiconductor layout according to the invention is suitable for use in a method for designing and/or producing integrated circuits.
- the method further comprises identifying a proximity relation between two corners of non-parallel edges where the two corners share a locally closest point pair and storing the proximity relation in the proximity relations table together with a reference to the corresponding pair of corners.
- proximity relations between two objects diagonally opposing each other are also stored. Depending on the operations to be performed with the proximity information, these additional proximity relations may, or may not be useful. No proximity relations have to be stored between corners of parallel edges, because parallel edges already have a proximity relation according to the basic embodiment described above.
- the method further comprises identifying a proximity relation between an edge and a corner of an edge not parallel to the first mentioned edge where the edge and the corner share a locally closest point pair and storing the proximity relation in the proximity relations table together with a reference to the corresponding corner and edge.
- edges under an angle of 45° are often used in semiconductor layouts. Such edges may share a locally closest point pair with a corner of another edge.
- the convex bounding area is a rectangle containing the complete edges of the pair, the method further comprising storing the relation in the database as an extended proximity relation together with a reference to the corresponding pair of edges.
- Extended proximity relations may also be identified between two corners when the convex bounding area is a rectangle containing the complete edges of the pair and the rectangle does not contain any other corner or edge.
- an even stricter criterion may be employed for identifying extended proximity relations between two corners. The stricter criterion may require that the convex bounding area is a rectangle containing for each one of the two corners at least one complete edge connected to the respective corner, and said rectangle does not contain any other corner or edge.
- Extended proximity relations are identified using large bounding boxes comprising full edges instead of only parts of edges or corners only.
- the larger bounding boxes of the extended proximity relations also include a smaller bounding box.
- An extended proximity relation is a subspecies of a proximity relation. When considering extended proximity relations instead of ‘normal’ proximity relations, the number of constraints s further decreased. It depends on the application the proximity relations are used for, whether the further reduction of the number of constraints is an advantage (easier computations) or a disadvantage (less information about the layout).
- the method further comprises a step of generating a trigger based on the stored proximity relation and the corresponding pair edges, the trigger defining a limit for the relative positions of the corresponding edges beyond which limit a topology of the semiconductor design layout is altered.
- the proximity relations provide sufficient information about the semiconductor design layout. If the proximity information is only used for layout analysis no additional information is needed.
- the topology of the layout changes when the application executes some layout changing actions.
- a trigger defines a limit for a layout change beyond which limit the corresponding proximity becomes invalid and the topology is changed.
- the trigger is derived on basis of the stored proximities and the relative positions of the corresponding edges and corners. The trigger may be used for preventing topology changes and for defining the limits within which the topology remains valid.
- the proximity relations may also define, e.g., spaces, widths, overlaps or extend situations.
- a computer program product for scanning a semiconductor design layout, which program is operative to cause a processor to perform the method according to the invention.
- a system is provided suitable for scanning a semiconductor design layout by carrying out the method according to the invention.
- FIG. 1 shows a proximity relation between parallel edges of two polygons
- FIG. 2 shows a proximity relation between a polygon edge and a parallel path
- FIG. 3 a shows a proximity relation between corners of two polygons
- FIG. 3 b shows a proximity relation between a corner of a polygon and an edge of another polygon
- FIG. 4 shows proximity relations within a complex polygon
- FIG. 5 shows an empty extended bounding box between parallel edges of two polygons
- FIG. 6 shows an occupied extended bounding box between parallel edges of two polygons
- FIG. 7 shows proximity relations relating to overlapping polygons
- FIG. 8 a - 8 b schematically shows a method of scanning a layout
- FIG. 9 a - 9 e illustrates how proximity relations are derived from scanning results
- FIG. 10 shows some triggers that are related to proximity relations
- FIGS. 11 and 12 show some triggers that are related to proximity relations
- FIG. 13 shows a flow diagram of a method according to the invention.
- FIG. 14 shows a block diagram of a system 140 according to the invention.
- FIG. 1 shows a proximity relation 14 between parallel edges of two polygons 11 , 12 .
- the polygons 11 , 12 represent an area on the semiconductor layout with a particular material, structure or functional element.
- the two polygons 11 , 12 have parallel edges, facing each other.
- a convex bounding area 13 is drawn, comprising the parallel parts of the edges.
- a proximity relation 14 between the two polygons is identified, because the convex bounding area 13 is empty, i.e. does not contain any other corner or edge.
- This proximity relation 14 represents the space between the two neighboring polygons 11 , 12 .
- the convex bounding area 13 is a rectangle comprising at least parts of the edges or corners involved in the proximity relation 14 . It is however to be noted that, depending of the application, other shapes may be equally or more appropriate for the convex bounding area.
- the convex bounding area may, for example, be triangular, circular, oval or elliptical.
- Proximity relations 15 do also exist within the polygons 11 , 12 .
- Such proximity relations 15 are identified between two parallel edges of the same polygon 11 , 12 and represent a width of the polygon 11 , 12 .
- the bounding box rectangles of such proximity relations 15 coincide with the polygons 11 , 12 .
- FIG. 2 shows a proximity relation 24 between an edge of a polygon 21 and a path 22 parallel to the polygon 21 .
- FIG. 3 a shows a proximity relation 34 between corners 35 , 36 of two polygons 31 , 32 .
- a bounding box rectangle 33 is shown, comprising both corners 35 , 36 . Because the bounding box rectangle 33 does not comprise any other corner or edge, a proximity relation 34 is identified between the corners 35 , 36 .
- a rectangular bounding box 33 is shown, but other types of convex bounding areas, such as circles, ellipses, triangles, pentagons or other polygons, may alternatively be used.
- FIG. 3 b shows a proximity relation 34 b between a corner 35 b of a first polygon 31 b and an edge 36 b of a second polygon 32 b .
- the edge 36 b of the second polygon 32 b makes an angle of approximately 45° with the other edges of the polygon 32 b .
- a bounding box rectangle 33 b is shown, comprising both corners 35 b , 36 b . Because the bounding box rectangle 33 b does not comprise any other corner or edge, a proximity relation 34 b is identified between the corners 35 b , 36 b.
- FIG. 4 shows proximity relations 43 , 45 within a complex polygon 41 .
- the proximity relations 43 between edges of the polygon 41 are indicated by dotted arrows.
- the proximity relations 45 between corners of the polygon 41 are indicated by solid arrows.
- the amount of stored proximity relations may be limited using selection algorithms or additional criteria for identifying the required proximity relations.
- FIG. 5 shows an empty extended bounding box rectangle 56 between parallel edges of two polygons 51 , 52 .
- the extended bounding box rectangle 56 is obtained by extending the bounding box rectangle 53 along the parallel edges comprised in the bounding box rectangle 53 .
- the extended bounding box rectangle 56 comprises complete edges of the polygons 51 , 52 . Because the extended bounding box rectangle 56 does not contain any other corner or edge, the proximity relation 57 is additionally considered to be an extended proximity relation. For some applications it may be preferable to only consider extended proximity relations, instead of all proximity relations.
- FIG. 6 shows the same polygons 51 , 52 as shown in FIG. 5 , together with a path 68 .
- the polygons may, for example, represent semiconductor structures and the path may represent a wire for interconnecting two or more semiconductor structures.
- the path 68 runs through the extended bounding box 56 . Consequently, the proximity relation 67 between the edges of the two polygons 51 , 52 is not considered an extended proximity relation.
- FIG. 7 shows proximity relations 74 , 76 , 78 relating to overlapping polygons 71 , 72 .
- Semiconductor layouts generally comprise several interacting layers with structures of semiconductor material.
- the rectangular polygon 72 is situated one layer above the U-shaped polygon 71 .
- the polygons 71 , 72 partially overlap.
- Two proximity relations 74 correspond to the free space between the long edges of the rectangular polygon 72 and the parallel edges at the inside of the U-shaped polygon 71 .
- Another proximity relation 76 corresponds to the overlap of the two polygons.
- the rectangular polygon 72 extends over two edges of the U-shaped polygon 71 which results in two proximity relations 78 .
- FIG. 8 schematically shows a method of scanning a layout for identifying proximity relations.
- the layout is shown.
- the layout comprises two polygons 81 , 82 .
- the position of the polygons 81 , 82 is known.
- the proximity relations are identified using the following scanning process. Scanning of the layout is performed by moving a scanline 83 from a first side of the layout to a second side of the layout and stopping the scanline 83 when the scanline 83 arrives at a corner of one of the polygons 81 , 82 .
- the scanline 83 is moved from the bottom of the layout to the top.
- the third stop of the scanline 83 causes two bottom shadow events (BS) for polygon 81 and two top events (T) for polygon 82 .
- the top events mark the end of the polygon 82 .
- the top corners of polygon 81 cause two top events (T) and two shadow top events (TS) are detected at the horizontal positions of the corners of polygon 82 .
- B bottom event
- FIG. 9 d shows a situation wherein a proximity relation 94 between two corners is identified.
- the scanline 83 comprises a TS with a B at its right side.
- a proximity relation 94 is defined between the bottom corner and the top corner, relating to the B and the TS respectively.
- FIG. 9 e shows a further possible situation.
- a top event is situated between two parallel edges.
- On the scanline 83 a combination of a BS, a T and a BS is found.
- both edges are direct neighbors of the path. Proximity relations between the edges and the path have already been identified when the scanline 83 was situated lower in the layout.
- the two parallel edges are direct neighbors of each other. Therefore, a proximity relation 95 is identified between the two parallel edges.
- the scanning process is repeated with the scanline moving from left to right.
- the scanning may alternatively be performed from top to bottom and/or from right to left.
- FIG. 10 shows some triggers that are related to a proximity relation 101 .
- three triggers 102 , 103 , 104 are defined for a proximity relation 101 between two parallel edges.
- Triggers are preferably only generated in layout changing applications, like compaction. In applications that only involve layout analysis, no triggers are needed.
- the triggers are generated by a trigger finding algorithm that goes through the list of stored proximities. Based on the relative positions of the coordinates of the corners of the edges related to the proximity relation 101 , three triggers 102 , 103 , 104 are defined.
- the triggers define the layout changes that are possible without affecting the topology of the layout.
- a first trigger 102 tells that, as soon as the upper edge of the right polygon has a lower position than the upper edge of the left polygon, the topology of the layout changes, which may result in new as well as disappearing proximity relations.
- other triggers 103 and 104 are relevant for other relations between edges.
- trigger 103 is triggered, proximity relation 101 disappears and a new proximity relation between two corners is created.
- Triggers 102 , 103 , 104 thus define the limits of changes that may be applied to the layout, without needing to repeat the scanning of the layout for defining its proximity relations.
- FIG. 11 also shows some triggers that are related to a proximity relation 111 . In this event, only two triggers 112 , 113 are needed to define the limits between which layout changes do not cause topology changes. In FIG. 12 , two triggers 115 , 116 are shown for a proximity relation 114 between two corners.
- FIG. 13 shows a flow diagram of a method 130 according to the invention.
- the method 130 uses a scanline for scanning the layout.
- the scanline is moved from a first side of the layout to a second side, e.g., from bottom to top.
- the moving is performed stepwise.
- some analysis is performed for identifying the proximity relations. The following steps are shown in FIG. 13 :
- the scanline moves from bottom to top.
- the scanline is stopped 132 .
- information is stored 133 about objects on the scanline.
- the information to store depends on the information already stored on the scanline. If at a particular horizontal coordinate of the scanline, a bottom event (B) or a bottom shadow event (BS) was already stored and no corner is detected at that particular horizontal coordinate, then a bottom shadow event (BS) is stored at the scanline. If a bottom event (B) or a bottom shadow event (BS) was already stored and the scanline does comprise a corner, then a top event (T) is stored. Similarly top events (T) and top shadow events (TS) are followed by top shadow events (TS) or bottom events (B).
- an analysis step 133 the information on the scanline is analyzed for detecting proximity relations.
- the proximity relation is stored in a database together with the corresponding corner or edge in storage step 134 .
- Additional information may be stored together with the proximity relation.
- additional information may, e.g., include, the type of proximity relation or information about the corners or edges, such as the position in the layout or the materials of the objects of the edges or corners.
- the method After that, if it is determined 137 that another scanline is to be analyzed, the method returns to moving step 131 for analyzing the next scanline. These steps are performed repeatedly until the scanline reaches the second side and all proximity relations are stored in the database. Afterwards, the method is preferably repeated in another direction (horizontal) for obtaining a complete overview of all proximity relations in the layout. If the complete layout is scanned, the scanning method ends 135 . After scanning the layout, triggers may be defined for the identified proximity relations in trigger definition step 136 .
- FIG. 14 shows a block diagram of a system 140 according to the invention.
- the system 140 comprises an input 141 for receiving the layout 144 .
- the input 141 may be a keyboard, a network adapter for receiving the layout 144 from another computer, possibly via the Internet, a CD or DVD-drive or any other means capable of providing data to a computer system.
- the layout 144 may already be stored on the storage unit 142 of the system 140 .
- the system also comprises a storage unit 142 , e.g., a hard disk.
- the storage unit 142 may be remotely connected via a network.
- the storage unit 142 is used for storing the layout or a copy of the layout and the proximity database with the proximity relation table 149 .
- the system 140 comprises a processor 143 being arranged for performing the method according to the invention.
- the processor 143 provides for storing received information on the storage unit, analyzing the information and storing the results of the analysis on the storage unit 142 .
- the system 140 also comprises output means 145 for showing the results of the analysis to a user or printing results on paper.
Abstract
Description
-
- identifying locally closest point pairs comprising a first point on a first edge and a second point on a second edge, where the first edge and the second edge are not in contact with each other, a distance between the first point and the second point is the shortest distance between the first edge and the second edge, and a convex bounding area with the first point and the second point on its boundary contains no edge,
- identifying a proximity relation between two parallel edges where the parallel edges have at least one locally closest point pair in common, and
- storing the proximity relation in a proximity relations table of a database together with a reference to the corresponding pair of edges.
Claims (17)
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP07104863 | 2007-03-26 | ||
EP07104863.1 | 2007-03-26 | ||
EP07104863 | 2007-03-26 | ||
PCT/EP2008/053302 WO2008116807A1 (en) | 2007-03-26 | 2008-03-19 | Semiconductor layout scanning method and system |
Publications (2)
Publication Number | Publication Date |
---|---|
US20100185996A1 US20100185996A1 (en) | 2010-07-22 |
US8386967B2 true US8386967B2 (en) | 2013-02-26 |
Family
ID=39598407
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US12/593,392 Active 2028-12-02 US8386967B2 (en) | 2007-03-26 | 2008-03-19 | Semiconductor layout scanning method and system |
Country Status (4)
Country | Link |
---|---|
US (1) | US8386967B2 (en) |
JP (1) | JP2010522975A (en) |
CN (1) | CN101675437B (en) |
WO (1) | WO2008116807A1 (en) |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9448706B2 (en) * | 2009-07-29 | 2016-09-20 | Synopsys, Inc. | Loop removal in electronic design automation |
CN102622456B (en) * | 2011-01-28 | 2014-02-05 | 北京华大九天软件有限公司 | Graphic topological command concurrent computation method for integrated circuit layout verification |
US8756048B2 (en) | 2011-04-15 | 2014-06-17 | Stmicroelectronics S.R.L. | Method for technology porting of CAD designs, and computer program product therefor |
US9213798B2 (en) | 2011-05-19 | 2015-12-15 | Sage Design Automation Ltd | Method, system and computer program product of checking an integrated circuit layout for instances of a reference pattern |
CN112668667A (en) * | 2021-01-22 | 2021-04-16 | 上海华虹宏力半导体制造有限公司 | Method for scanning layout file |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6269472B1 (en) * | 1996-02-27 | 2001-07-31 | Lsi Logic Corporation | Optical proximity correction method and apparatus |
US20030009728A1 (en) | 2001-06-29 | 2003-01-09 | Marple David P. | Two dimensional compaction system and method |
US7275227B1 (en) * | 2003-08-27 | 2007-09-25 | Anchor Semiconductor Inc. | Method of checking optical proximity correction data |
US7389001B2 (en) * | 2003-12-18 | 2008-06-17 | Intel Corporation | Reorganizing rectangular layout structures for improved extraction |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3000A (en) * | 1843-03-10 | Improvement in sugar-boilers | ||
JPH06140507A (en) * | 1992-10-23 | 1994-05-20 | Fujitsu Ltd | Method for evaluating size of chip |
JPH11259556A (en) * | 1998-03-13 | 1999-09-24 | Toshiba Corp | Layout design supporting method for electronic component, device therefor and medium recording layout design supporting program |
JP4769025B2 (en) * | 2005-06-15 | 2011-09-07 | 株式会社日立ハイテクノロジーズ | Imaging recipe creation apparatus and method for scanning electron microscope, and semiconductor pattern shape evaluation apparatus |
-
2008
- 2008-03-19 CN CN2008800078390A patent/CN101675437B/en active Active
- 2008-03-19 WO PCT/EP2008/053302 patent/WO2008116807A1/en active Application Filing
- 2008-03-19 JP JP2010500224A patent/JP2010522975A/en active Pending
- 2008-03-19 US US12/593,392 patent/US8386967B2/en active Active
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6269472B1 (en) * | 1996-02-27 | 2001-07-31 | Lsi Logic Corporation | Optical proximity correction method and apparatus |
US20030009728A1 (en) | 2001-06-29 | 2003-01-09 | Marple David P. | Two dimensional compaction system and method |
US6587992B2 (en) | 2001-06-29 | 2003-07-01 | Qda, Inc. | Two dimensional compaction system and method |
US7275227B1 (en) * | 2003-08-27 | 2007-09-25 | Anchor Semiconductor Inc. | Method of checking optical proximity correction data |
US7389001B2 (en) * | 2003-12-18 | 2008-06-17 | Intel Corporation | Reorganizing rectangular layout structures for improved extraction |
Non-Patent Citations (7)
Title |
---|
Bois et al, "Efficient Generation of Diagonal Constraints for 2-D Mask Compaction," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 15, No. 9, 1996, pp. 1119-1126. |
Fang F et al., "Calligrapher: A New Layout-Migration Engine for Hard Intellectual Property Libraries", IEEE Transactions on Computer Aided Design of IntegratedCircuits and Systems, vol. 24, No. 9, (Sep. 1, 2005), pp. 1347-1361. |
Kar et al, "TECHMIG: A Layout Tool for Technology Migration", 12th International Conference on VLSI Design-Jan. 1999 IEEE, pp. 615-620. |
Kar, P K et al., "TECHMIG: A layout tool for technology migration", VLSI Design, 1999, (Jan. 7, 1999), pp. 615-620. |
Lin et al, "Minplex-A Compactor that Minimizes the Bounding Rectangle and Individual Rectangles in a Layout", Research Lab of Electronics MIT, 23rd Design Automation Conference, Paper 7.4, Jun. 1986 IEEE, pp. 123-130. |
Lin, S L et al., "Minplex-A Compactor that Minimizes the Bounding Rectangle and Individual Rectangles in a Layout", Design Automation, (Jun. 29, 1986), pp. 123-130. |
Marple, "A Hierarchy Preserving Hierarchical Compactor," 27th ACM/IEEE Design Automation Conference, 1990, Paper 22.2, pp. 375-381. |
Also Published As
Publication number | Publication date |
---|---|
US20100185996A1 (en) | 2010-07-22 |
CN101675437A (en) | 2010-03-17 |
WO2008116807A1 (en) | 2008-10-02 |
CN101675437B (en) | 2012-08-08 |
JP2010522975A (en) | 2010-07-08 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7117468B1 (en) | Layouts with routes with different spacings in different directions on the same layer, and method and apparatus for generating such layouts | |
US6898772B1 (en) | Method and apparatus for defining vias | |
KR100399645B1 (en) | Polygon representation in an integrated circuit layout | |
US6957407B2 (en) | Method and apparatus for detail routing using obstacle carving around terminals | |
US20090031266A1 (en) | Ic design modeling allowing dimension-dependent rule checking | |
US6957411B1 (en) | Gridless IC layout and method and apparatus for generating such a layout | |
US8386967B2 (en) | Semiconductor layout scanning method and system | |
US6889372B1 (en) | Method and apparatus for routing | |
US6938234B1 (en) | Method and apparatus for defining vias | |
JP2010531505A (en) | Semiconductor layout correction method based on design rules and user constraints | |
US7096449B1 (en) | Layouts with routes with different widths in different directions on the same layer, and method and apparatus for generating such layouts | |
KR20140043399A (en) | Method, system and computer program product of checking an integrated circuit layout for instances of a reference pattern | |
Sarkar et al. | Finding a largest rectangle inside a digital object and rectangularization | |
US7013448B1 (en) | Method and apparatus for propagating cost functions | |
US6973634B1 (en) | IC layouts with at least one layer that has more than one preferred interconnect direction, and method and apparatus for generating such a layout | |
US7089524B1 (en) | Topological vias route wherein the topological via does not have a coordinate within the region | |
US7013451B1 (en) | Method and apparatus for performing routability checking | |
US6957408B1 (en) | Method and apparatus for routing nets in an integrated circuit layout | |
TW202403585A (en) | Integrated circuit with non-preferred direction curvilinear wiring | |
US20150269301A1 (en) | Goal-based cell partitioning in the presence of obstacles | |
US7069531B1 (en) | Method and apparatus for identifying a path between source and target states in a space with more than two dimensions | |
Žalik | Merging a set of polygons | |
US6951005B1 (en) | Method and apparatus for selecting a route for a net based on the impact on other nets | |
Pineda de Gyvez et al. | Systematic extraction of critical areas from IC layouts | |
Nöllenburg et al. | Layered area-proportional rectangle contact representations |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: SAGANTEC ISRAEL LTD, ISRAEL Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:EL YAHYAOUI, FARID;VAN GISBERGEN, JOZEFUS GODEFRIDUS GERARDUS PANCRATIUS;WILLEKENS, JEROEN PIETER FRANK;SIGNING DATES FROM 20091124 TO 20091125;REEL/FRAME:024177/0122 |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
FPAY | Fee payment |
Year of fee payment: 4 |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 8TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1552); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Year of fee payment: 8 |
|
AS | Assignment |
Owner name: APPLIED MATERIALS SOUTH EAST ASIA PTE. LTD., SINGAPORE Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:SAGANTEC ISRAEL LTD.;TAKUMI TECHNOLOGY CORPORATION;REEL/FRAME:057010/0059 Effective date: 20210602 |
|
AS | Assignment |
Owner name: APPLIED MATERIALS, INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:APPLIED MATERIALS SOUTH EAST ASIA PTE. LTD.;REEL/FRAME:057131/0770 Effective date: 20210706 |