Differential pair line coupling method, device, equipment, medium and program

Abstract

The invention relates to the technical field of EDA, and provides a differential pair line coupling method, device and equipment, a medium and a program.The method comprises the steps that based on the layout positions of at least two components, two wiring paths are planned in multiple preset modes in sequence; each routing path has a starting point and an ending point; for each preset mode, judging whether the planned wiring path meets a wiring constraint condition or not; when the current preset mode meets the wiring constraint condition, generating two wiring paths; and when all the preset modes do not meet the wiring constraint condition, two wiring paths are generated by adopting a standby mode based on space heuristic and a shortest path algorithm. The method is used for automatically planning the differential pair wiring path meeting the wiring constraint and signal integrity requirements, and the wiring success rate, the coupling quality and the design automation level are improved.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of Electronic Design Automation (EDA), and particularly relates to a differential pair coupling method, device, equipment, medium and program. BACKGROUND

[0002] In the related art, with the development of high-speed circuit design, the requirement for the precision of differential signal pair routing is increasingly improved. The differential pair routing method in the existing EDA tool is mostly based on fixed coupling rules, such as constant spacing parallel routing. However, in actual layout, due to the dense components, narrow routing channel or obstacles, the standard coupling mode often cannot be implemented. The current technology lacks a mechanism that can automatically generate a compliant and high-quality detour path after the main path fails, resulting in routing interruption or the need for manual adjustment by designers, which seriously affects the design efficiency. Although some automatic routing algorithms support the detour function, the generated path often destroys the parallelism and length matching of the end segment of the differential pair, which damages the signal integrity. In addition, the existing method usually only outputs a single path, lacks the ability to evaluate and optimize multiple candidate paths, and is difficult to guarantee the consistency and optimization of the routing quality.

[0003] Therefore, there is an urgent need for a differential pair coupling method, device, equipment, medium and program to improve the above problems. SUMMARY

[0004] The present application provides a differential pair coupling method, device, equipment, medium and program, which is used for automatically planning a differential pair routing path that meets the routing constraint and signal integrity requirement, and improves the routing success rate, coupling quality and design automation level.

[0005] According to a first aspect of an embodiment of the present application, a differential pair line coupling method is provided, comprising: in a differential pair wiring process, based on layout positions of at least two components, sequentially adopting a plurality of preset modes to plan two wiring paths; each wiring path has a respective starting point and ending point; for each preset mode, judging whether the planned wiring path meets wiring constraint conditions; the wiring constraint conditions include that the wiring path does not collide with other components, and the spacing of the starting points of the two wiring paths and the spacing of the ending points of the two wiring paths both meet a safe spacing; when the current preset mode meets the wiring constraint conditions, generating the two wiring paths; when all preset modes do not meet the wiring constraint conditions, using a backup mode based on space exploration and a shortest path algorithm to generate the two wiring paths; the backup mode includes: constructing a geometric region based on at least one target connection point, generating a plurality of candidate connection points based on the geometric region; for each candidate point, respectively, using the shortest path algorithm to calculate a detour path from the starting point to the point; according to the spatial relative relationship of the starting points and the ending points of the two detour paths, determining the order of the two detour paths; based on a multi-level optimization rule, selecting an optimal solution from all detour paths as the final wiring path; the multi-level optimization rule includes at least one of the total wiring length, the parallelism of the last segment of the wiring, and the direction consistency.

[0006] In an embodiment, the two wiring paths are a first path and a second path; the starting point of the first path is a first starting point, and the starting point of the second path is a second starting point; the plurality of preset modes includes: drawing a line connecting the first starting point and the second starting point, and obtaining a first end point based on the line; the first end point is located on the line or a first perpendicular line of the line, and the first perpendicular line passes through the first starting point; obtaining a second end point based on the first end point; an included angle formed by the second end point, the first end point, and the second starting point is a preset angle; obtaining a third end point based on the second end point; the third end point and the second end point are located on a second perpendicular line of the line, and the third end point is located on a side of the second end point away from the line; sequentially connecting the first starting point, the first end point, the second end point, and the third end point as the first path; sequentially obtaining a fourth end point, a fifth end point, and a sixth end point based on the line; sequentially connecting the second starting point, the fourth end point, the fifth end point, and the sixth end point as the second path; the second path and the first path do not intersect each other, and are axially symmetric about a perpendicular bisector of the line.

