CN116011386A

CN116011386A - Automatic layout wiring method and device, storage medium and electronic equipment

Info

Publication number: CN116011386A
Application number: CN202310086178.1A
Authority: CN
Inventors: 李舒啸
Original assignee: Benyuan Scientific Instrument Chengdu Technology Co ltd
Current assignee: Benyuan Scientific Instrument Chengdu Technology Co ltd
Priority date: 2023-01-31
Filing date: 2023-01-31
Publication date: 2023-04-25
Anticipated expiration: 2043-01-31
Also published as: CN116011386B

Abstract

The invention discloses a layout automatic wiring method, a layout automatic wiring device, a storage medium and electronic equipment. The method comprises the following steps: acquiring at least one pair of wiring starting points and wiring ending points in a wiring area in a layout; constructing a grid map divided by grids according to the preset grid side length and the boundary of the layout area; converting each pair of wiring starting points and wiring ending points into a path searching starting point and a path searching ending point in the grid map; determining a path finding path with the least path passing through the grid center point between each pair of the path finding start point and the path finding end point; converting the route points of each route searching path including the route searching start point and the route searching end point into wiring points in the layout, and generating wiring lines which are sequentially connected with the corresponding wiring points of each route searching path. Through the mode, the wiring can be automatically generated, the wiring efficiency is improved, and the layout drawing time can be greatly saved.

Description

Automatic layout wiring method and device, storage medium and electronic equipment

Technical Field

The present invention relates to the field of integrated circuit layout design, and in particular, to a layout automatic wiring method, apparatus, storage medium and electronic device.

Background

In the design of integrated circuit layout, after drawing layout patterns of circuit entities such as components and pads, wiring is needed between connection points of each layout pattern to represent the circuit connection relationship. The existing wiring mode is to manually connect between connection points of two patterns to be wired, and when the mode is used for processing a large number of layout patterns, the operation is very complicated, the time consumption is long, and the wiring efficiency is extremely low.

Disclosure of Invention

The invention aims to provide an automatic layout wiring method, an automatic layout wiring device, a storage medium and electronic equipment, so that the problem of extremely low manual wiring efficiency in the prior art is solved, wiring can be automatically generated, and the wiring efficiency is improved.

In order to solve the technical problems, the invention provides an automatic layout wiring method, which comprises the following steps:

acquiring at least one pair of wiring starting points and wiring ending points in a wiring area in a layout;

constructing a grid map divided by grids according to the preset grid side length and the boundary of the layout area;

converting each pair of wiring starting points and wiring ending points into a path searching starting point and a path searching ending point in the grid map;

determining a path finding path with the least path passing through the grid center point between each pair of the path finding start point and the path finding end point;

Converting the route points of each route searching path including the route searching starting point and the route searching ending point into wiring points in the layout, and generating wiring lines which are sequentially connected with the corresponding wiring points of each route searching path.

Preferably, the constructing a grid map divided by grids according to the preset grid side length and the boundary of the layout area includes:

determining a minimum circumscribed rectangular frame of the boundary of the wiring area;

and constructing a grid map divided by grids according to the preset grid side length and the height and width of the minimum circumscribed rectangular frame.

Preferably, the constructing a grid map divided by grids according to the preset grid side length and the height and the width of the minimum circumscribed rectangular frame includes:

calculating the ratio of the height of the minimum circumscribed rectangular frame to the height of the preset grid side length and the ratio of the width to the width of the preset grid side length;

taking an integer larger than the height ratio as a height direction grid number, and taking an integer larger than the width ratio as a width direction grid number;

and constructing a grid map divided by grids according to the preset grid side length, the height direction grid number and the width direction grid number.

Preferably, a point with the smallest abscissa and ordinate on the boundary of the wiring area corresponds to a point in the grid map, which is a grid center point.

Preferably, the route searching start point and the route searching end point are grid center points.

Preferably, a coordinate conversion formula from the layout to the grid map is as follows:

i＝round((x-min_x)/step)；

j＝round((y-min_y)/step)；

the coordinate conversion formula from the grid map to the layout is as follows:

x＝i*step+min_x；

y＝j*step+min_y；

wherein x represents an abscissa of any point in the wiring area, y represents an ordinate of any point in the wiring area, i represents an abscissa of a corresponding point in the grid map, j represents an ordinate of a corresponding point in the grid map, min_x represents an abscissa minimum value of a boundary of the wiring area, min_y represents an ordinate minimum value of a boundary of the wiring area, step represents the preset grid side length, and round represents rounding operation.

Preferably, the path points of different path-finding paths do not coincide with each other.

Preferably, the determining the path finding path with the least path passing through the grid center point between each pair of the path finding start point and the path finding end point includes:

selecting a path searching starting point without a path searching path as a path searching point;

judging whether adjacent grids of the grids where the route points are positioned contain grids where the corresponding route searching end points are positioned or not;

if the grid corresponding to the route searching terminal is included, the route searching terminal is used as a new route point;

And sequentially connecting each route point to obtain a route searching path, setting the grid where each route point is positioned as an obstacle, and repeating the step of selecting a route searching starting point without the route searching path as the route point.

Preferably, the determining the path finding path with the minimum path passing through the grid center point between each pair of the path finding start point and the path finding end point further comprises:

