Circuit wiring method and system, electronic equipment and computer storage medium

Abstract

The invention provides a circuit wiring method and system, electronic equipment and a computer storage medium. The circuit wiring method comprises the steps of obtaining an original circuit layout; packaging the original circuit layout by using a Hanna grid composition method to obtain a plurality of grids; according to the connection number of each element in the original circuit layout, obtaining an initial wire; performing similarity clustering on the initial routing; and according to a similarity clustering result, adjusting the initial routing based on the grid to obtain a final routing. By constructing the Hanna grid, the search performance of subsequent wiring can be effectively improved, so that the wiring efficiency is improved; by performing similarity clustering on the initial routing, the priority can be set for routing planning, so that the shortest total length of the routing is ensured, the routing complexity is reduced, the area occupied by the routing is reduced, and the problem of how to improve the automatic routing effect is solved.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of circuit design, in particular to a circuit wiring method and system, electronic equipment and computer storage medium. BACKGROUND

[0002] In the process of circuit design, it is necessary to convert the circuit schematic diagram into a circuit layout, so as to produce and manufacture a circuit board with printed lines according to the circuit layout. The design of the circuit layout needs to meet various electrical rules (such as line width, spacing, etc.) and physical constraints (such as via quantity, layer number), and also needs to ensure that the wiring is as short as possible under the premise of not crossing, so as to reduce the area of the circuit board and the power consumption of the circuit board. Therefore, circuit wiring becomes a key step that affects the quality of circuit layout design.

[0003] Traditional circuit wiring mainly relies on experienced designers to manually perform, and when the circuit is complex and the number of devices is large, it not only takes a lot of time, but also is difficult to ensure that the circuit wiring is error-free and is the best solution. Therefore, designers propose an automatic wiring algorithm to replace manual wiring. However, the existing automatic wiring algorithm is difficult to obtain a local and global optimal solution, resulting in complex wiring, excessive length, or congestion, so that the final wiring result is not ideal. SUMMARY

[0004] The purpose of the present application is to provide a circuit wiring method and system, electronic equipment and computer storage medium, to solve the problem of how to improve the effect of automatic wiring.

[0005] To solve the above technical problems, the present application provides a circuit wiring method, comprising: obtaining an original circuit layout; using a Hannah grid composition method to package the original circuit layout to obtain a plurality of grids; obtaining an initial wiring according to the connection number of each element in the original circuit layout; performing similarity clustering on the initial wiring; adjusting the initial wiring based on the grid according to the result of similarity clustering to obtain a final wiring.

[0006] Optionally, in the circuit wiring method, the method of using the Hannah grid composition method to package the original circuit layout to obtain a plurality of grids comprises: extracting all elements in the original circuit layout; constructing an outer rectangular frame of all elements; based on the outer rectangular frame of the elements, using the Hannah grid composition method to compose and package to obtain a plurality of grids.

[0007] Optionally, in the circuit wiring method, the method for obtaining the initial wiring according to the connection numbers of the elements in the original circuit layout comprises: numbering the pins of the elements according to the connection relationship of the elements in the original circuit layout to obtain the connection numbers, wherein the pins that need to be connected have the same connection number; connecting the pins corresponding to the same connection number to obtain the initial wiring.

[0008] Optionally, in the circuit wiring method, the method for adjusting the initial wiring based on the grid according to the similarity clustering result to obtain the final wiring comprises: setting the priority of the initial wiring according to the similarity clustering result; adjusting the initial wiring based on the grid according to the priority order to obtain the final wiring.

[0009] Optionally, in the circuit wiring method, the method for setting the priority of the initial wiring according to the similarity clustering result comprises: setting the initial wiring of the similarity clustering to the first priority; setting the initial wiring in the same similarity clustering to the second priority in the order from short to long; wherein the first priority has a higher level than the second priority.