[0007] In an embodiment, the plurality of preset modes includes at least one of a T-type coupling mode, a Y-type coupling mode, and a bow-type coupling mode; the T-type coupling mode includes: taking a non-starting point on the line as the first end point; the Y-type coupling mode includes: taking the first starting point as the first end point; the bow-type coupling mode includes: taking a point on the first perpendicular line as the first end point.

[0008] In an embodiment, the line width of the first path to the second path is width; when a T-type coupling mode is adopted, the distance T_len from the first end point to the second end point satisfies:

[0009] wherein dis is the length of the line, and gap is the coupling interval.

[0010] In an embodiment, when a Y-type coupling mode is adopted, the distance Y_len from the first end point to the second end point satisfies:

[0011] wherein dis is the length of the line, and gap is the coupling interval.

[0012] In an embodiment, when a bowstring-type coupling mode is adopted, the distance E_len from the first end point to the second end point satisfies:

[0013] wherein dis_e is the length of the line, and gap is the coupling interval.

[0014] In an embodiment, the backup mode includes a start point L-type coupling mode and an end point L-type coupling mode; the distance between the two end points in the start point L-type coupling mode is defined as a preset coupling interval; the first end point, the second end point, the fourth end point and the fifth end point of the end point L-type coupling mode are determined by a preset mode.

[0015] In an embodiment, the start point L-type coupling mode includes: determining the wiring priority based on the geometric relationship between the start connection points of the two differential wiring paths; constructing a polygonal tentative region around a preset center point, and generating a plurality of candidate end points in the region; respectively for each wiring path, calculating the feasible wiring path from the start connection point to each candidate end point by using the shortest path algorithm; and selecting the optimal solution from all feasible path combinations as the final wiring scheme according to a multi-level optimization rule, and the multi-level optimization rule includes the parallelism, the direction consistency and the total wiring length of the end segment wiring.

[0016] In an embodiment, the end point L-type coupling mode includes: constructing a polygonal tentative region based on the target connection point of any wiring path in the differential pair; determining the intersection midpoint of the tentative region and the line connecting the start connection point to the target connection point, and extending the direction line to obtain a transition access point; wiring from the start position of the parallel coupling segment to the transition access point; splitting into two parallel wiring paths maintaining the preset coupling interval after the access point; respectively performing the shortest path wiring for the two wiring paths, and extending them to the respective target connection points; and before performing the extension wiring, determining the wiring priority according to the spatial relative relationship of the end positions of the two wiring paths to avoid path conflict.

[0017] In one embodiment, the wiring process further includes: calculating the length difference between the first wiring path and the second wiring path; when the length difference exceeds a preset length threshold, identifying the longer wiring path and outputting a prompt message.

[0018] According to a second aspect of the present invention, a differential pair line coupling device is provided for implementing the method of any one of the first aspects, comprising: a layout analysis module for determining the start and end points of a differential pair based on the layout positions of at least two components; a path planning module for generating two routing paths sequentially using multiple preset methods during the routing process; a constraint checking module for determining whether the routing paths generated by each preset method meet routing constraints, the routing constraints including: the routing paths do not collide with other components, and the distance between the start and end points of the two routing paths both meet safety distances; a preset path generation module for generating two corresponding routing paths when the current preset method meets the routing constraints; a backup path generation module for activating a backup method and generating two routing paths through spatial probing and a shortest path algorithm when all preset methods do not meet the routing constraints; and an optimal decision module for selecting the optimal solution from all candidate paths as the final routing path based on multi-level optimization rules.

[0019] According to a third aspect of the present invention, an electronic device is provided, including a memory and a processor, wherein the memory is used to store a computer program executable by the processor; and the processor is used to execute the computer program in the memory to implement the method described above.

[0020] According to a fourth aspect of the present invention, a computer-readable storage medium is provided having a computer program stored thereon, characterized in that the above-described method can be implemented when the executable computer program in the storage medium is executed by a processor.