if the grids corresponding to the route searching end point are not included, finding out grids which are not barriers, no route points and no other route searching start points or route searching end points from adjacent grids of the grids where the route points are located as alternative grids;

calculating the actual cost from the selected route searching starting point to the grid center point of each alternative grid and the estimated cost from the grid center point of each alternative grid to the route searching end point;

and selecting a grid center point with the minimum sum of the actual cost and the estimated cost as a new route point, and repeating the step of judging whether the adjacent grids of the grids where the route point is positioned contain the grids where the corresponding route searching end point is positioned.

Preferably, the actual cost is one of a manhattan distance, a chebyshev distance and a euclidean distance, and the estimated cost is one of a manhattan distance, a chebyshev distance and a euclidean distance.

Preferably, before determining the path-finding path with the minimum path-finding center point between each pair of the path-finding start point and the path-finding end point, the method further comprises:

calculating the ratio of the preset wiring spacing to the preset grid side length as the path spacing;

the method comprises the steps of sequentially connecting each route point to obtain a route finding path, setting the grid where each route point is located as an obstacle, and further comprising:

constructing a circular area by taking the path distance as a radius and taking each path point as a circle center;

and setting the grid covered by the circular area as an obstacle.

Preferably, the calculating the ratio of the preset wire spacing to the preset grid side length is used as the path spacing, and the method further includes:

and rounding up the path distance.

acquiring a wiring avoidance region in the wiring region;

converting each wiring avoidance area into an obstacle area in the grid map;

before selecting a route searching starting point without a route searching path as a route searching point, the method further comprises the following steps:

and setting the grid covered by the obstacle area as an obstacle.

Preferably, the method further comprises:

when wiring points which are not wiring starting points or wiring ending points exist at two ends of each wiring, moving the wiring points to the wiring starting points or the wiring ending points;

judging whether the wiring is a broken line or not;

if the wiring is a broken line, maintaining the slope of the line segment where the wiring point is located unchanged, and simultaneously adjusting the lengths of the line segment where the wiring point is located and the adjacent line segments so that the two line segments are intersected but not intersected.

In order to solve the technical problem, the invention also provides an automatic layout wiring device, which comprises:

the point position acquisition module is used for acquiring at least one pair of wiring starting points and wiring ending points in a wiring area in the layout;

the map construction module is used for constructing a grid map divided by grids according to the preset grid side length and the boundary of the layout area;

the point position conversion module is used for converting each pair of wiring starting points and wiring ending points into path searching starting points and path searching ending points in the grid map;

the path determining module is used for determining the path finding path with the minimum path passing grid center point between each pair of the path finding starting point and the path finding end point;

the routing generation module is used for converting the route points of each route finding path including the route finding start point and the route finding end point into the wiring points in the layout, and generating routing which is sequentially connected with the wiring points corresponding to each route finding path.

To solve the above technical problem, the present invention further provides a storage medium in which a computer program is stored, the computer program being configured to execute the layout automatic wiring method of any one of the foregoing when running.

To solve the above technical problem, the present invention further provides an electronic device, including a memory and a processor, where the memory stores a computer program, and the processor is configured to run the computer program to execute the layout automatic wiring method of any one of the foregoing.

Compared with the prior art, the automatic layout wiring method provided by the invention has the advantages that firstly, the wiring starting point and the wiring end point in the wiring area are obtained, then, the grid map is constructed according to the preset grid side length and the boundary of the wiring area, the wiring starting point and the wiring end point are converted into the path searching starting point and the path searching end point in the grid map, the path searching path with the minimum path searching grid center point between each pair of the path searching starting point and the path searching end point is determined, and finally, the path searching point of each path searching path is converted into the wiring point in the layout, so that the wiring sequentially connected with each wiring point is generated.

The automatic layout wiring device, the storage medium and the electronic equipment provided by the invention belong to the same conception as the automatic layout wiring method, so that the automatic layout wiring device and the electronic equipment have the same beneficial effects and are not repeated here.

Drawings

Fig. 1 is a schematic flow chart of a layout automatic wiring method according to an embodiment of the present invention.

Fig. 2a is a schematic diagram of a routing area.

Fig. 2b is a schematic diagram of a grid map constructed with smaller preset grid side lengths.

Fig. 2c is a schematic diagram of a wiring point converted from a path point in a wiring region.

Fig. 2d is a schematic diagram of a grid map constructed with larger preset grid side lengths.

Fig. 3 is a specific flowchart of step S2 in the flowchart shown in fig. 1.

Fig. 4 is a specific flowchart of step S22 in the flowchart shown in fig. 3.

Fig. 5 is a specific flowchart of step S4 in the flowchart shown in fig. 1.

Fig. 6a is a schematic diagram of three pairs of a route searching start point and a route searching end point in a grid map in one embodiment.

FIG. 6b is a schematic diagram of a first pair of a first and second road-finding start points and a second road-finding end point after the determination of the road-finding path.

Fig. 6c is a schematic diagram after determining a path-finding path between the second pair of the path-finding start point and the path-finding end point.

Fig. 6d is a schematic diagram after determining a path-finding path between the third pair of the path-finding start point and the path-finding end point.

Fig. 7 is a schematic flow chart of a layout automatic wiring method according to another embodiment of the present invention.

Fig. 8a is a schematic diagram showing the distribution of wiring points when the wiring is a broken line.