[0010] Optionally, in the circuit wiring method, the method for adjusting the initial wiring based on the grid according to the priority order to obtain the final wiring comprises: calculating the edge flux of the grid; using the A-star algorithm to search the wiring path according to the initial wiring in sequence according to the priority order; if the edge flux of the grid where the current wiring path is located meets the wiring path requirement, the wiring path is determined as the final wiring; if the edge flux of the grid where the current wiring path is located does not meet the wiring path requirement, the wiring path is adjusted to pass through the adjacent grid of the current grid until the edge flux of the grid where the wiring path is located meets the wiring path requirement.

[0011] Optionally, in the circuit wiring method, the method for searching the wiring path according to the initial wiring in sequence using the A-star algorithm comprises: constructing the elements having the connection relationship into a network; calculating the sum of the distances of each element to other elements in the same network; adding the element corresponding to the minimum value of the sum of the distances to the searched set as the starting point; Taking the minimum value of the distance between the element corresponding to the starting point and other elements as the weight of the A-star algorithm to the end point; Using the A-star algorithm, searching for a routing path from the starting point; Traversing all the networks to obtain the routing path corresponding to each element.

[0012] Optionally, in the circuit routing method, the method of adjusting the initial routing based on the grid according to the priority order to obtain the final routing further comprises: In the grid, judging whether the routing path exists intersection according to the clockwise order or the counterclockwise order; If the intersection does not exist, the routing path is determined as the final routing.

[0013] To solve the above technical problems, the present application further provides a circuit routing system for realizing the circuit routing method as claimed in any one of the above, and the circuit routing system comprises: An acquisition module is configured to acquire an original circuit layout; A composition module is configured to encapsulate the original circuit layout by using the Hannah grid composition method to obtain a plurality of grids; A clustering module is configured to acquire an initial routing according to the connection number of each element in the original circuit layout, and to perform similarity clustering on the initial routing; A routing module is configured to adjust the initial routing based on the grid according to the result of the similarity clustering to obtain a final routing.

[0014] To solve the above technical problems, the present application further provides an electronic device comprising a memory, a processor, and an executable program stored in the memory and capable of being executed by the processor; when the processor executes the executable program, the circuit routing method as claimed in any one of the above is executed.

[0015] To solve the above technical problems, the present application further provides a computer storage medium, wherein the computer storage medium stores an executable program; when the executable program is executed, the circuit routing method as claimed in any one of the above is realized.

[0016] The circuit routing method, system, electronic device, and computer storage medium provided by this invention include: acquiring an original circuit layout; encapsulating the original circuit layout using the Hannah mesh method to obtain several meshes; obtaining initial traces based on the connection numbers of each component in the original circuit layout; performing similarity clustering on the initial traces; and adjusting the initial traces based on the meshes according to the results of the similarity clustering to obtain the final traces. By constructing a Hannah mesh, the search performance of subsequent traces can be effectively improved, thereby increasing routing efficiency; by performing similarity clustering on the initial traces, priority can be set for trace planning, thereby ensuring the shortest total trace length, reducing routing complexity, and reducing the area occupied by the traces, thus solving the problem of how to improve the effect of automatic routing. Attached Figure Description

[0017] Figure 1 This is a flowchart of the circuit wiring method provided in this embodiment; Figure 2 This is an example diagram of the weight calculation for the A* algorithm provided in this embodiment; Figure 3 This is a process example diagram of the cross-determination algorithm provided in this embodiment; Figure 4 This is a structural block diagram of the circuit wiring system provided in this embodiment. Detailed Implementation

[0018] The circuit wiring method and system, electronic device, and computer storage medium proposed in this invention will be further described in detail below with reference to the accompanying drawings and specific embodiments. It should be noted that the drawings are all in a very simplified form and use non-precise scales, and are only used to facilitate and clarify the illustration of the embodiments of this invention. Furthermore, the structures shown in the drawings are often part of the actual structure. In particular, different figures may emphasize different aspects and sometimes use different scales.