[0021] According to a fifth aspect of the present invention, a computer program product is provided, comprising a computer program that, when executed by a processor, implements the method described above.

[0022] Compared with existing technologies, the advantages of this invention are as follows: Based on the layout positions of at least two components, two routing paths are planned sequentially using multiple preset methods. When a preset method satisfies the constraints, the corresponding routing path is generated; when all preset methods fail to satisfy the constraints, a backup method based on spatial exploration and the shortest path algorithm is automatically activated. This method constructs a geometric region based on the target connection point, generates multiple candidate connection points, calculates detour paths, and selects the optimal solution using multi-level optimization rules. This mechanism significantly improves the routing success rate of differential pairs in high-density circuit boards and effectively avoids routing failures caused by obstacles. Simultaneously, the backup method ensures that the detour path maintains good coupling characteristics, guaranteeing the integrity of the differential signal. It achieves intelligent and automated path decision-making and optimization, improving the efficiency and reliability of differential pair circuit design. Attached Figure Description

[0023] Figure 1 This is a flowchart illustrating a differential pair line coupling method according to an exemplary embodiment.

[0024] Figure 2 This is a schematic diagram of a T-coupled routing method according to an exemplary embodiment.

[0025] Figure 3 This is a schematic diagram of a wiring path for a Y-coupled method according to another exemplary embodiment.

[0026] Figure 4 This is a schematic diagram of the wiring path for a slingshot-type coupling method according to yet another exemplary embodiment.

[0027] Figure 5 This is a schematic diagram of a trace path for an L-shaped coupling method at the starting point, according to an exemplary embodiment.

[0028] Figure 6 This is a schematic diagram of a wiring path for an L-shaped coupling method at the endpoint, according to another exemplary embodiment.

[0029] Figure 7 This is a block diagram illustrating a differential pair line coupling device according to an exemplary embodiment.

[0030] Figure 8 This is a block diagram illustrating an electronic device according to an exemplary embodiment.

[0031] Explanation of the reference numerals in the figure: 10. First starting point; 20. Second starting point; 1. First endpoint; 2. Second endpoint; 3. Third endpoint; 4. Fourth endpoint; 5. Fifth endpoint; 6. Sixth endpoint; 30. Differential pair line coupling device; 31. Layout analysis module; 32. Path planning module; 33. Constraint checking module; 34. Preset path generation module; 35. Backup path generation module; 36. Optimal decision-making module; 900. Electronic device; 922. Processing component; 926. Power supply component; 932. Memory; 950. Network interface; 958. Input / output interface. Detailed Implementation

[0032] Unless otherwise defined, the technical or scientific terms used in this specification should have the ordinary meaning understood by one of ordinary skill in the art to which this invention pertains. Specific embodiments of the invention will be described below with reference to the accompanying drawings. It should be noted that, in order to provide a concise description, this specification cannot provide a detailed description of all features of the actual embodiments. Without departing from the spirit and scope of the invention, those skilled in the art can make modifications and substitutions to the embodiments of the invention, and the resulting embodiments are also within the protection scope of the invention.

[0033] like Figure 1 As shown, the first embodiment of the present invention provides a differential pair line coupling method, including: during the routing process of the differential pair, based on the layout positions of at least two components, sequentially planning two routing paths using multiple preset methods; each routing path has its own starting point and ending point; for each preset method, determining whether the planned routing path meets routing constraints; the routing constraints include: the routing path does not collide with other components, and the distance between the starting points and the ending points of the two routing paths both meet safety distances; when the current preset method meets the routing constraints, generating the two routing paths; when all preset methods meet ... If neither of the above methods satisfies the wiring constraints, a backup method based on spatial probing and the shortest path algorithm is used to generate two routing paths. The backup method includes: constructing a geometric region based on at least one target connection point, and generating multiple candidate connection points based on this geometric region; calculating the detour path from the starting point to each candidate point using the shortest path algorithm; determining the order of the two detour paths based on the spatial relative relationship between the starting and ending points of the two detour paths; and selecting the optimal solution from all detour paths as the final routing path based on multi-level optimization rules. The multi-level optimization rules include at least one of the following: total routing length, parallelism of the final routing segment, and directional consistency.

