Wiring method and device based on inflection point, equipment and medium
By adopting a wiring method based on inflection point in the rewiring layer technology in the field of semiconductor packaging, adjusting the search direction and setting the inflection point to avoid obstacles, the problem of inefficiency of traditional path search algorithms is solved, and more efficient wiring path search and circuit performance improvement is achieved.
Patent Information
- Application Number
- CN202411731546.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-11-29
- Publication Date
- 2025-03-04
AI Technical Summary
In the rewiring layer (RDL) technology in the field of semiconductor packaging, traditional path search algorithms such as A* search algorithms are difficult to quickly determine the optimal wiring path, resulting in low wiring efficiency and limited circuit performance.
The wiring method based on inflection point is adopted to avoid obstacles by adjusting the search direction and setting inflection points, reduce unnecessary search steps, and optimize the wiring path.
It significantly shortens the search time of wiring paths, improves wiring efficiency, reduces signal transmission delay and overall circuit performance improvement.
Smart Images
Figure CN119558258A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of integrated circuit design automation and wiring technology, and in particular to a wiring method and device, equipment, and medium based on inflection points. Background Art
[0002] In the field of semiconductor packaging, redistribution layer (RDL) technology plays a key role, responsible for re-layout and optimization of the path connecting the inside of the chip to the external packaging interface. Compared with traditional wiring, the obstacle density in the RDL wiring environment is lower, and wiring is often required between different layers, which makes it difficult for traditional search methods to quickly determine the optimal wiring path.
[0003] At present, traditional path search algorithms usually adopt A * Search algorithms,in the RDL routing environment, will still traverse many non-critical nodes, thus reducing the efficiency of routing,and the overall performance of the circuit.
[0004] Based on this, a new wiring method is needed. Summary of the invention
[0005] In view of this, the embodiments of this specification provide a wiring method and device, equipment, and medium based on inflection points. By continuously adjusting the search direction and the inflection point method, obstacles can be effectively avoided, unnecessary search steps can be reduced, and the optimal path search time from the starting point to the end point can be significantly shortened, thereby significantly improving the wiring efficiency.
[0006] The embodiments of this specification provide the following technical solutions:
[0007] The embodiment of this specification provides a wiring method based on an inflection point, including:
[0008] Acquire the starting point and the end point of the wiring in the area to be laid out, and determine the priority search direction of the wiring path according to the position of the starting point relative to the end point, wherein the priority search direction includes at least one;
[0009] Starting from the starting point, searching along any priority search direction, when encountering an obstacle, setting a turning point before the obstacle, and changing the search direction to bypass the obstacle;
[0010] Repeat the search until the routing path reaches the end point;
[0011] When the routing path reaches the end point, the turning points set along the way are connected to obtain the routing path from the starting point to the end point.
[0012] The embodiment of the present specification also provides a wiring device based on an inflection point, including:
[0013] A wiring planning module, which obtains the starting point and the end point of the wiring in the area to be laid out, and determines a priority search direction of the wiring path according to the position of the starting point relative to the end point, wherein the priority search direction includes at least one;
[0014] An obstacle processing module, starting from the starting point, searches along any priority search direction, and when encountering an obstacle, sets a turning point in front of the obstacle and changes the search direction to bypass the obstacle;
[0015] Repeat the search until the routing path reaches the end point;
[0016] The wiring path generation module is used to connect the turning points set along the way when the wiring path reaches the end point, so as to obtain the wiring path from the starting point to the end point.
[0017] The embodiment of the present specification also provides an electronic device, including:
[0018] At least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor so that the at least one processor can execute: any one of the inflection point-based wiring methods described above.
[0019] An embodiment of the present specification also provides a computer storage medium, characterized in that the computer storage medium stores computer executable instructions, and when the computer executable instructions are executed by a processor, they execute: any of the inflection point-based wiring methods described above.
[0020] Compared with the prior art, the at least one technical solution adopted in the embodiments of this specification can achieve the following beneficial effects:
[0021] By determining the priority search direction between the starting point and the end point, dynamically setting the turning point and adjusting the search direction to avoid obstacles, it is possible to shorten the wiring path while reducing unnecessary search steps, effectively improving the search efficiency, shortening the wiring time, and quickly determining the best wiring path, thereby maintaining good circuit integrity in high-speed, high-frequency circuits, reducing the propagation delay of the clock signal, and improving the overall performance of the circuit. BRIEF DESCRIPTION OF THE DRAWINGS
[0022] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for use in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.
[0023] Figure 1 is an overall flow chart of the wiring method based on inflection points in this application;
[0024] Figure 2 is a diagram illustrating a first search direction of a wiring method based on an inflection point in the present application;
[0025] Figure 3 It is a schematic diagram of the blocking situation encountered by the route of the inflection point-based wiring method in this application. DETAILED DESCRIPTION
[0026] The embodiments of the present application are described in detail below with reference to the accompanying drawings.
[0027] The following describes the implementation methods of the present application through specific examples, and those skilled in the art can easily understand other advantages and effects of the present application from the contents disclosed in this specification. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all the embodiments. The present application can also be implemented or applied through other different specific implementation methods, and the details in this specification can also be modified or changed in various ways based on different viewpoints and applications without departing from the spirit of the present application. It should be noted that, in the absence of conflict, the following embodiments and the features in the embodiments can be combined with each other. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in the field without making creative work belong to the scope of protection of the present application.
[0028] It should be noted that various aspects of the embodiments within the scope of the appended claims are described below. It should be apparent that the aspects described herein can be embodied in a wide variety of forms, and any specific structure and / or function described herein is merely illustrative. Based on the present application, it should be understood by those skilled in the art that an aspect described herein can be implemented independently of any other aspect, and two or more of these aspects can be combined in various ways. For example, any number and aspect described herein can be used to implement the device and / or practice the method. In addition, other structures and / or functionalities other than one or more of the aspects described herein can be used to implement this device and / or practice this method.
[0029] It should also be noted that the illustrations provided in the following embodiments are only schematic illustrations of the basic concept of the present application. The drawings only show components related to the present application rather than being drawn according to the number, shape and size of components in actual implementation. In actual implementation, the type, quantity and proportion of each component may be changed arbitrarily, and the component layout may also be more complicated.
[0030] Additionally, in the following description, specific details are provided to facilitate a thorough understanding of the examples. However, it will be understood by those skilled in the art that the examples can be practiced without these specific details.
[0031] During the semiconductor packaging stage, redistribution layer (RDL) technology is used to re-layout and optimize the I / O ports of the chip, allowing direct connection to contact points on the RDL during the packaging process rather than just connecting to the edge of the chip.
[0032] Current path search algorithms are based on heuristic search algorithms, such as A * The search algorithm evaluates the total cost (f value) of each node by combining the actual path cost (g value) and the estimated distance to the target (h value). Starting from the starting point, it always prioritizes exploring the node with the lowest total cost until it reaches the end point and constructs the optimal path by backtracking. Although it can construct the optimal path from the starting point to the end point, in actual applications, especially in environments with fewer obstacles such as RDL wiring, a large number of unnecessary nodes will be traversed, resulting in very low wiring efficiency.
[0033] In view of this, the inventors discovered through research and improvement exploration that the existing wiring method lacks an effective mechanism to avoid unnecessary nodes, which leads to inefficient wiring process and limited overall circuit performance.
[0034] In the improvement of the wiring method, it was further discovered that A* wiring would cause too many corners in the wiring path, thereby causing a decrease in signal transmission efficiency.
[0035] Based on this, the embodiment of this specification proposes a wiring method based on inflection points: the overall idea is: by adjusting the search direction and determining the inflection point to effectively bypass obstacles, reduce the wiring length and unnecessary search steps, optimize the wiring path, thereby improving wiring efficiency, reducing signal attenuation, and improving circuit performance.
[0036] The technical solutions provided by various embodiments of the present application are described below in conjunction with the accompanying drawings.
[0037] like Figure 1 As shown, the embodiment of this specification provides a wiring method based on inflection points, including:
[0038] Acquire the starting point and the end point of the wiring in the area to be laid out, and determine the priority search direction of the wiring path according to the position of the starting point relative to the end point, wherein the priority search direction includes at least one;
[0039] Starting from the starting point, searching along any priority search direction, when encountering an obstacle, setting a turning point before the obstacle, and changing the search direction to bypass the obstacle;
[0040] Repeat the search until the routing path reaches the end point;
[0041] When the routing path reaches the end point, the turning points set along the way are connected to obtain the routing path from the starting point to the end point.
[0042] Specifically, the starting point and end point of the routing are determined according to the area (Core) to be routed input by the user. The starting point of the routing is usually the bump on the package, and the end point is usually the metal pad on the die. According to the relative positions of the starting point and the end point, an overall priority search direction from the starting point to the end point is determined to optimize the routing process.
[0043] For example, in Figure 2 In the figure, the thick circles represent the starting point and the end point, the relatively thin circles represent the turning points, and the squares represent obstacles. If the end point is located in the upper right corner of the starting point, the priority search directions are upward and rightward.
[0044] The search process starts from the starting point, selects a direction from the preferred search directions, and then searches along the selected priority search direction until encountering an obstacle. When encountering an obstacle, an inflection point is set in front of the obstacle (obstacle block) and the search direction is changed to bypass the obstacle.
[0045] Then, the path exploration continues along the new direction, and the steps of searching and bypassing obstacles are repeated until the end point is reached;
[0046] Finally, when the routing path successfully reaches the end point, all the turning points are connected to form a complete routing path from the starting point to the end point, which can effectively avoid obstacles, thereby reducing unnecessary search steps and ensuring the efficiency of the routing path and the optimization of circuit performance.
[0047] In some embodiments, one direction is selected from the priority search directions as the first search direction, and then the search is performed along the selected priority search direction until an obstacle is encountered. When an obstacle is encountered, an inflection point is set in front of the obstacle (obstacle block) and the search direction is changed to bypass the obstacle.
[0048] In this way, one or more complete routing paths can be generated, and finally, the most suitable one is selected from these paths as the final routing path.
[0049] In some embodiments, after the start point and the end point of the routing are determined, a first search direction is determined from the priority search directions according to the positions of the end points relative to the four boundaries of the area to be laid out.
[0050] Specifically, the first search direction is determined based on the position of the end point relative to the four boundaries (top, bottom, left, and right) of the layout area.
[0051] The first search direction is defined as: once the search direction is not blocked, the search will proceed in this direction first.
[0052] like Figure 2 As shown in (1), if the distance between the target (end point) and the right boundary is the smallest, the right direction is selected as the first search direction. During the search process, if there is an obstacle on the right side, it will temporarily turn to other directions to avoid the obstacle. Once there is no obstruction in the right direction, the search direction will automatically adjust back to the right and continue searching in the right direction until the end point is reached.
[0053] Similarly, if the target (end point) is at the minimum distance from the upper boundary, such as Figure 2 As shown in (2), upward is selected as the first search direction, and the routing will mainly search along the upward direction until the end point is reached, thereby ensuring that the routing path is more direct and efficient, while being able to flexibly deal with obstacles in the layout.
[0054] In some embodiments, when an obstacle is encountered, the first search direction is adjusted to the second search direction at the turning point, and the search is continued along the second search direction. When the obstacle is cleared and there is no obstacle in the first search direction, a turning point is set, and the wiring direction is restored to the first search direction to continue the search.
[0055] Specifically, when an obstacle is encountered, a direction in the priority search direction is preferentially selected at the inflection point as the second search direction.
[0056] Assumptions Figure 3 The end point in is located at the upper right corner of the starting point, so the priority search directions are upward and right. If the first search direction is right, the second search direction is upward:
[0057] like Figure 3 As shown in (1), when the right direction is blocked, the search direction is adjusted to the upward direction at the turning point, and then the search direction continues to move in the upward direction. When the right direction is not blocked, a turning point is immediately set and the direction is adjusted to the right. Since the right direction is always unblocked in this example, the search direction will continue to move to the right until it is aligned with the target horizontal coordinate, and then turn upward to reach the target point (end point).
[0058] like Figure 3 (2) shows that Figure 3 (1) is different. When the second turning point approaches the horizontal coordinate of the target point (end point) to the right, there is an obstacle. At this time, the steps of the first obstacle block will be repeated before the second obstacle block. A turning point will be set and the direction will be adjusted upward. When there is no obstruction on the right, the direction will be adjusted to the right immediately, and so on until the target point (end point) is reached.
[0059] In some embodiments, when an obstacle is encountered, if the search direction is still blocked after adjusting the first search direction to the second search direction at the turning point, the search direction is traced back to the turning point, and the search direction is adjusted to a third search direction, and the search is continued along the third search direction. When the obstacle is cleared and there is no obstacle in the first search direction, the turning point is set, and the first search direction is restored to continue the search.
[0060] Specifically, Figure 3 As shown in (4), the cross indicates that the current path is not feasible, and the arc arrow represents the backtracking direction. If the priority search direction is upward and right, when the first search direction is right, the second search direction is upward:
[0061] When there is a block to the right, if you encounter an obstacle block after adjusting the direction upward, you will automatically backtrack to the current turning point. At this time, the search direction will be adjusted to search downward. When there is no blockage on the right, you will still approach the target point according to the principle of "first to the right and then upward".
[0062] In some embodiments, when an obstacle is encountered, if the first search direction is adjusted to the second search direction or the third search direction at the inflection point and both are blocked, the current inflection point is cancelled and the current inflection point is marked as an obstacle area;
[0063] The routing path is traced back to the last turning point, and the first search direction is adjusted to the second search direction for searching.
[0064] Specifically, Figure 3 As shown in (5), if the priority search directions are upward and rightward, when the first search direction is selected as right, the second search direction is upward:
[0065] When there is a blockage to the right, no matter whether the search direction is adjusted to upward or downward, there will be a blockage. At this time, the current turning point is canceled and marked as an obstacle area. Then, the search goes back to the previous turning point (the starting point in this example) and the direction is adjusted to upward. Subsequently, when there is a blockage upward, the target point (end point) is approached according to the principle of "first right and then up".
[0066] In some embodiments, during the layout path search process, when the ordinate of the obstacle is higher than the ordinate of the end point, an inflection point is set when there is no obstacle, and the search is adjusted back to the first search direction to continue;
[0067] When the abscissa of the routing path is aligned with the abscissa of the end point, the inflection point is set and the search is performed toward the end point.
[0068] Specifically, Figure 3 As shown in (3), if the priority search directions are upward and rightward, when the first search direction is selected as right, the second search direction is upward:
[0069] When the search path encounters the last obstacle, if the height of the obstacle causes the ordinate of the path to exceed the ordinate of the target point (end point) after attempting to detour to the right, the path will continue to extend to the right until the abscissa of the path is aligned with the abscissa of the target point. After reaching the alignment point, the path will turn downward and move directly toward the target point to complete the routing, ensuring that the routing path can smoothly bypass the obstacle while maintaining the shortest possible path.
[0070] In some embodiments, before determining the start and end points of routing in the area to be laid out, the area to be laid out is divided into a plurality of routing grids;
[0071] The size of the wiring grid is uniform;
[0072] The priority search direction of the routing path is determined according to the positions of the starting point and the end point in the routing grid.
[0073] Specifically, before determining the specific starting point and end point, the entire area to be laid out is divided into multiple wiring grids of uniform or non-uniform size according to the physical size and design requirements of the chip. Gridding helps to more accurately determine the starting point and end point of the wiring. Once the gridding is completed, the position of the starting point and end point in the grid can be used to determine the priority search direction, and when searching along the priority search direction, the best next moving direction can be determined at each grid node, thereby significantly improving the systematicness and efficiency of the wiring process and making wiring management more standardized and orderly.
[0074] The present invention proposes a wiring method based on inflection points, which avoids obstacles by adjusting the search direction and setting inflection points. It can shorten the wiring path and reduce unnecessary search steps, effectively improve the search efficiency, shorten the wiring time, and quickly determine the best wiring path.
[0075] Compared with the traditional path search algorithm, the inflection point-based search algorithm ultimately generates a path with fewer corners and a smaller resistance-capacitance effect (RC effect). It can maintain good circuit integrity in high-speed, high-frequency circuits, reduce the propagation delay of the clock signal, and thus improve the overall performance of the circuit.
[0076] Based on the same inventive concept, the present application also provides a wiring device based on an inflection point corresponding to the aforementioned method example, including:
[0077] A wiring planning module, which obtains the starting point and the end point of the wiring in the area to be laid out, and determines a priority search direction of the wiring path according to the position of the starting point relative to the end point, wherein the priority search direction includes at least one;
[0078] An obstacle processing module, starting from the starting point, searches along any priority search direction, and when encountering an obstacle, sets a turning point in front of the obstacle and changes the search direction to bypass the obstacle;
[0079] Repeat the search until the routing path reaches the end point;
[0080] The wiring path generation module is used to connect the turning points set along the way when the wiring path reaches the end point, so as to obtain the wiring path from the starting point to the end point.
[0081] Based on the same inventive concept, the present application also provides an electronic device based on a wiring method of an inflection point, the device comprising: a processor, a memory and a computer program; wherein
[0082] The memory is used to store the computer program, and the memory may also be a flash memory. The computer program is, for example, an application program, a functional module, etc. for implementing the above method.
[0083] The processor is used to execute the computer program stored in the memory to implement each step performed by the device in the above method. For details, please refer to the relevant description in the above method embodiment.
[0084] Optionally, the memory can be independent or integrated with the processor.
[0085] When the memory is a device independent of the processor, the device may further include:
[0086] A bus is used to connect the memory and the processor.
[0087] Based on the same inventive concept, the present application also provides a computer storage medium, which stores computer executable instructions. When the computer executable instructions are executed by a processor, they execute: a wiring method based on inflection points as described in any embodiment of the present application.
[0088] It should be noted that the computer storage medium may include but is not limited to: a portable disk, a hard disk, a random access memory, a read-only memory, an erasable programmable read-only memory, an optical storage device, a magnetic storage device or any suitable combination thereof.
[0089] In this specification, the same or similar parts between the various embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the embodiments described later, the description is relatively simple, and the relevant parts can be referred to the partial description of the previous embodiments.
[0090] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any changes or substitutions that can be easily thought of by a person skilled in the art within the technical scope disclosed in the present application should be included in the protection scope of the present application. Therefore, the protection scope of the present application shall be based on the protection scope of the claims.
Claims
1. A wiring method based on inflection points, characterized in that: include: Acquire the starting point and the end point of the wiring in the area to be laid out, and determine the priority search direction of the wiring path according to the position of the starting point relative to the end point, wherein the priority search direction includes at least one; Starting from the starting point, searching along any priority search direction, when encountering an obstacle, setting a turning point before the obstacle, and changing the search direction to bypass the obstacle; Repeat the search until the routing path reaches the end point; When the routing path reaches the end point, the turning points set along the way are connected to obtain the routing path from the starting point to the end point.
2. The wiring method based on inflection points according to claim 1, characterized in that: After determining the starting point and the end point of the routing, a first search direction is determined from the priority search directions according to the positions of the end points relative to the four boundaries of the area to be laid out.
3. The wiring method based on inflection points according to claim 2, characterized in that: When encountering an obstacle, the first search direction is adjusted to the second search direction at the turning point, and the search is continued along the second search direction. When the obstacle is cleared and there is no obstacle in the first search direction, an inflection point is set, and the wiring direction is restored to the first search direction to continue searching.
4. The wiring method based on inflection points according to claim 2, characterized in that: When encountering an obstacle, if the first search direction is adjusted to the second search direction at the turning point and is still blocked, go back to the turning point, adjust the search direction to the third search direction, and continue searching along the third search direction. When the obstacle is cleared and there is no obstacle in the first search direction, set the turning point, and restore the first search direction to continue searching.
5. The wiring method based on inflection points according to claim 2, characterized in that: When an obstacle is encountered, if the first search direction is adjusted to the second search direction or the third search direction at the turning point and both are blocked, the current turning point is cancelled and marked as an obstacle area; The routing path is traced back to the last turning point, and the first search direction is adjusted to the second search direction for searching.
6. The wiring method based on inflection points according to claim 2, characterized in that: During the layout path search process, when the ordinate of the obstacle is higher than the ordinate of the end point, an inflection point is set when there is no obstacle, and the search is continued in the first search direction; When the abscissa of the routing path is aligned with the abscissa of the end point, the inflection point is set and the search is performed toward the end point.
7. The wiring method based on inflection points according to claim 1, characterized in that: Before determining the start and end points of routing in the area to be laid out, the area to be laid out is divided into a plurality of routing grids; The size of the wiring grid is uniform; The priority search direction of the routing path is determined according to the positions of the starting point and the end point in the routing grid.
8. A wiring device based on inflection points, characterized in that: include: A wiring planning module, which obtains the starting point and the end point of the wiring in the area to be laid out, and determines a priority search direction of the wiring path according to the position of the starting point relative to the end point, wherein the priority search direction includes at least one; An obstacle processing module, starting from the starting point, searches along any priority search direction, and when encountering an obstacle, sets a turning point in front of the obstacle and changes the search direction to bypass the obstacle; Repeat the search until the routing path reaches the end point; The wiring path generation module is used to connect the turning points set along the way when the wiring path reaches the end point, so as to obtain the wiring path from the starting point to the end point.
9. An electronic device, characterized in that: include: at least one processor; And, a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute: the inflection point-based wiring method as described in any one of claims 1-7.
10. A computer storage medium, characterized in that: The computer storage medium stores computer executable instructions, and when the computer executable instructions are executed by a processor, the wiring method based on inflection points as described in any one of claims 1 to 7 is performed.