Fig. 8b is a schematic diagram of the generated trace when the trace is a broken line.

Fig. 8c is a schematic diagram of the trace after being adjusted when the trace is a broken line.

Fig. 9a is a schematic diagram of distribution of wiring points when the wiring is a line segment.

Fig. 9b is a schematic diagram of the generated trace when the trace is a line segment.

Fig. 9c is a schematic diagram of the trace after being adjusted when the trace is a line segment.

Fig. 10 is a schematic diagram of a qubit circuit layout in one particular application.

Fig. 11 is an enlarged schematic view of a portion D1 in fig. 10.

Fig. 12 is an enlarged schematic view of a portion D2 in fig. 10.

Fig. 13 is a schematic diagram after generating traces in the qubit circuit layout.

Fig. 14 is a schematic block diagram of an automatic layout wiring device according to an embodiment of the present invention.

Detailed Description

Specific embodiments of the present invention will be described in more detail below with reference to the drawings. Advantages and features of the invention will become more apparent from the following description and claims. It should be noted that the drawings are in a very simplified form and are all to a non-precise scale, merely for convenience and clarity in aiding in the description of embodiments of the invention.

In the description of the present invention, it should be understood that the directions or positional relationships indicated by the terms "center", "upper", "lower", "left", "right", etc., are based on the directions or positional relationships shown in the drawings, are merely for convenience in describing the present invention and simplifying the description, and do not indicate or imply that the devices or elements referred to must have a specific orientation, be constructed and operated in a specific orientation, and thus should not be construed as limiting the present invention.

Furthermore, the terms "first," "second," and the like, are used for descriptive purposes only and are not to be construed as indicating or implying a relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first" or "a second" may explicitly or implicitly include one or more such feature. In the description of the present invention, the meaning of "plurality" means at least two, for example, two, three, etc., unless specifically defined otherwise.

Example 1

Referring to fig. 1, an embodiment of the present invention provides a layout automatic wiring method, which includes the following steps:

s1: at least one pair of a wiring start point and a wiring end point in a wiring area in the layout is obtained.

The wiring area is an area allowing wiring, and the wiring starting point and the wiring end point can be points existing in the layout area alone or can be points on some existing devices or wirings. The wiring start point and the wiring end point may be obtained by recognition, for example, the wiring start point and the wiring end point are provided with specific identification information, the wiring start point and the wiring end point are recognized by the identification information, or may be determined based on external input, for example, a user inputs coordinate information of the wiring start point and the wiring end point, and the wiring start point and the wiring end point are obtained based on the coordinate information.

S2: and constructing a grid map divided by grids according to the preset grid side lengths and the boundaries of the layout areas.

Wherein, according to the size of the preset grid side length, the grid density of the grid map can be changed, and the larger the preset grid side length is, the lower the grid density of the grid map is, and vice versa. As shown in fig. 2a, the irregular graph in the rectangular frame of the drawing shows the boundary of the layout area, and fig. 2b and 2d show the grid map constructed based on the preset grid side length and the boundary of the layout area, and the grid side length of the grid map shown in fig. 2d is larger than the grid side length of the grid map shown in fig. 2 b.

S3: and converting each pair of the wiring starting point and the wiring ending point into a path searching starting point and a path searching ending point in the grid map.

Because the coordinate origin of the grid map is not the coordinate origin of the layout, the coordinates of the wiring starting point and the wiring ending point in the layout need to be converted into the coordinates of the grid map, so that the path searching starting point and the path searching ending point in the grid map are determined. As shown in fig. 2a, there are three pairs of wiring start points and wiring end points, A1 and B1, A2 and B2, A3 and B3, respectively, and the three pairs of wiring start points and wiring end points are the route finding start points and route finding end points in the grid map, respectively, M1 and N1, M2 and N2, and M3 and N3 in fig. 2B.

S4: and determining the path finding path with the minimum path passing through the grid center point between each pair of the path finding start point and the path finding end point.

After the path searching starting point and the path searching end point are determined in the grid map, a path searching path with the minimum path passing through the grid center point is necessarily arranged between the path searching starting point and the path searching end point, and the path between two adjacent path points is a straight line. As shown in fig. 2b, three path-finding paths are respectively determined between three pairs of path-finding start points and path-finding end points M1 and N1, M2 and N2, and M3 and N3, and the path points of the three path-finding paths between the path-finding start points and the path-finding end points are all grid center points.

S5: converting the route points of each route searching path including the route searching start point and the route searching end point into wiring points in the layout, and generating wiring lines which are sequentially connected with the corresponding wiring points of each route searching path.

The route points are points through which the route searching route passes, and the route between two adjacent route points is a straight line. The route points in this embodiment include a route finding start point, a route finding end point, and a grid center point. After the path finding path is determined, the coordinates of the path points on the path finding path need to be converted into the coordinates of the layout, so that the wiring points of the path points on the path finding path in the layout are determined, and wiring between each pair of wiring starting points and wiring ending points is generated by sequentially connecting the wiring points. As shown in fig. 2b, the path points on the three path-finding paths in the figure include a path-finding start point, a path-finding end point and a grid center point. After the route points on the three route finding paths are converted into the layout, the wiring points in the layout are the points K1, K2 and K3 in the figure 2c respectively, a plurality of wiring points K1 are sequentially connected to generate wiring, a plurality of wiring points K2 are sequentially connected to generate wiring, and a plurality of wiring points K3 are sequentially connected to generate wiring.