[0034] In some specific embodiments, a differential pair consists of two signal lines with specific physical and electrical characteristics paired together for transmitting information. Differential signaling is a method of transmitting data through two complementary signal paths, one line carrying the original signal and the other carrying its inverse signal. The receiving end decodes the original signal by comparing the voltage difference between the two lines. This method effectively reduces electromagnetic interference (EMI), crosstalk, and other noise problems, thereby improving the reliability and quality of signal transmission.

[0035] In other specific embodiments, clearance refers to the minimum distance that must be maintained between different components and traces in PCB design to prevent electrical short circuits, signal interference, or physical damage. This distance varies depending on factors such as voltage level, current intensity, and manufacturing process in the specific application. For differential pairs, in addition to following general clearance requirements, special attention must be paid to ensuring that the spacing between the two traces remains consistent to ensure signal integrity and minimize changes in differential impedance, which is especially important for high-speed signal transmission.

[0036] like Figures 2 to 4 As shown, in one embodiment, the two routing paths are a first path and a second path; the starting point of the first path is a first starting point 10, and the starting point of the second path is a second starting point 20; the various preset methods include: drawing a line connecting the first starting point 10 and the second starting point 20, and obtaining a first endpoint 1 based on the line; the first endpoint 1 is located on the line or on a first perpendicular line of the line, and the first perpendicular line passes through the first starting point 10; obtaining a second endpoint 2 based on the first endpoint 1; the included angle formed by the second endpoint 2, the first endpoint 1, and the second starting point 20 is a preset angle; based on the above... The second endpoint 2 is used to obtain the third endpoint 3; the third endpoint 3 and the second endpoint 2 are located on the second perpendicular line of the connecting line, and the third endpoint 3 is located on the side of the second endpoint 2 away from the connecting line; the first starting point 10, the first endpoint 1, the second endpoint 2 and the third endpoint 3 are connected in sequence as the first path; the fourth endpoint 4, the fifth endpoint 5 and the sixth endpoint 6 are obtained in sequence based on the connecting line; the second starting point 20, the fourth endpoint 4, the fifth endpoint 5 and the sixth endpoint 6 are connected in sequence as the second path; the second path does not intersect the first path and is axially symmetric about the perpendicular bisector of the connecting line.

[0037] In some specific embodiments, the multiple preset methods include at least one of the following: T-type coupling method, Y-type coupling method and slingshot coupling method; the T-type coupling method includes: taking a non-starting point on the connecting line as the first endpoint 1; the Y-type coupling method includes: taking a first starting point 10 as the first endpoint 1; the slingshot coupling method includes: taking a point on the first vertical line as the first endpoint 1.

[0038] like Figure 2 As shown, in some examples, the Y-shaped coupling method includes: drawing a line connecting the first starting point 10 and the second starting point 20, taking the first starting point 10 as the first endpoint 1; taking the second starting point 20 as the fourth endpoint 4; drawing a first ray through the first endpoint 1 at a 45° angle to the connecting line, and drawing a second ray through the fourth endpoint 4 at a 45° angle to the connecting line, the first ray, the second ray, and the connecting line forming an isosceles right triangle. A first circle centered at the first endpoint 1 intersects the first ray at the second endpoint 2. A second circle centered at the fourth endpoint 4 intersects the second ray at the fifth endpoint 5. The radius of the first circle is the same as the radius of the second circle. Simultaneously translating the second endpoint 2 and the fifth endpoint 5 along a direction perpendicular to the connecting line yields the third endpoint 3 and the sixth endpoint 6.

[0039] like Figure 3 As shown, in other examples, the T-type coupling method includes: obtaining the first endpoint 1 and the fourth endpoint 4 on the connection line; the distance from the first endpoint 1 to the first starting point 10 is equal to the distance from the fourth endpoint 4 to the second starting point 20; the remaining steps are the same as the Y-type coupling method.

[0040] like Figure 4 As shown, in some other examples, the slingshot coupling method includes: synchronously translating the first starting point 10 and the second starting point 20 along a direction perpendicular to the connecting line to obtain the first endpoint 1 and the fourth endpoint 4; the remaining steps are consistent with the Y-type coupling method.