[0019] It should be noted that the terms "first," "second," etc., used in the specification, claims, and drawings of this invention are used to distinguish similar objects in order to describe embodiments of the invention, and are not used to describe a specific order or sequence. It should be understood that such uses of terminology are interchangeable where appropriate. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0020] This embodiment provides a circuit wiring method, such as Figure 1 As shown, it includes: S1, Obtain the original circuit layout; S2, using the Hannah grid method, encapsulates the original circuit layout to obtain several grids; S3, obtain the initial routing based on the connection numbers of each component in the original circuit layout; S4, perform similarity clustering on the initial routing; S5. Based on the results of similarity clustering, the initial routing is adjusted according to the grid to obtain the final routing.

[0021] The circuit routing method provided in this embodiment can effectively improve the search performance of subsequent routing by constructing a Hannah mesh, thereby improving routing efficiency. By performing similarity clustering on the initial routing, priority can be set for routing planning, thereby ensuring the shortest total routing length, reducing routing complexity, and reducing the area occupied by routing, thus solving the problem of how to improve the effect of automatic routing.

[0022] Specifically, in this embodiment, step S1 involves obtaining the original circuit layout.

[0023] In practical applications, the original circuit layout contains various components, which can be resistors, capacitors, transistors, etc., as well as pads, vias, copper foil, regular areas, forbidden areas, and existing traces.

[0024] Furthermore, in this embodiment, step S2, which uses the Hannah mesh patterning method to encapsulate the original circuit layout to obtain several meshes, includes: S21, extract all components from the original circuit layout.

[0025] Specifically, in this embodiment, relevant software can be used to automatically identify all components and classify and label them according to their type.

[0026] S22, construct the outer rectangle of all components.

[0027] Specifically, in this embodiment, a minimum circumscribed rectangle is constructed for all components. Of course, in other embodiments, the minimum circumscribed rectangle can be expanded outward by a preset multiple based on the minimum spacing requirement of the components, so that the minimum distance between the circumscribed rectangle and the component is not less than the minimum spacing requirement of the component, thereby ensuring that the subsequent routing around the component meets the minimum spacing requirement.

[0028] In practical applications, if overlapping bounding rectangles occur, these overlapping rectangles can be divided into multiple smaller rectangles, ensuring that components reside within these rectangles. In other words, the bounding rectangles divide the original circuit layout into two distinct regions: a region containing components and a region where components are not present.

[0029] S23, based on the outer rectangular frame of the component, uses the Hannah mesh method to construct and encapsulate the structure to obtain several meshes.

[0030] Specifically, in this embodiment, based on the circumscribed rectangle of the element, the four sides of the circumscribed rectangle are extended outward using the Hannah mesh construction method until they encounter an obstacle or boundary, thereby constructing a Hannah mesh. The specific implementation method of obtaining the mesh using the Hannah mesh construction method is well known to those skilled in the art, and will not be described in detail here.

[0031] Preferably, in order to improve the search performance of subsequent routing paths, in this embodiment, the constructed mesh can be merged, that is, multiple adjacent meshes with the same state can be merged into a large mesh.

[0032] Furthermore, in this embodiment, step S3, the method for obtaining the initial routing based on the connection numbers of each component in the original circuit layout, includes: S31. Based on the connection relationship of each component in the original circuit layout, number the pins of the components to obtain the connection number. The connection numbers corresponding to the pins that need to be connected are the same.

[0033] Specifically, considering that in the circuit layout, some components have multiple other components connected to the same pin, in order to facilitate global routing design and ensure the accuracy of the routing results, in this embodiment, the pins of the components are numbered according to the connection relationship of each component in the original circuit layout, so that the connection numbers corresponding to the pins to be connected are the same, which facilitates subsequent routing design based on the connection numbers.

[0034] S32 connects the pins corresponding to the same connection number to obtain the initial routing.

[0035] Specifically, in order to reduce the amount of computation and improve the routing efficiency, in this embodiment, this step can ignore the occupation of the routing position by the components, and directly use straight lines to connect the pins corresponding to the same connection number to obtain the initial routing.

[0036] Furthermore, in this embodiment, step S4 involves performing similarity clustering on the initial traces.

[0037] Specifically, based on the connection numbers of the two endpoints of the initial traces, the similarity of the initial traces is calculated, and clustering is performed according to the similarity. In other words, several initial traces within a neighboring region are clustered based on their similarity. Since multiple initial traces within the same similarity cluster indicate that they have essentially the same trace path within that region, similarity clustering can improve routing efficiency and routing effectiveness.