In the process of implementing the automatic layout wiring method of the embodiment, the determination of the grid map and the path finding path and the generation of the routing can be performed in the background of a computer or a server, and only the routing generated by the user is finally presented.

In some embodiments of the present application, referring to fig. 3, the step of constructing the grid map divided in the grid according to the preset grid side length and the boundary of the layout area, that is, the step S2 includes:

s21: a minimum bounding rectangular box of the boundary of the routing area is determined.

The minimum circumscribed rectangular frame can be determined according to an abscissa minimum value, an ordinate minimum value, an abscissa maximum value and an ordinate maximum value of the wiring area boundary. And forming a point by the minimum value of the abscissa and the minimum value of the ordinate, forming a point by the maximum value of the abscissa and the maximum value of the ordinate, and taking rays from the two points in the directions of the horizontal axis and the vertical axis respectively, wherein four rays are intersected in pairs to form a minimum circumscribed rectangular frame. As shown in fig. 2a, the outermost rectangular frame in the drawing is the smallest circumscribed rectangular frame of the boundary of the wiring area.

S22: and constructing a grid map divided by grids according to the preset grid side length and the height and width of the minimum circumscribed rectangular frame.

The height and the width of the grid map can be determined according to the height and the width of the minimum circumscribed rectangular frame, and then the grid number in the height and the width direction of the grid map can be determined according to the preset grid side length.

Further, referring to fig. 4, the step of constructing the grid map divided by the grid according to the preset grid side length, the height and the width of the minimum circumscribed rectangular frame, that is, the step S22 specifically includes:

S221: and calculating the ratio of the height of the minimum circumscribed rectangular frame to the height of the preset grid side length and the ratio of the width to the width of the preset grid side length.

The height of the minimum circumscribed rectangular frame is the difference between the maximum ordinate and the minimum ordinate of the minimum circumscribed rectangular frame, and the width of the minimum circumscribed rectangular frame is the difference between the maximum abscissa and the minimum abscissa of the minimum circumscribed rectangular frame. For example, the minimum bounding rectangle has a height of 34 and a width of 41, the predetermined grid side length is 1.2, the height ratio is 28.3 (one decimal point is reserved), and the width ratio is 34.2.

S222: and taking an integer larger than the height ratio as the height direction grid number, and taking an integer larger than the width ratio as the width direction grid number.

In this embodiment, in order to minimize the size of the grid map, the number of grids in the height direction is preferably the smallest integer greater than the height ratio, and the number of grids in the width direction is preferably the smallest integer greater than the width ratio, that is, the number of grids in the height direction is 29, and the number of grids in the width direction is 35.

S223: and constructing a grid map divided by grids according to the preset grid side length, the height direction grid number and the width direction grid number.

Through the mode, the layout automatic wiring method provided by the invention firstly obtains the wiring starting point and the wiring end point in the wiring area, then constructs a grid map according to the preset grid side length and the boundary of the wiring area, converts the wiring starting point and the wiring end point into the path searching starting point and the path searching end point in the grid map, then determines the path searching path with the minimum path searching grid center point between each pair of the path searching starting point and the path searching end point, finally converts the path searching point of each path searching path into the wiring point in the layout, and generates the routing sequentially connected with each wiring point.

Example 2

The embodiment provides a layout automatic wiring method, which comprises all technical features of embodiment 1. On the basis of embodiment 1, the point corresponding to the point having the smallest abscissa and ordinate on the boundary of the wiring area in the grid map is the grid center point. As shown in fig. 2a, the point with the smallest abscissa and ordinate on the boundary of the wiring area in the drawing is S point, the corresponding point in the grid map shown in fig. 2b is O point, and the O point is the grid center point.

In this embodiment, the route searching start point and the route searching end point are both grid center points. The embodiment provides a coordinate conversion formula between the layout and the grid map, and the route searching starting point and the route searching ending point can be always the grid center points through the coordinate conversion formula. The coordinate conversion formulas of the present embodiment are divided into a coordinate conversion formula of a layout-to-grid map and a coordinate conversion formula of a grid map-to-layout.

The coordinate conversion formula from the layout to the grid map is as follows:

i＝round((x-min_x)/step)；

j＝round((y-min_y)/step)；

x＝i*step+min_x；

y＝j*step+min_y；

wherein x represents the abscissa of any point in the wiring area, y represents the ordinate of any point in the wiring area, i represents the abscissa of the corresponding point in the grid map, j represents the ordinate of the corresponding point in the grid map, min_x represents the abscissa minimum of the boundary of the wiring area, min_y represents the ordinate minimum of the boundary of the wiring area, step represents the preset grid side length, and round represents rounding operation.