[0041] In some examples, the line width from the first path to the second path is width; when the T-coupling method is used, the distance T_len from the first endpoint to the second endpoint satisfies:

[0042] Where dis is the length of the connection and gap is the coupling spacing.

[0043] In other examples, when the Y-coupled configuration is used, the distance Y_len from the first endpoint to the second endpoint satisfies:

[0044] Where dis is the length of the connection and gap is the coupling spacing.

[0045] In some other examples, when the slingshot-type coupling method is used, the distance E_len from the first endpoint to the second endpoint satisfies:

[0046] Where dis_e is the length of the connection and gap is the coupling spacing.

[0047] It is worth noting that the coupling spacing is the minimum distance from the first path to the second path. In some examples, the coupling spacing is a preset value. In other examples, the coupling spacing is determined based on the target differential impedance. In still other examples, the coupling spacing can be calculated using impedance calculation tools or simulation software.

[0048] In one embodiment, the alternative method includes a starting point L-shaped coupling method and an ending point L-shaped coupling method; the distance between the two ending points in the starting point L-shaped coupling method is defined as a preset coupling spacing; the first endpoint 1, the second endpoint 2, the fourth endpoint 4, and the fifth endpoint 5 of the ending point L-shaped coupling method are determined by the preset method.

[0049] In some specific embodiments, the starting point L-shaped coupling method includes: determining the routing priority based on the geometric relationship between the starting connection points of the two differential routing paths; constructing a polygonal trial area around a preset center point, and generating multiple candidate endpoints within this area; calculating the feasible routing paths from the starting connection point to each candidate endpoint using the shortest path algorithm for each routing path; and selecting the optimal solution from all feasible path combinations as the final routing scheme according to multi-level optimization rules, wherein the multi-level optimization rules include the parallelism of the final routing segment, directional consistency, and total routing length.

[0050] like Figure 5 As shown, in some examples, the L-shaped coupling method at the starting point is triggered when the mouse is not placed on the component. The trace starts from P_start and runs to the mouse position. A regular octagon is drawn with the mouse position as the center. Then, eight iterations are performed: the endpoint N_end_i of the i-th round of N-line is extracted. Lines P and N will be routed to their endpoints using the shortest path algorithm. To prevent the routed line from occupying the routing space of the later routed line, the routing order of lines P and N is determined before routing, as follows: P_start and N_start form a line segment SEG1. A perpendicular bisector PER_L is drawn for SEG1. If the starting and ending points of line P are on the same side of PER_L, then line P is routed first; otherwise, line N is routed first.

[0051] After completing the above eight iterations, the optimal solution is selected according to the following rules: Let the last segments of lines P and N be P_LAST_SEG and N_LAST_SEG, respectively. Let the last points of lines P and N be Pe and Ne, respectively, and the straight line formed by these two points be L_LAST. The preferred solution is one where P_LAST_SEG and N_LAST_SEG are parallel and the distance between them is the user-defined gap. If multiple solutions meet this condition, the solution with the largest total coupling length is selected first. If none of the above conditions exist, the angles angle1 between P_LAST_SEG and L_LAST, and angle2 between N_LAST_SEG and L_LAST are calculated. If the absolute value of the difference between angle1 and angle2 is 0° or 45°, it is considered a secondary choice. If multiple solutions meet this condition, the solution with the shortest bus length is selected first. If neither of the above two conditions exists, the solution with the shortest bus length is selected.

[0052] It's worth noting that other embodiments can construct a regular n-gon centered at the selected location, requiring the same number of iterations, where n is any positive integer greater than 2. The smaller n is, the fewer iterations are needed, which improves processing speed. When n is less than or equal to 8, the larger n is, the more iterations are needed, which helps obtain a more accurate optimal solution.

[0053] In other specific embodiments, the endpoint L-shaped coupling method includes: constructing a polygonal trial area based on the target connection point of any routing path in the differential pair; determining the midpoint of the intersection of the trial area and the line connecting the starting connection point to the target connection point, and extending the direction line to obtain a transition access point; routing from the starting position of the parallel coupling segment to the transition access point; splitting the routing into two parallel routing paths that maintain a preset coupling distance after the access point; performing shortest path routing on the two routing paths respectively, extending them to their respective target connection points; and determining routing priority based on the spatial relative position of the ends of the two routing paths before performing the extension routing to avoid path conflicts.

