Heuristic method for dummy fill of chemical mechanical polishing process

A chemical-mechanical and heuristic technology, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve the problem of dummy element filling quantity and filling time

Active Publication Date: 2013-04-10
FUDAN UNIV
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In each optimization process, this method can dynamically determine the amount of filling dummy metal density into the grid to be filled according to the grid density cost function and the approximate precision ε, so as to overcome the static filling of dummy metal density in the previous heuristic algorithm The resulting dummy filling quantity is too large or the filling time is too long, making the final result closer to the optimal solution

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Heuristic method for dummy fill of chemical mechanical polishing process
  • Heuristic method for dummy fill of chemical mechanical polishing process
  • Heuristic method for dummy fill of chemical mechanical polishing process

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0074]In order to make the above objects, features and advantages of the present invention more obvious and understandable, the present invention will be further described below through specific examples.

[0075] Applying the heuristic method proposed by the present invention to obtain the result of dummy metal filling, it is first necessary to carry out fixed r-division to the entire layout; secondly, to extract layout parameters from the entire layout to obtain the original interconnection metal in each discrete grid. Density x 0 , in all the following examples, it is assumed that each grid original density x 0 It is a random number between 0 and 0.5; again, it is necessary to calculate and obtain each discrete grid according to the design rules of the layout (such as the specified minimum spacing between the signal line and the dummy metal, the size and spacing of the dummy metal, etc.) The maximum allowable packing density within the slack. In the following examples, th...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention belongs to the technical field of manufacturing of integrated circuit semiconductor and provides a heuristic method for the dummy fill of a chemical mechanical polishing process. In the method, the dummy fill problem of the minimum dummy metal number is expressed as a standard linear programming problem and then a heuristic algorithm for dynamically increasing the dummy metal density in a grid is provided for solving the minimum dummy fill problem. In the method, the density value of dummy metal filled in the to-be-filled grid is dynamically determined during each optimization process according to a grid density cost function and approximation precision; meanwhile, the increment of the dummy metal density in the grid during each iteration is adjusted through an approximate constant epsilon; thus the compromise of the final result precision and the calculation speed can be realized. The method has high feasibility, extremely high-efficiency processing speed, superior calculation speed and result precision to those of the popular Monte-Carlo method and can be used for solving the large-scale territory dummy fill problem.

Description

technical field [0001] The invention belongs to the technical field of integrated circuit semiconductor manufacturing, and relates to a heuristic method for fast dummy filling with the minimum number of dummy fills as the optimization target while ensuring the uniformity of layout metal density. technical background [0002] With the further development of integrated circuit semiconductor manufacturing technology, the feature size of integrated circuits is further reduced, and the damascene copper interconnection process is widely used in semiconductor manufacturing processes, and has become the mainstream process for multilayer wiring of integrated circuits. In the multi-layer wiring three-dimensional structure of copper interconnection, the high planarization of the chip surface is one of the key technologies. So far, the Chemical Mechanical Polishing (CMP) technology is the only planarization technology successfully and used on a large scale. [0003] One of the biggest ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Patents(China)
IPC IPC(8): G06F17/50
Inventor 周海曾璇严昌浩陶俊冯春阳
Owner FUDAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products