As shown in fig. 2a and 2d, the grid where the route searching start points M1, M2, M3 and the route searching end points N1, N2, N3 are located in fig. 2d contains other points not located at the grid center point, which are points actually corresponding to the route searching start points A1, A2, A3 and the route searching end points B1, B2, B3 in fig. 2a before the rounding operation, and after the rounding operation, the points actually corresponding to the route searching start points and the route searching end points become the grid center points of the grid where the route searching start points M1, M2, M3 and the route searching end points N1, N2, N3 are located. For example, as shown in fig. 2d, the map coordinates of the route searching end point N1 are (5, 2), the layout coordinates of the layout end point B1 are (4.9,2.4), the preset grid side length is 1, the map coordinates of the point actually corresponding to the layout end point B1 in the grid map are (4.9,2.4), that is, another point in the grid where the route searching end point N1 is located, and after rounding the abscissa and the ordinate of the point, the point becomes the route searching end point N1.

Example 3

The embodiment provides a layout automatic wiring method, which comprises all technical features of embodiment 2. On the basis of embodiment 2, the route points of different route finding paths do not coincide with each other. The routing points are not overlapped, so that the intersection of wires can be avoided, the wires on the layout correspond to wires in the circuit board, and the wires in the circuit board can be prevented from intersecting without intersecting.

Specifically, referring to fig. 5, the step of determining the path-finding path with the minimum path-finding grid center point between each pair of the path-finding start point and the path-finding end point, that is, the step S4 includes:

s41: and selecting a path searching starting point without a path searching path as a path searching point.

The selection order of the route searching starting points can be determined by a user, and can be consistent with the order of the layout starting points. For example, the numbers of the layout starting points in fig. 2a are A1, A2, and A3 in order, and the selection order of the path-finding starting points in fig. 2b is M1, M2, and M3 in order.

S42: judging whether adjacent grids of the grids where the circuit breaking transit points are positioned contain grids where the corresponding circuit searching end points are positioned;

s43: if the grid corresponding to the route searching terminal is included, the route searching terminal is used as a new route point;

s44: and a step of connecting each route point in turn to obtain a route searching path, setting the grid where each route point is positioned as an obstacle, and re-selecting a route searching starting point without the route searching path as the route point.

If the grids of a route searching starting point and a route searching end point corresponding to the route searching starting point are just adjacent, the route searching path can be determined through the steps, and at the moment, the route searching path only has two route points, namely the route searching starting point and the route searching end point, and the two route points are directly connected. The mesh in which the two waypoints are located is set as an obstacle.

Further, in this embodiment, step S4 further includes:

s45: if the grids corresponding to the route searching end point are not included, grids which are not barriers, have no route points and have no other route searching start points or route searching end points are found out from adjacent grids of the grids corresponding to the route searching end point to serve as alternative grids;

s46: calculating the actual cost from the selected route searching starting point to the grid center point of each alternative grid and the estimated cost from the grid center point of each alternative grid to the route searching end point;

s47: and selecting a grid center point with the minimum sum of the actual cost and the estimated cost as a new route point, and repeating the step of judging whether the adjacent grid of the grid where the route point is located contains the grid where the corresponding route searching end point is located.

If a route searching start point and a route searching end point are not adjacent, other grids exist between the two grids, a route point needs to be selected from grid center points of the grids, and the grids belonging to the obstacle are avoided when the route point is selected.

In the map road-finding field, the cost is the distance, the actual cost is the distance of the determined path between two points, and the estimated cost is the distance of the estimated path between two points. In this embodiment, the actual cost is one of a manhattan distance, a chebyshev distance, and a euclidean distance, and the estimated cost is one of a manhattan distance, a chebyshev distance, and a euclidean distance.

In some layout design requirements, the spacing between traces is specified in addition to the fact that the traces cannot cross. In order to meet the routing requirement, in this embodiment, the step of determining the routing path with the minimum routing grid center point between each pair of the routing start point and the routing end point, that is, before step S4, the method further includes:

step S44, which is to connect each path point in turn to obtain a path finding path and set the grid of each path point as an obstacle, further comprises:

the mesh covered by the circular area is set as an obstacle.

The ratio of the preset wire spacing to the preset grid side length is calculated, namely the preset wire spacing is converted into a grid map, so that the path spacing is obtained. For example, the preset wire pitch is 6.2, the preset grid side length is 2, and then the path pitch is 3.1.

Further, calculating a ratio of a preset wiring distance to a preset grid side length as a path distance, and further including: and rounding up the path distance. The upward rounding can more strictly ensure the spacing between the traces. For example, the path pitch is 3.1 before rounding up and becomes 4 after rounding up, then the circular area may cover more grids, thereby increasing the pitch between traces.

In some embodiments of the present application, the step of determining the path-finding path with the least path-finding center point between each pair of the path-finding start point and the path-finding end point, that is, before step S4, the method further includes:

s6: and acquiring a wiring avoidance area in the wiring area.

The execution sequence of step S6 may be before or after any of steps S1 to S3. The wiring avoidance region may be a region covered by a component or the like in the layout.

S7: and converting each wiring avoidance area into an obstacle area in the grid map.

Step S7 needs to be performed after step S2 is performed.

A step of selecting a route searching starting point without a route searching route from all route searching starting points as a route searching point, that is, before step S41, step S4 further includes:

s40: the mesh covered by the obstacle region is set as an obstacle.

The method of the present embodiment will be described in detail with reference to specific examples. In this particular example, the actual cost is the chebyshev distance and the estimated cost is the euclidean distance.

The chebyshev distance calculation formula:

g(n)＝(dx1+dy1)-min(dx1，dy1)+g(n′)；

dx1＝abs(n_x-n′_x)；