[0054] like Figure 6 As shown, in some examples, placing the mouse on the component triggers the endpoint L-shaped coupling. If the mouse is placed on P_target, an octagon is constructed with the center of P_target. If the mouse is placed on N_target, an octagon is constructed with the center of N_target.

[0055] Taking the mouse cursor positioned on P_target as an example, connect the center point P of P_start to the center point Pe of P_target to form line segment SEG_se. Calculate the edges where the octagon intersects with SEG_se, and take the midpoint CP. Extend the straight line from Pe to CP to point A, with the extension length being twice the line width. This can be determined by a Y-type coupling method, with coupling paths PVK and NMJ. The midpoint of K and J is the starting point of the parallel coupled routing, start. Use the shortest path method to route a line from start to point A. Then, split the routing into two parallel and coupled lines, with endpoints Plast and Nlast, respectively. Subsequently, use the shortest path algorithm to route Plast around Pe to form line segment L1, and Nlast around Ne to form line segment L2. To prevent the first line from occupying the routing space of the second line, the routing order of P and N lines is determined as follows before routing: Plast and Nlast form a line segment SEG2. Draw the perpendicular bisector PER_L2 of SEG2. If Plast and Pe are on the same side of PER_L2, then L1 is routed first; otherwise, L2 is routed first.

[0056] In one embodiment, the wiring process further includes: calculating the length difference between the first wiring path and the second wiring path; when the length difference exceeds a preset length threshold, identifying the longer wiring path and outputting a prompt message.

[0057] In some specific embodiments, the length difference between the first and second routing paths is calculated in real time. This length difference refers to the difference in the actual geometric path length of the two signal lines from their respective starting points to the current routing endpoint, and is an important parameter affecting the timing matching and signal integrity of differential signals. The system compares the calculated length difference with a user-preset length threshold, which can be set as a fixed value or an allowable deviation range, such as ±5mil or ±10mil, according to design requirements. When the length difference exceeds the preset threshold, the system automatically identifies and marks the longer routing path. The marking method may include highlighting the path in the graphical user interface with a bright color, flashing border, bold line, or label. At the same time, the system outputs a prompt message, which can be presented through pop-ups, status bar messages, or log records, and the content includes, but is not limited to, specific explanations such as "P line is 5mil longer than N line" and "Differential pair length mismatch, please adjust the routing." This mechanism allows users to promptly identify length deviation issues, facilitating proactive intervention or adjustments to wiring strategies during the cabling process. This effectively ensures the equal length matching requirements of differential pairs, enhancing the stability and reliability of high-speed signal transmission.

[0058] like Figure 7As shown, according to a second embodiment of the present invention, a differential pair line coupling device 30 is provided to implement the method described in any one of the above embodiments, comprising: a layout analysis module 31, used to determine the start and end points of the differential pair based on the layout positions of at least two components; a path planning module 32, used to generate two routing paths sequentially using multiple preset methods during the routing process; a constraint checking module 33, used to determine whether the routing paths generated by each preset method meet the routing constraints, the routing constraints including: the routing paths do not collide with other components, and the start and end point distances of the two routing paths both meet the safety distance; a preset path generation module 34, used to generate two corresponding routing paths when the current preset method meets the routing constraints; a backup path generation module 35, used to activate a backup method and generate two routing paths through spatial probing and the shortest path algorithm when all preset methods do not meet the routing constraints; and an optimal decision module 36, used to select the optimal solution from all candidate paths as the final routing path based on multi-level optimization rules.

[0059] A third embodiment provides an electronic device, including a memory and a processor, wherein the memory is used to store a computer program executable by the processor; and the processor is used to execute the computer program in the memory to implement the method described in any of the above embodiments.

[0060] Figure 8 This is a block diagram illustrating an electronic device according to an exemplary embodiment. For example, electronic device 900 may be provided as a server. (Refer to...) Figure 3 The electronic device 900 includes a processing component 922, which further includes one or more processors, and memory resources represented by memory 932 for storing instructions, such as application programs, that can be executed by the processing component 922. The application programs stored in memory 932 may include one or more modules, each corresponding to a set of instructions. Furthermore, the processing component 922 is configured to execute instructions to perform the methods described above.

