Integrated circuit floorplanning method based on best fit heuristic sequence and multi-objective organizational evolution

Abstract

The invention discloses an integrated circuit floorplanning method based on a best fit heuristic sequence and multi-objective organizational evolution, and belongs to the technical field of physical design floorplanning. The method uses the best fit heuristic sequence for encoding and decoding, is combined with a multi-objective organizational evolutionary algorithm, and is used for solving the very large scale integration floorplanning problem. The method is characterized in that firstly each individual is initialized, then each individual is coded and decoded through the best fit heuristic sequence, and finally, a designed split operator, a designed annexation operator and a designed training operator are used for optimizing the multi-objective organization. Verification results show that the integrated circuit floorplanning method has advantages on two important aspects of methods and effectiveness for evaluating and solving the very large scale integration floorplanning problem, namely, the area utilization ratio and optimal line length of an optimal chip, and the method effectively solves the very large scale integration floorplanning problem and can be expanded to solve other multi-objective organizational optimization problems.

Description

technical field [0001] The present invention relates to a method of layout planning for physical design, in particular to an integrated circuit layout based on Best Fit Heuristic Sequence (BFHS) and Multi-objective Organizational Evolutionary Algorithms (MOEA). graph method. Background technique [0002] Floorplanning is a key link in the physical design of very large scale integration (VLSI), and its results have an important impact on the final chip size and global interconnection structure. With the rapid development of technology, the complexity of chip design is increasing rapidly, and the requirements for chip size and internal interconnection performance are also getting higher and higher, which makes the role of layout planning particularly important. For the floorplanning problem, many scholars have proposed a variety of algorithms using different mathematical tools, including the minimum partition algorithm, hierarchical design method, analytical algorithm and sto...

AI Technical Summary

Problems solved by technology

When solving a new problem, it is impossible to know what weights should be assigned to it to obtain the optimal result. In addition, the single-objective method can only solve one set of solutions at a time, and users often need to compare multiple sets of solutions before making decisions

This requires multiple runs and a large amount of calculation

Images