dy1＝abs(n_y-n′_y)；

the Euclidean distance is calculated as:

h(n)＝sqrt(dx2*dx2+dy2*dy2)；

dx2＝abs(n_x-goal_x)；

dy2＝abs(n_y-goal_y)；

wherein g (n ') represents the chebyshev distance from the selected route searching start point to the last route point n', n_x represents the abscissa of the grid center point n of the alternative grid, n_y represents the ordinate of the grid center point n of the alternative grid, n '_x represents the abscissa of the last route point n', n '_y represents the ordinate of the last route point n', gold_x represents the abscissa of the corresponding route searching end point, gold_y represents the ordinate of the corresponding route searching end point, min represents the minimum value operation, abs represents the absolute value operation, and sqrt represents the root operation.

Referring to fig. 6a to 6d, in fig. 6a, three route searching start points are respectively M1, M2, and M3, and corresponding route searching end points are respectively N1, N2, and N3. The coordinates of the O point are (0, 0), the preset grid side length is 1, the preset wiring interval is 1, and the path interval is 1. Adjacent grids of each grid are named as top, bottom, left, right, top left, bottom left, top right and bottom right grids respectively.

First, after an obstacle region is specified, a mesh covered by the obstacle region is set as an obstacle. In the figure, the shaded filled mesh represents an obstacle.

The first selected waypoint is set to be M1.

The route searching starting point M1 is selected as a route point, the adjacent grids of the grids where the route searching starting point M1 is positioned do not contain the grids where the route searching ending point N1 is positioned, and eight adjacent grids except the grid at the lower right are all selected as alternative grids. According to the calculation formula of the Chebyshev distance, the Chebyshev distance from the route searching starting point M1 to the grid center point of the alternative grid is 1, and according to the calculation formula of the Euclidean distance, the Euclidean distance from the grid center point of the grid under the road searching end point N1 is minimum and is about 12.04, and the sum of the Chebyshev distance and the Euclidean distance is also minimum, so that the grid center point of the grid under the road searching end point is taken as a new route point.

The adjacent grids of the grids where the new route points are located do not contain the grid where the route searching end point N1 is located, and eight adjacent grids except the right grid are all used as alternative grids. According to the calculation formula of the Chebyshev distance, the Chebyshev distance from the route searching starting point M1 to the grid center point of the alternative grid is 2, and according to the calculation formula of the Euclidean distance, the Euclidean distance from the grid center point of the lower right grid to the route searching end point N1 is minimum and is 11, and the sum of the Chebyshev distance and the Euclidean distance is also minimum, so that the grid center point of the lower right grid is taken as a new route point.

The adjacent grids of the grids where the new route points are located do not contain the grid where the route searching end point N1 is located, and eight adjacent grids except the grid on the right side are all used as alternative grids. According to the calculation formula of the Chebyshev distance, the Chebyshev distance from the route searching starting point M1 to the grid center point of the alternative grid is 3, and according to the calculation formula of the Euclidean distance, the Euclidean distance from the grid center point of the grid under the road searching end point N1 is the smallest, and the sum of the Chebyshev distance and the Euclidean distance is 10, so that the grid center point of the grid under the road searching end point is taken as a new route point.

The adjacent grids of the grids where the new route points are located do not contain the grid where the route searching end point N1 is located, and eight adjacent grids are all used as alternative grids. According to the calculation formula of the Chebyshev distance, the Chebyshev distance from the route searching starting point M1 to the grid center point of the alternative grid is 4, and according to the calculation formula of the Euclidean distance, the Euclidean distance from the grid center point of the grid under the road searching end point N1 is the smallest, and the sum of the Chebyshev distance and the Euclidean distance is 9, so that the grid center point of the grid under the road searching end point is continuously used as a new route point.

The process of finding a new waypoint is repeated until a waypoint with coordinates (4, 10) is found. Taking the route searching end point as a new route point;

The adjacent grids of the grids where the new route points (4, 10) are located do not contain the grid where the route searching end point N1 is located, and eight adjacent grids are taken as alternative grids except the grids right below, the left below and the right below. According to the calculation formula of the Chebyshev distance, the Chebyshev distance from the route searching starting point M1 to the grid center point of the alternative grid is 9, and according to the calculation formula of the Euclidean distance, the Euclidean distance from the grid center point of the right and left grids to the route searching end point N1 is minimum, about 5.10, and the sum of the Chebyshev distance and the Euclidean distance is minimum, so that the grid center points of the right and left grids can be used as new route points. In this particular example, new waypoints need to be determined in the traversal order of the neighboring mesh. For example, the traversing sequence of the adjacent grids of the grids where the route points are located is traversing clockwise from the upper right grid, then the grid center point of the right grid is selected as the new route point.

The process of finding a new waypoint continues to repeat until a waypoint with coordinates (5, 5) is found.

The adjacent grids of the grids where the new route points (5, 5) are located comprise grids where the route searching end point N1 is located, the route searching end point is used as the new route point, each route point is connected in sequence to obtain a route searching path, and the grid where each route point is located is set as an obstacle. And constructing a circular area by taking 1 as a radius and taking each route point as a circle center, and taking grids covered by the circular area as barriers, wherein each circular area covers 9 grids. The final path diagram between the path-finding start point M1 and the path-finding end point N1 is shown in fig. 6 b.

Next, a second selected route start point is set to be M2.

The route searching start point M2 is selected as the route point, and the route searching path between the route searching start point M2 and the route searching end point N2 is finally shown in fig. 6c according to the same process.

Next, a second selected route start point is set to be M3.

The route searching start point M3 is selected as the route point, and the route searching path between the route searching start point M3 and the route searching end point N3 is finally shown in fig. 6d according to the same process.

Example 4

The embodiment provides a layout automatic wiring method, which comprises all technical features of embodiment 2. Referring to fig. 7, on the basis of embodiment 2, the method further includes the steps of:

S8A: when there is a wiring point that is not a wiring start point or a wiring end point at both ends of each wiring, the wiring point is moved to the wiring start point or the wiring end point.

The coordinate conversion formula from the layout to the grid map does not perform coordinate compensation, and although the wiring points at two ends of each routing are points from the route searching start point or the route searching end point to the layout, the wiring points may not be the wiring start point or the wiring end point. For example, the layout coordinates of the starting point of a certain wiring are (5.3,7.8), the (min_x, min_y) are (1, 1), the preset grid side length is 1, and the coordinates of the starting point of the seek after the conversion to the map coordinates are (4, 7). After the path-finding path is determined, the path-finding starting points (4, 7) are converted to the coordinates (5, 8) of the wiring points in the layout, and the coordinates are offset from the actual wiring starting points (5.3,7.8).

S8B: judging whether the wiring is a broken line or not.

S8C: if the wiring is a broken line, the slope of the line segment where the wiring point is located is kept unchanged, and the lengths of the line segment where the wiring point is located and the adjacent line segments are adjusted so that the two line segments are intersected but not intersected.

For the routing of the broken line, only two line segments need to be adjusted to be connected with an actual routing starting point. As shown in fig. 8a to 8c, a plurality of points K1 in fig. 8a are route points of the route finding path converted to wiring points of the layout, and the uppermost wiring point K1 has a coordinate offset from the wiring start point A1. In fig. 8b, a plurality of wiring points K1 are sequentially connected to generate a trace, the uppermost wiring point K1 is moved to a wiring starting point A1, the slope of the line segment where the wiring point K1 is located is kept unchanged, and meanwhile, the length of the line segment where the wiring point K1 is located is shortened and the length of the adjacent line segment is prolonged, so that the two line segments intersect but do not intersect, and a new trace is obtained as shown in fig. 8 c.

For the routing of the line segments, connection with the actual routing starting point can be realized by only moving the position of the routing point. As shown in fig. 9a to 9c, a plurality of points K1 in fig. 9a are route points of the route finding path, and are converted to wiring points of the layout, the uppermost wiring point K1 has a coordinate shift with the wiring start point A1, and the lowermost wiring point K1 has a coordinate shift with the wiring end point B1. The wiring points K1 in fig. 9B are sequentially connected to generate a wiring, the uppermost wiring point K1 is moved to the wiring start point A1, the lowermost wiring point K1 is moved to the wiring end point B1, and a new wiring is obtained as shown in fig. 9 c.

The automatic layout wiring method of the present embodiment is particularly suitable for wiring of complex circuit layouts, please refer to fig. 10 to 13, and in a specific application, the automatic layout wiring method of the present embodiment is adopted to perform wiring on a qubit circuit layout. As shown in fig. 10, the quantum bit circuit layout is entirely located in the wiring area, the center of the layout is a drawn bit array, the periphery of the bit array is rectangular, PADs of the bit array need to be connected, each PAD is provided with a connecting point, the connecting point of the PAD is set as a wiring starting point, the edge of the bit array is distributed with the connecting point, and the connecting point of the bit array is set as a wiring ending point. As shown in fig. 11, the wiring start point is a connecting line point of PAD, and the numbers of the wiring start points are ordered from 0. As shown in fig. 12, the wiring end points are the connection points of the bit array, and the number of the wiring end points is also ordered from 0 and corresponds to the number of the wiring start point one by one. After the qubit circuit layout is processed according to the layout automatic wiring method of the embodiment, the finally generated wiring is shown in fig. 13. As can be seen from fig. 13, many traces are created between the bit array and the peripheral PAD, which do not cross each other and remain at a distance.

Example 5

Referring to fig. 14, the present embodiment provides an automatic layout wiring device, which includes:

the point position acquisition module 1 is used for acquiring at least one pair of wiring starting points and wiring ending points in a wiring area in the layout. The wiring area is an area allowing wiring, and the wiring starting point and the wiring end point can be points existing in the layout area alone or can be points on some existing devices or wirings. The wiring start point and the wiring end point may be obtained by recognition, for example, the wiring start point and the wiring end point are provided with specific identification information, the wiring start point and the wiring end point are recognized by the identification information, or may be determined based on external input, for example, a user inputs coordinate information of the wiring start point and the wiring end point, and the wiring start point and the wiring end point are obtained based on the coordinate information.

And the map construction module 2 is used for constructing a grid map divided by grids according to the preset grid side lengths and the boundaries of the layout areas. Wherein, according to the size of the preset grid side length, the grid density of the grid map can be changed, and the larger the preset grid side length is, the lower the grid density of the grid map is, and vice versa.

The point position conversion module 3 is used for converting each pair of the wiring starting point and the wiring end point into a path searching starting point and a path searching end point in the grid map. Because the coordinate origin of the grid map is not the coordinate origin of the layout, the coordinates of the wiring starting point and the wiring ending point in the layout need to be converted into the coordinates of the grid map, so that the path searching starting point and the path searching ending point in the grid map are determined.

The path determining module 4 is configured to determine a path finding path with the least path passing through the grid center point between each pair of the path finding start point and the path finding end point. After the path searching starting point and the path searching end point are determined in the grid map, a path searching path with the minimum path passing through the grid center point is necessarily arranged between the path searching starting point and the path searching end point, and the path between two adjacent path points is a straight line.

The routing generation module 5 is configured to convert route points including a route searching start point and a route searching end point of each route searching path into wiring points in the layout, and generate a routing sequentially connected with the wiring points corresponding to each route searching path. The route points are points through which the route searching route passes, and the route between two adjacent route points is a straight line. The route points in this embodiment include a route finding start point, a route finding end point, and a grid center point. After the path finding path is determined, the coordinates of the path points on the path finding path need to be converted into the coordinates of the layout, so that the wiring points of the path points on the path finding path in the layout are determined, and wiring between each pair of wiring starting points and wiring ending points is generated by sequentially connecting the wiring points.

The automatic layout wiring device of the embodiment may also have other technical features identical to the automatic layout wiring method of the foregoing embodiments, so that the steps in the foregoing embodiments are implemented, and the same technical effects are achieved, which are not repeated here.

The present invention also provides a storage medium having stored therein a computer program arranged to perform the layout automatic layout wiring method of any of the previous embodiments when run.

Specifically, in the present embodiment, the storage medium may include, but is not limited to: a usb disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a removable hard disk, a magnetic disk, or an optical disk, or other various media capable of storing a computer program.

The invention also provides an electronic device comprising a memory in which a computer program is stored and a processor arranged to run the computer program to perform the layout automatic layout method of any of the embodiments.

In particular, the memory and the processor may be connected by a data bus. In addition, the electronic apparatus may further include a transmission device connected to the processor, and an input/output device connected to the processor.

In the description of the present specification, a description of the terms "one embodiment," "some embodiments," "examples," or "particular examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, schematic representations of the above terms are not necessarily directed to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics may be combined in any suitable manner in any one or more embodiments. Further, one skilled in the art can engage and combine the different embodiments or examples described in this specification.

The foregoing is merely a preferred embodiment of the present invention and is not intended to limit the present invention in any way. Any person skilled in the art will make any equivalent substitution or modification to the technical solution and technical content disclosed in the invention without departing from the scope of the technical solution of the invention, and the technical solution of the invention is not departing from the scope of the invention.

Claims

1. An automatic layout wiring method is characterized by comprising the following steps:

2. The method of claim 1, wherein constructing a grid map divided by grids according to preset grid side lengths and boundaries of the layout area comprises:

3. The method according to claim 2, wherein constructing the grid map divided by the grid according to the preset grid side length, the height and the width of the minimum bounding rectangular box comprises:

4. The method of claim 1, wherein a point on the wire area boundary where both the abscissa and the ordinate are smallest corresponds to a point in the grid map that is a grid center point.

5. The method of claim 4, wherein the wayfinding start point and the wayfinding end point are both grid center points.

6. The method of claim 5, wherein the coordinate transformation formula of the layout to the grid map is:

i＝round((x-min_x)/step)；

j＝round((y-min_y)/step)；

x＝i*step+min_x；

y＝j*step+min_y；

7. The method of claim 5, wherein the path points of different path finding paths do not coincide with each other.

8. The method of claim 7, wherein determining the path-finding path between each pair of the path-finding start point and the path-finding end point that is least routed through the grid center point comprises:

9. The method of claim 8, wherein determining the path-finding path between each pair of the path-finding start point and the path-finding end point that is least routed through the grid center point, further comprises:

10. The method of claim 9, wherein the actual cost is one of a manhattan distance, a chebyshev distance, and a euclidean distance, and the estimated cost is one of a manhattan distance, a chebyshev distance, and a euclidean distance.

11. The method of claim 9, wherein prior to determining the path-finding path having the least number of points between each pair of the path-finding start point and the path-finding end point through the grid center point, the method further comprises:

and setting the grid covered by the circular area as an obstacle.

12. The method of claim 11, wherein calculating a ratio of the preset trace pitch to the preset grid edge length as the path pitch further comprises:

and rounding up the path distance.

13. The method of claim 9, wherein prior to determining the path-finding path having the least number of points between each pair of the path-finding start point and the path-finding end point through the grid center point, the method further comprises:

acquiring a wiring avoidance region in the wiring region;

converting each wiring avoidance area into an obstacle area in the grid map;

and setting the grid covered by the obstacle area as an obstacle.

14. The method of claim 6, wherein the method further comprises:

judging whether the wiring is a broken line or not;

15. An automatic layout wiring device, comprising:

16. A storage medium, characterized in that the storage medium has stored therein a computer program arranged to perform the layout automatic layout wiring method of any of claims 1 to 14 when run.

17. An electronic device comprising a memory and a processor, the memory having stored therein a computer program, the processor being arranged to run the computer program to perform the layout automatic routing method of any of claims 1 to 14.