[0061] Electronic device 900 may also include a power supply component 926 configured to perform power management of electronic device 900, a wired or wireless network interface 950 configured to connect electronic device 900 to a network, and an input / output (I / O) interface 958. Electronic device 900 may operate on an operating system stored in memory 932, such as Windows Server™, MacOS X™, Unix™, Linux™, FreeBSD™, or similar.

[0062] In an exemplary embodiment, a non-transitory computer-readable storage medium including instructions is also provided, such as a memory 932 including instructions, which can be executed by a processing component 922 of an electronic device 900 to perform the above-described method. For example, the non-transitory computer-readable storage medium may be a ROM, random access memory (RAM), CD-ROM, magnetic tape, floppy disk, and optical data storage device.

[0063] In an exemplary embodiment, a non-transitory computer-readable storage medium including instructions is also provided, such as a memory 932 including instructions, which can be executed by a processing component 922 of the device 900 to perform the above-described method. For example, the non-transitory computer-readable storage medium may be a ROM, random access memory (RAM), CD-ROM, magnetic tape, floppy disk, and optical data storage device.

[0064] The fourth embodiment provides a readable storage medium storing a program, which, when executed, implements the method described in any one of the above embodiments.

[0065] The fifth embodiment provides a computer program product, including a computer program, which, when executed, implements the method described in any one of the above embodiments.

[0066] In this invention, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance. The term "multiple" refers to two or more unless otherwise expressly defined.

[0067] The above description of the embodiments is intended to enable those skilled in the art to understand and apply the present invention. It will be apparent to those skilled in the art that various modifications can be made to these embodiments, and the general principles described herein can be applied to other embodiments without creative effort. Therefore, the present invention is not limited to the embodiments described herein, and any improvements and modifications made by those skilled in the art based on the disclosure of the present invention without departing from the scope and spirit of the invention are within the scope of the present invention.

Claims

1. A differential pair line coupling method, characterized in that, include: During the routing of differential pairs, based on the layout positions of at least two components, two routing paths are planned sequentially using various preset methods; Each path has its own start and end point; For each preset method, determine whether its planned wiring path meets the wiring constraints. The wiring constraints include: the routing path does not collide with other components, and the distance between the starting points of the two routing paths and the distance between the ending points of the two routing paths both meet the safety distance requirements. When the current preset method satisfies the routing constraints, the two routing paths are generated; when none of the preset methods satisfy the routing constraints, the backup method based on spatial probing and the shortest path algorithm is used to generate the two routing paths. The alternative method includes: constructing a geometric region based on at least one target connection point, and generating multiple candidate connection points based on the geometric region; calculating a detour path from the starting point to each candidate point using a shortest path algorithm; determining the order of the two detour paths based on the spatial relative relationship between the starting and ending points of the two detour paths; and selecting the optimal solution from all detour paths as the final routing path based on a multi-level optimization rule; the multi-level optimization rule includes at least one of the following: total routing length, parallelism of the final routing segment, and directional consistency.

2. The method according to claim 1, characterized in that, The two routing paths are the first path and the second path; the starting point of the first path is the first starting point, and the starting point of the second path is the second starting point; The various preset methods include: drawing a line connecting a first starting point and a second starting point; obtaining a first endpoint based on the line; the first endpoint is located on the line or on a first perpendicular line of the line, and the first perpendicular line passes through the first starting point; obtaining a second endpoint based on the first endpoint; the included angle formed by the second endpoint, the first endpoint, and the second starting point is a preset angle; obtaining a third endpoint based on the second endpoint; the third endpoint and the second endpoint are located on a second perpendicular line of the line, and the third endpoint is located on the side of the second endpoint away from the line; sequentially connecting the first starting point, the first endpoint, the second endpoint, and the third endpoint as a first path; Based on the connection line, the fourth endpoint, the fifth endpoint, and the sixth endpoint are obtained sequentially; the second starting point, the fourth endpoint, the fifth endpoint, and the sixth endpoint are connected in sequence to form the second path; the second path does not intersect the first path and is axially symmetric about the perpendicular bisector of the connection line.