[0038] Furthermore, in this embodiment, step S5, adjusting the initial routing based on the grid according to the similarity clustering results to obtain the final routing, includes the following method: S51, set the priority of the initial routing based on the results of similarity clustering.

[0039] Specifically, in this embodiment, considering that multiple initial traces within the same similarity cluster represent essentially identical trace paths within that region, the initial traces in the similarity cluster are given the highest priority. This ensures that trace paths corresponding to initial traces not within the same similarity cluster bypass the trace paths corresponding to multiple initial traces within the same cluster, thereby guaranteeing that trace paths do not intersect while minimizing the total length of the trace paths. This results in a final routing result with smaller footprint and lower circuit power consumption.

[0040] Furthermore, in this embodiment, the initial traces within the same similarity cluster are assigned a second priority in ascending order of length. That is, the traces between closely spaced components are prioritized to ensure the shortest path length, thereby effectively reducing trace complexity.

[0041] In practical applications, the first priority level is higher than the second priority level.

[0042] S52, based on priority order, adjusts the initial routing according to the mesh to obtain the final routing.

[0043] Specifically, in this embodiment, firstly, the edge flux of the grid is calculated. Then, according to the priority order, the A* algorithm is used to search for routing paths sequentially based on the initial routing path. If the edge flux of the grid containing the current routing path meets the routing path requirements, then the routing path is determined as the final routing path; if the edge flux of the grid containing the current routing path does not meet the routing path requirements, then the routing path is adjusted to pass through the adjacent grids of the current grid until the edge flux of the grid containing the routing path meets the routing path requirements.

[0044] It should be noted that, unlike the existing A* algorithm which performs shortest path search from multiple starting points to a single endpoint, the A* algorithm used in this embodiment is used to perform shortest path search from multiple starting points to multiple endpoints, thereby enabling a comprehensive consideration of local and global routing to obtain the optimal solution.

[0045] In practical applications, the method described in this embodiment for searching routing paths sequentially based on the initial routing using the A* algorithm includes: First, construct a network from the interconnected components. For example... Figure 2 As shown, N2.1, N2.2, and N2.3 are component pins with interconnected relationships, which together form a network Net1.

[0046] Then, calculate the sum of the distances between each element and every other element in the same network. Still using... Figure 2 Taking the example shown, calculate the distances between the three components N2.1, N2.2, and N2.3. The distance between N2.1 and N2.2 is d1, the distance between N2.1 and N2.3 is d2, and the distance between N2.2 and N2.3 is d3. Then, in this network, the sum of the distances between N2.1 and other components is dN2.1 = d1 + d2. Similarly, the sum of the distances between N2.2 and other components is dN2.2 = d1 + d3, and the sum of the distances between N2.3 and other components is dN2.3 = d2 + d3.

[0047] Next, the element corresponding to the minimum sum of distances is taken as the starting point and added to the searched set. Assume, Figure 2 In the network shown, the minimum sum of distances is dN2.1. Therefore, N2.1 is taken as the starting point and added to the search set of the A* algorithm.

[0048] Then, the minimum distance between the starting point and other elements is taken as the weight to the endpoint in the A* algorithm. (Still using...) Figure 2 Taking the network shown as an example, with N2.1 as the starting point, among the distances d1 between N2.1 and N2.2 and d2 between N2.3, d2 is the minimum value. Therefore, d2 is used as the weight to the endpoint in the A* algorithm.

[0049] Next, the A* algorithm is used to search for a path from the starting point. The specific implementation is readily apparent to those skilled in the art based on the existing A* algorithm and the aforementioned technical content of this application, and will not be elaborated further here.

[0050] Thus, by traversing all networks, the routing paths corresponding to all components can be obtained. Since the A* algorithm used in this embodiment modifies the weight to the endpoint to the minimum distance between the starting point and other components, the search direction of the algorithm is given (searching the path with the smaller weight first), and the search objective is defined as finding the shortest routing path, thereby effectively improving the routing path search efficiency and thus improving the circuit routing efficiency.

