Circuit layout method based on cross point algorithm and simulated annealing algorithm

Abstract

The invention discloses a circuit layout method based on a cross point algorithm and a simulated annealing algorithm, and relates to a circuit layout method. At present, intersection points cannot beestimated under the condition that all connecting line sequence positions of line outgoing points and the routing sequence in a channel are unknown. The method comprises the following steps: obtaininga wiring diagram; calculating the number of routing intersection points according to an intersection point algorithm; setting a target function f (a) according to the number of wiring intersection points, the total wiring length, the graphic space utilization rate and the arrangement position; disturbance is executed, a new layout is generated, and an objective function f (b) is calculated; calculating delta f = f (b)-(a); judging whether delta f is less than or equal to 0, and if yes, accepting a new layout; if not, accepting a new solution according to a simulated annealing algorithm; and judging whether a termination condition is met or not, and if not, slowly reducing the temperature. According to the method, the intersection point can be estimated under the condition that all connecting line sequence positions and the routing sequence in the channel are unknown, estimation is convenient, disturbance calculation is carried out after the intersection point is calculated, and therefore the layout is more reasonable.

Description

technical field [0001] The invention relates to a circuit layout method, in particular to a circuit layout method based on a cross point algorithm and a simulated annealing algorithm. Background technique [0002] When performing line layout, in order to require the rationality of the layout, the number of intersections is less than the set number. However, the traditional calculation methods of intersection points need to determine the specific coordinates or specific order of the two lines. However, in practical applications, some complex drawing algorithms cannot determine these data at the beginning, but instead rely on the calculation results of intersection points first. To determine the position of the outlet point, and finally determine the order of the outlet points of each point and the order of routing in the channel. Therefore, at the beginning, a method is needed to estimate the intersection point when the sequence position of all the wires at each outlet point...

AI Technical Summary

Problems solved by technology

In the face of a solution domain composed of a variety of different parameters, the traditional simulated annealing algorithm cannot take into account both, and can only calculate the optimal solution of one parameter when the other parameter is fixed, otherwise the number of iterations will increase geometrically, resulting in Unacceptable time for results

Images