A Dummy Synthesis Method Based on Density Gradient Hotspot Clustering and Local Solving
A comprehensive method and density gradient technology, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve problems such as high computational complexity, dummy element insertion, loss of physical connotation, etc., and achieve density and gradient constraints Precise control, reduced number of dummy insertions, and improved computational efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0137] Embodiment 1 The comparison between the invention method of this method and the linear programming method on the filling effect
[0138] The overfill ratio is used to measure the accuracy of various dummy filling algorithms. The overfill rate is defined as:
[0139]
[0140] Among them, fill opt is the optimal filling amount obtained by linear programming method.
[0141] In this embodiment, the lower window density limit L=0.25. The weight function is defined as where c 0 =0.1,c 1 =-0.1,c 2 =1, the number of window divisions is r=3.
[0142] Figure 10It shows the overfill rate of the algorithm CPLF (CLP Plus Local Fill) proposed by the present invention when the gradient constraint changes from 0.06 to 0.1, and some experimental results are summarized in Table 1.
[0143] pass Figure 10 As can be seen in , the maximum overfill rate of CPLF is less than 6% in these examples. The overfill rate increases as the gradient constraint decreases, which is attr...
Embodiment 2
[0147] Embodiment 2 The execution efficiency of the method of the present invention follows the scalability of the problem scale
[0148] In order to demonstrate the scalability of the execution efficiency of the method of the present invention along with the scale of the problem, this embodiment uses calculation examples with different numbers of variables. The number of window divisions is set to 5. In order to have a similar distribution of gradient hotspots for all cases, the gradient constraints are varied in the range of 0.04 to 0.06.
[0149] The variation of the execution time of the inventive method CPLF algorithm with the number of variables is shown in Figure 11 middle. The execution time of the LP algorithm is also shown for comparison. From Figure 11 It can be seen that the temporal growth rate of CPLF is slower than that of LP method. In the largest calculation example (more than 8,000 variables), the solution time of the LP method exceeds 12 hours, while ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com