[0051] Preferably, in this embodiment, step S5, adjusting the initial routing based on the mesh according to the similarity clustering results to obtain the final routing, further includes: S53, within the grid, determine whether the routing paths intersect in a clockwise or counterclockwise order; if no intersection occurs, then determine the routing path as the final routing path.

[0052] Specifically, in this embodiment, a cross-cutting algorithm is used to determine whether the routing paths intersect. This can be achieved by using a stack traversal method to determine if the routing paths intersect.

[0053] In one specific embodiment, such as Figure 3 As shown, the box represents a grid, e1, e2, e3, and e4 represent the four edges of the grid, n1 and n2 represent the two existing paths within the grid, and the dashed line represents the new path to enter the grid. Since the new path enters the grid from edge e3, the traversal starts from edge e3 and proceeds clockwise, adding n2 to the stack. When the traversal reaches the outgoing edge e4 of the new path, n2 is still on the top of the stack, therefore, it is determined that the new path will lead to an intersection.

[0054] In practical applications, the cross-judgment algorithm in step S53 can be used in conjunction with the A* algorithm described above. This allows the search for a routing path to end directly when the cross-judgment algorithm determines that the routing path currently being searched by the A* algorithm has a cross, thus ensuring that the routing path ultimately searched by the A* algorithm does not have a cross.

[0055] The circuit routing method provided in this embodiment improves upon the existing A* algorithm and combines it with a cross-cutting algorithm. This improves routing efficiency while ensuring that the searched routing path not only has the shortest path length but also does not intersect with other routing paths, thus enhancing routing effectiveness.

[0056] This embodiment also provides a circuit routing system for implementing the circuit routing method described above, such as... Figure 4 As shown, the circuit wiring system includes: The acquisition module is used to acquire the original circuit layout; The layout module is used to encapsulate the original circuit layout using the Hannah grid layout method to obtain several grids; The clustering module is used to obtain the initial traces based on the connection numbers of each component in the original circuit layout, and also to perform similarity clustering on the initial traces; The routing module is used to adjust the initial routing based on the grid according to the results of similarity clustering to obtain the final routing.

[0057] The circuit routing system provided in this embodiment constructs a Hannah mesh through a mapping module, which can effectively improve the search performance of subsequent routing and thus improve routing efficiency. By clustering the initial routing based on similarity through a clustering module, priority can be set for routing planning, thereby ensuring that the total length of the routing module is minimized, reducing routing complexity, and reducing the area occupied by the routing, thus solving the problem of how to improve the effect of automatic routing.

[0058] Furthermore, this embodiment also provides an electronic device, including a memory, a processor, and an executable program stored in the memory and capable of being run by the processor; when the processor runs the executable program, it performs the circuit wiring method described above.

[0059] Furthermore, this embodiment also provides a computer storage medium storing an executable program; when the executable program is executed, it implements the circuit wiring method described above.

[0060] It should be noted that the various embodiments in this specification are described in a progressive manner, with each embodiment focusing on the differences from other embodiments. Similar or identical parts between embodiments can be referred to mutually. In addition, different parts between embodiments can also be combined with each other, and this invention does not limit this.

[0061] The circuit routing method, system, electronic device, and computer storage medium provided in this embodiment include: acquiring the original circuit layout; encapsulating the original circuit layout using the Hannah mesh method to obtain several meshes; obtaining initial traces based on the connection numbers of each component in the original circuit layout; performing similarity clustering on the initial traces; and adjusting the initial traces based on the meshes according to the results of the similarity clustering to obtain the final traces. By constructing the Hannah mesh, the search performance of subsequent traces can be effectively improved, thereby improving routing efficiency; by performing similarity clustering on the initial traces, priority can be set for trace planning, thereby ensuring the shortest total trace length, reducing routing complexity, and reducing the area occupied by the traces, thus solving the problem of how to improve the automatic routing effect.

[0062] The above description is merely a description of preferred embodiments of the present invention and is not intended to limit the scope of the present invention in any way. Any changes or modifications made by those skilled in the art based on the above disclosure shall fall within the protection scope of the claims.