3. The method according to claim 2, characterized in that, The various preset methods include at least one of the following: T-type coupling, Y-type coupling, and slingshot coupling. The T-type coupling method includes: taking the non-starting point on the connecting line as the first endpoint; The Y-type coupling method includes: taking the first starting point as the first endpoint; The slingshot-type coupling method includes taking a point on the first vertical line as the first endpoint.

4. The method according to claim 3, characterized in that, The line width of both the first path and the second path is width; when the T-coupling method is used, the distance T_len from the first endpoint to the second endpoint satisfies: Where dis is the length of the connection and gap is the coupling spacing.

5. The method according to claim 3, characterized in that, When the Y-type coupling method is adopted, the distance Y_len from the first endpoint to the second endpoint satisfies: Where dis is the length of the connection and gap is the coupling spacing.

6. The method according to claim 3, characterized in that, When the slingshot-type coupling method is used, the distance E_len from the first endpoint to the second endpoint satisfies: Where dis_e is the length of the connection and gap is the coupling spacing.

7. The method according to claim 2, characterized in that, The backup methods include a starting point L-shaped coupling method and an ending point L-shaped coupling method; In the L-shaped coupling method at the starting point, the distance between the two endpoints is defined as the preset coupling spacing; The first, second, fourth, and fifth endpoints of the L-shaped coupling method are determined by the preset method.

8. The method according to claim 7, characterized in that, The starting point L-shaped coupling method includes: Based on the geometric relationship between the starting connection points of the two differential routing paths, the routing priority is determined; Construct a polygonal exploration region around a preset center point, and generate multiple candidate endpoints within this region; For each path, the shortest path algorithm is used to calculate the traversable paths from the starting connection point to each candidate endpoint. According to the multi-level optimization rules, the optimal solution is selected from all feasible path combinations as the final routing scheme. The multi-level optimization rules include the parallelism of the final routing segment, the consistency of direction, and the total routing length.

9. The method according to claim 2, characterized in that, The endpoint L-shaped coupling method includes: Using the target connection point of any trace path in the differential pair as a reference, construct a polygonal exploration area; Determine the midpoint of the intersection between the test area and the line connecting the starting connection point to the target connection point, and extend this direction line to obtain the transition access point; Run the cable from the starting position of the parallel coupling segment to this transition access point; After this access point, the routing path is split into two parallel paths that maintain a preset coupling distance. Perform shortest path routing on each of the two routing paths, extending them to their respective target connection points; Before extending the cabling, determine the cabling priority based on the spatial relationship between the ends of the two cabling paths to avoid path conflicts.

10. The method according to claim 2, characterized in that, The wiring process also includes: Calculate the length difference between the first routing path and the second routing path; When the length difference exceeds a preset length threshold, the longer routing path is identified and a prompt message is output.

11. A differential pair line coupling device for implementing the method according to any one of claims 1 to 10, characterized in that, include: The layout analysis module is used to determine the start and end points of a differential pair based on the layout positions of at least two components. The path planning module is used to generate two routing paths sequentially using multiple preset methods during the wiring process; The constraint checking module is used to determine whether the routing path generated by each preset method meets the routing constraint conditions. The routing constraint conditions include: the routing path does not collide with other components, and the starting distance and ending distance of the two routing paths meet the safety distance. The preset path generation module is used to generate two corresponding routing paths when the current preset method meets the routing constraints. The backup path generation module is used to activate the backup method when all preset methods fail to meet the routing constraints. It generates two routing paths through space exploration and the shortest path algorithm. The optimal decision-making module is used to select the optimal solution from all candidate paths as the final routing path based on multi-level optimization rules.

12. An electronic device, characterized in that, The method includes a memory and a processor, the memory being used to store a computer program executable by the processor; the processor being used to execute the computer program in the memory to implement the method as described in any one of claims 1 to 10.

13. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the executable computer program in the storage medium is executed by a processor, it can implement the method as described in any one of claims 1 to 10.

14. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by a processor, it implements the method as described in any one of claims 1 to 10.

Images