Claims

1. A circuit wiring method, characterized in that, include: Obtain the original circuit layout; The original circuit layout is encapsulated using the Hannah grid method to obtain several grids; Obtain the initial routing based on the connection numbers of each component in the original circuit layout; Perform similarity clustering on the initial routing; Based on the results of similarity clustering, the initial routing is adjusted according to the grid to obtain the final routing.

2. The circuit wiring method according to claim 1, characterized in that, The method of encapsulating the original circuit layout using the Hannah grid method to obtain several grids includes: Extract all components from the original circuit layout; Construct the bounding rectangle of all components; Based on the outer rectangular frame of the component, the Hannah mesh method is used for pattern encapsulation to obtain several meshes.

3. The circuit wiring method according to claim 1, characterized in that, The method for obtaining the initial routing based on the connection numbers of each component in the original circuit layout includes: Based on the connection relationship of each component in the original circuit layout, the pins of the components are numbered to obtain the connection number, where the connection numbers corresponding to the pins that need to be connected are the same. Connect the pins corresponding to the same connection number to obtain the initial routing.

4. The circuit wiring method according to claim 1, characterized in that, The method of adjusting the initial routing based on the grid according to the results of similarity clustering to obtain the final routing includes: Based on the results of similarity clustering, the priority of the initial routing is set; The initial routing is adjusted based on the grid according to the priority order to obtain the final routing.

5. The circuit wiring method according to claim 4, characterized in that, The method for setting the priority of initial routing based on the results of similarity clustering includes: Set the initial routing for similarity clustering as the first priority; Initial traces within the same similarity cluster are assigned a second priority in ascending order of length. The first priority level is higher than the second priority level.

6. The circuit wiring method according to claim 4, characterized in that, The method of adjusting the initial routing based on the mesh according to priority order to obtain the final routing includes: Calculate the edge flux of the mesh; Based on priority, the A* algorithm is used to search for routing paths sequentially according to the initial routing. If the flux of the grid edge where the current routing path is located meets the routing path requirements, then the routing path is determined as the final routing path; If the flux of the grid edge where the current routing path is located does not meet the routing path requirements, the routing path will be adjusted to pass through the adjacent grids of the current grid until the flux of the grid edge where the routing path is located meets the routing path requirements.

7. The circuit wiring method according to claim 6, characterized in that, The method of using the A* algorithm to sequentially search for routing paths based on the initial routing includes: Construct a network from elements that are connected; Calculate the sum of the distances between each element and all other elements in the same network; The element corresponding to the minimum sum of distances is taken as the starting point and added to the already searched set; The minimum distance between the starting element and other elements is taken as the weight of the endpoint in the A* algorithm; Using the A* algorithm, search for the route path from the starting point; Traverse all networks to obtain the routing paths corresponding to all components.

8. The circuit wiring method according to claim 6, characterized in that, The method of adjusting the initial routing based on the mesh according to priority order to obtain the final routing also includes: Within the grid, determine whether the routing paths intersect in a clockwise or counterclockwise order; If there is no intersection, then the routing path is determined as the final routing path.

9. A circuit routing system for implementing the circuit routing method as described in any one of claims 1 to 8, characterized in that, The circuit wiring system includes: The acquisition module is used to acquire the original circuit layout; The layout module is used to encapsulate the original circuit layout using the Hannah grid layout method to obtain several grids; The clustering module is used to obtain the initial traces based on the connection numbers of each component in the original circuit layout, and also to perform similarity clustering on the initial traces; The routing module is used to adjust the initial routing based on the grid according to the results of similarity clustering to obtain the final routing.

10. An electronic device, characterized in that, It includes a memory, a processor, and an executable program stored in the memory and capable of being run by the processor; when the processor runs the executable program, it performs the circuit routing method as described in any one of claims 1 to 8.

11. A computer storage medium, characterized in that, The computer storage medium stores an executable program; when the executable program is executed, it implements the circuit wiring method as described in any one of claims 1 to 8.

Images