PCB circuit connection method and device

Abstract

The invention relates to the technical field of PCB lines, and discloses a PCB line connection method and device, and the method comprises the steps: obtaining a plurality of PCB lines, and removing the miscellaneous lines in the plurality of PCB lines; the various PCB lines after the miscellaneous lines are removed are connected; searching a trunk path from the plurality of connected PCB lines by using a tree-shaped recursion search algorithm; and verifying the trunk path. Therefore, according to whether the target distance between the end point of the bonding pad and the position of the current node is within the preset range or not, the target path is determined, the accuracy of PCB manufacturing is improved, human intervention is reduced, the manufacturing efficiency is improved, and mistaken quantification of PCB via holes and mistaken selection of Pad positions are prevented.

Description

Technical Field

[0001] The present invention relates to the technical field of printed circuit board (PCB) circuits, and in particular to a PCB circuit connection method and device. Background Art

[0002] In related technologies, the connectivity design of PCB circuits is generally performed through manual observation or manual screening to determine whether there are vias or pads in fixed areas. However, manual screening methods are prone to omissions and do not quantify the positions of holes and pads, making it impossible to accurately remove miscellaneous wires from PCB circuits. Summary of the Invention

[0003] In view of this, the present invention provides a PCB circuit connection method to solve the problem that the presence of vias and pads in a fixed area is manually screened out, but the miscellaneous wires in the PCB circuit cannot be accurately removed.

[0004] In a first aspect, the present invention provides a PCB circuit connection method, the method comprising:

[0005] Get a variety of PCB circuits;

[0006] Eliminate miscellaneous wires from various PCB circuits;

[0007] Connect various PCB circuits after removing the miscellaneous lines;

[0008] From the connected PCB circuits, a tree-like recursive search algorithm is used to find the main path;

[0009] Verify the backbone path.

[0010] The present invention determines the target path based on whether the target distance between the pad endpoint and the current node position is within a preset range, thereby improving the accuracy of PCB production, reducing human intervention, improving production efficiency, and preventing incorrect quantization of PCB vias and incorrect selection of pad positions.

[0011] In some optional implementations, a tree-like recursive search algorithm is used to search for a trunk path from the connected multiple PCB circuits, including:

[0012] Pre-process the connected PCB circuits to extract the line structure;

[0013] Use the pad endpoint as the starting point of the line structure;

[0014] Starting from the current node, search for paths along different directions of the current node, with the current node being the child node of the starting point;

[0015] At the current node and multiple bifurcation points other than the pad endpoint, calculate the length between each bifurcation point and the current node;

[0016] From the lengths between each bifurcation point and the current node, select the longest path as the trunk path, and eliminate the bifurcation paths between other bifurcation points and the current node;

[0017] When a closed path is encountered during the path search, the search recursion ends.

[0018] The present invention searches for the trunk path through a tree-like recursive search algorithm in order to accurately find the trunk path.

[0019] In some optional implementations, connecting the removed miscellaneous lines from the various PCB circuits includes:

[0020] Based on pads, holes and various PCB circuits, various PCB circuits are connected through a tree-like interconnection algorithm.

[0021] The present invention connects multiple PCB circuits in order to accurately manufacture PCB circuits.

[0022] In some optional implementations, verifying the trunk path includes:

[0023] Get the current node location;

[0024] Calculate the target distance between the pad endpoint and the current node location;

[0025] Verify whether the target distance between the pad endpoint and the current node location is within the preset range;

[0026] If not, the trunk path is determined to be the target path;

[0027] If so, the trunk path is determined to be the target path but failed.

[0028] The present invention verifies the trunk path to ensure the accuracy of manufacturing PCB line segments.

[0029] In some optional implementations, the preset range is determined by the following steps:

[0030] Calculate the actual length of the target path based on the linked list and length of each line segment in the target path;

[0031] The preset range is determined based on the actual length of the target path.

[0032] The present invention determines a preset range in order to accurately determine the trunk path.

[0033] In some optional implementations, the multiple PCB circuits include: parallel circuits, closed area combination circuits, and closed combination circuits.

[0034] The present invention divides the PCB circuit into multiple circuits, which is conducive to accurately manufacturing the PCB circuit and reducing the subsequent PCB manufacturing time.

[0035] In a second aspect, the present invention provides a PCB circuit connection device, the device comprising:

[0036] Acquisition module, used to obtain various PCB circuits;

[0037] Removal module, used to remove miscellaneous wires from various PCB circuits;

[0038] Connect various PCB circuits after removing the miscellaneous lines;

[0039] A search module is used to find the main path from the connected multiple PCB circuits using a tree-like recursive search algorithm;

[0040] The verification module is used to verify the trunk path and use the trunk path that passes the verification as the target path.

[0041] In a third aspect, the present invention provides a computer device comprising: a memory and a processor, the memory and the processor being communicatively connected to each other, the memory storing computer instructions, and the processor executing the computer instructions to thereby execute the PCB circuit connectivity method of the first aspect or any corresponding embodiment thereof.

[0042] In a fourth aspect, the present invention provides a computer-readable storage medium having computer instructions stored thereon, the computer instructions being used to enable a computer to execute the PCB circuit connection method of the first aspect or any corresponding embodiment thereof.

[0043] In a fifth aspect, the present invention provides a computer program product, comprising computer instructions, which are used to enable a computer to execute the PCB circuit connection method of the above-mentioned first aspect or any corresponding embodiment thereof. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] In order to more clearly illustrate the specific embodiments of the present invention or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the specific embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0045] Figure 1 is a schematic flow chart of a PCB circuit connection method according to an embodiment of the present invention;

[0046] Figure 2is a schematic diagram of parallel circuits according to an embodiment of the present invention;

[0047] Figure 3 is a schematic diagram of a closed area combination circuit according to an embodiment of the present invention;

[0048] Figure 4 is a schematic diagram of a closed combination circuit according to an embodiment of the present invention;

[0049] Figure 5 is a schematic diagram of parallel lines after elimination according to an embodiment of the present invention;

[0050] Figure 6 is a schematic diagram of a closed area combination circuit after elimination according to an embodiment of the present invention;

[0051] Figure 7 is a schematic diagram of a closed combination circuit after elimination according to an embodiment of the present invention;

[0052] Figure 8 is an original schematic diagram of a PCB circuit according to an embodiment of the present invention;

[0053] Figure 9 is a schematic diagram of a connected PCB circuit according to an embodiment of the present invention;

[0054] Figure 10 is a structural block diagram of a PCB circuit connection device according to an embodiment of the present invention;

[0055] Figure 11 2 is a schematic diagram of the hardware structure of a computer device according to an embodiment of the present invention. DETAILED DESCRIPTION

[0056] To make the purpose, technical solutions, and advantages of the embodiments of the present invention more clear, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without making creative efforts shall fall within the scope of protection of the present invention.

[0057] In this embodiment, a PCB circuit connection method is provided, which can be used for computer devices such as mobile phones, tablet computers, desktop computers, portable notebooks, servers, etc. Figure 1 FIG. 1 is a flow chart of a PCB circuit connection method according to an embodiment of the present invention. Figure 1 As shown, the process includes the following steps:

[0058] Step S101: Acquire multiple PCB circuits.

[0059] In a specific example, the various PCB circuits include parallel circuits, closed area combination circuits, and closed combination circuits.

[0060] like Figure 2 As shown in the figure, it is a schematic diagram of parallel lines. Figure 3 As shown in Figure 1, it is a schematic diagram of the closed area combination circuit. Figure 4 The figure shows a schematic diagram of a closed combination circuit.

[0061] There are some miscellaneous lines in the schematic diagrams of parallel lines, closed area combined lines, and closed combined lines. The method in the implementation of the present disclosure needs to remove these miscellaneous lines.

[0062] Step S102: removing miscellaneous lines from various PCB circuits.

[0063] For example, for parallel lines, Figure 2 In the process, the existence of parallel lines is determined based on the line length, and the miscellaneous lines of the small parallel lines are eliminated, and then the miscellaneous lines of the entire PCB circuit board including the small parallel lines are further eliminated. Figure 3 In the example, for closed area combined lines, the common starting area of ​​the stray lines, such as the V-shaped line, is removed, and then the stray lines of the entire PCB circuit board are further removed. In the embodiment of the present disclosure, the purpose of removing stray lines from multiple PCB circuits is to find the main path.

[0064] Because there are overlapping, crossing, disconnected and unconnected segments, closed overlapping, open overlapping segments, and similar segments at close distances in the PCB segments, the ultimate goal is to find the main path.

[0065] Therefore, removing the miscellaneous wires from various PCB circuits is beneficial to the subsequent simplification of PCB circuits, reducing PCB production time, and improving the accuracy of PCB production.

[0066] like Figure 5 As shown in the figure, it is a schematic diagram of parallel lines after removing the miscellaneous lines. Figure 6 As shown in the figure, it is a schematic diagram of the closed area combination circuit after elimination, as shown in the figure. Figure 7 , which is a schematic diagram of the closed combination circuit after elimination.

[0067] Step S103 , connecting the various PCB circuits after removing the miscellaneous lines.

[0068] Specifically, connectivity refers to forming a conductive path between two or more nodes through component pins, pads, copper foil, vias or plug-ins, so that signals or currents can be connected.

[0069] like Figure 8 As shown, this is the original schematic diagram of the PCB circuit, such as Figure 9 Figure 2 shows the schematic diagram of the connected PCB circuit.

[0070] Step S104: searching for a trunk path from the connected PCB circuits using a tree-like recursive search algorithm.

[0071] The tree recursive search algorithm is a common method for searching in a tree data structure. It finds the trunk path by recursively traversing the nodes of the tree.

[0072] In some optional implementations, a tree-like recursive search algorithm is used to search for a trunk path from the connected multiple PCB circuits, including:

[0073] Step a1: pre-processing the connected multiple PCB circuits to extract the line structure.

[0074] Step a2: Use the pad endpoint as the starting point of the line structure.

[0075] Step a3: Starting from the current node, search for paths along different directions of the current node, with the current node being a child node of the starting point.

[0076] Step a4: At the current node and multiple bifurcation points other than the pad endpoint, calculate the length between each bifurcation point and the current node.

[0077] Step a5: Select the longest path from the lengths between each bifurcation point and the current node as the trunk path, and eliminate the bifurcation paths between other bifurcation points and the current node.

[0078] Step a6: During the path search process, when a closed path is encountered, the search recursion is terminated.

[0079] The embodiment of the present disclosure uses the above steps a1 to a6 to accurately find the trunk path.

[0080] Step S105: verify the trunk path.

[0081] In a specific example, the verification backbone path includes:

[0082] Step b1, obtain the location of the current node.

[0083] The current node represents a pad point in the PCB circuit, and the location of the current node can be coordinate information.

[0084] Step b2, calculating the target distance between the pad endpoint and the current node location.

[0085] The target distance between the pad endpoint and the current node position represents the length between the pad endpoint and the current node.

[0086] Step b3: Verify whether the target distance between the pad endpoint and the current node location is within a preset range.

[0087] In a specific example, the preset range is determined by the following steps:

[0088] Step c1, calculating the actual length of the target path according to the linked list and length of each line segment in the target path.

[0089] Step c2: Determine the preset range based on the actual length of the target path.

[0090] For example, the actual length of the target path is L, and the preset range may be 30% L-70% L.

[0091] Therefore, for example, the target distance between the pad endpoint and the current node location is represented by A, and the preset range may be 30% L-70% L.

[0092] Step b4: If not, determine the trunk path as the target path.

[0093] Since the preset range is 30% L-70% L, the target distance between the pad endpoint and the current node position is not within the preset range 30% L-70% L, and the trunk path is considered to be the target path.

[0094] Step b5: If yes, determining that the trunk path is the target path fails.

[0095] For example, if the target distance between the pad endpoint and the current node is within 30% L-70% L, the trunk path will fail to be determined as the target path because pads are not allowed within the range of 30% L-70% L.

[0096] Therefore, the PCB circuit connection method in the embodiment of the present disclosure determines the target path based on whether the target distance between the pad endpoint and the current node position is within a set preset range, thereby improving the accuracy of PCB production, reducing human intervention, and improving production efficiency.

[0097] This embodiment also provides a PCB circuit connection device, which is used to implement the above-mentioned embodiments and preferred embodiments. Details already described will not be repeated here. As used below, the term "module" may refer to a combination of software and / or hardware that implements a predetermined function. Although the devices described in the following embodiments are preferably implemented in software, implementation using hardware, or a combination of software and hardware, is also possible and contemplated.

[0098] This embodiment provides a PCB circuit connection device, such as Figure 10 Shown, including:

[0099] An acquisition module 1001 is used to acquire multiple PCB circuits;

[0100] The removal module 1002 is used to remove miscellaneous wires from various PCB circuits;

[0101] A connection module 1003 is used to connect various PCB circuits after removing the miscellaneous lines;

[0102] A search module 1004 is configured to search for a trunk path from the connected PCB circuits using a tree-like recursive search algorithm;

[0103] The verification module 1005 is used to verify the trunk path and use the trunk path that passes the verification as the target path.

[0104] In some optional implementations, the communication module 1003 includes:

[0105] The extraction submodule is used to pre-process the connected PCB circuits to extract the line structure;

[0106] Determine a submodule for using the pad endpoint as a starting point of a line structure;

[0107] The search submodule is used to search for paths starting from the current node and along different directions of the current node, with the current node being a child node of the starting point;

[0108] A calculation submodule, for calculating the length between the current node and each of the multiple bifurcation points other than the pad endpoint;

[0109] The selection submodule is used to select the longest path from the length between each bifurcation point and the current node as the trunk path, and eliminate the bifurcation paths between other bifurcation points and the current node;

[0110] The terminator module is used to end the search recursion when a closed path is encountered during the path search process.

[0111] In some optional implementations, the communication module 1003 includes:

[0112] The connectivity submodule is used to connect various PCB circuits through a tree-like connectivity algorithm based on pads, holes and various PCB circuits.

[0113] In some optional implementations, the verification module 1005 includes:

[0114] The first acquisition submodule is used to obtain the location of the current node;

[0115] The data calculation submodule is used to calculate the target distance between the pad endpoint and the current node location;

[0116] The data verification submodule is used to verify whether the target distance between the pad endpoint and the current node location is within a preset range;

[0117] A first determining submodule is used to determine that the trunk path is the target path if no;

[0118] The second determining submodule is configured to, if yes, determine that the trunk path fails to be the target path.

[0119] In some optional implementations, the preset range is determined by the following modules:

[0120] The calculation submodule is used to calculate the actual length of the target path based on the linked list and length of each line segment in the target path;

[0121] The determination submodule is used to determine the preset range according to the actual length of the target path.

[0122] In some optional implementations, the various PCB circuits include parallel circuits, closed area combination circuits, and closed combination circuits.

[0123] The further functional description of each of the above modules and units is the same as that of the above corresponding embodiments and will not be repeated here.

[0124] The PCB circuit connection device in this embodiment is presented in the form of a functional unit, where the unit refers to an ASIC (Application Specific Integrated Circuit) circuit, a processor and memory that executes one or more software or fixed programs, and / or other devices that can provide the above functions.

[0125] An embodiment of the present invention further provides a computer device having the PCB circuit connection device shown above.

[0126] See also Figure 11 , Figure 11 is a structural diagram of a computer device provided by an optional embodiment of the present invention, such as Figure 11As shown, the computer device includes: one or more processors 10, memory 20, and interfaces for connecting various components, including high-speed interfaces and low-speed interfaces. Various components utilize different buses to communicate with each other and can be installed on a common mainboard or installed in other ways as needed. The processor can process the instructions executed in the computer device, including instructions stored in the memory or on the memory to display the graphical information of the GUI on an external input / output device (such as, a display device coupled to the interface). In some optional embodiments, if necessary, multiple processors and / or multiple buses can be used together with multiple memories and multiple memories. Equally, multiple computer devices can be connected, and each device provides part of the necessary operations (for example, as a server array, a group of blade servers, or a multi-processor system). Figure 11 A processor 10 is taken as an example.

[0127] The processor 10 may be a central processing unit, a network processor, or a combination thereof. The processor 10 may further include a hardware chip. The hardware chip may be an application-specific integrated circuit, a programmable logic device, or a combination thereof. The programmable logic device may be a complex programmable logic device, a field programmable gate array, a general purpose array logic, or any combination thereof.

[0128] The memory 20 stores instructions that can be executed by at least one processor 10, so that the at least one processor 10 executes the method shown in the above embodiment.

[0129] The memory 20 may include a program storage area and a data storage area, wherein the program storage area may store an operating system and application programs required for at least one function; the data storage area may store data created based on the use of the computer device, etc. In addition, the memory 20 may include a high-speed random access memory, and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage device. In some optional embodiments, the memory 20 may optionally include a memory remotely located relative to the processor 10, and these remote memories may be connected to the computer device via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0130] The memory 20 may include a volatile memory, such as a random access memory; the memory may also include a non-volatile memory, such as a flash memory, a hard disk or a solid-state drive; the memory 20 may also include a combination of the above types of memory.

[0131] The computer device further includes a communication interface 30 for the computer device to communicate with other devices or a communication network.

[0132] The embodiment of the present invention also provides a computer-readable storage medium. The above-mentioned method according to the embodiment of the present invention can be implemented in hardware, firmware, or implemented as a computer code that can be recorded in a storage medium, or implemented as a computer code that is originally stored in a remote storage medium or a non-temporary machine-readable storage medium and downloaded through a network and will be stored in a local storage medium, so that the method described herein can be stored in such software processing on a storage medium using a general-purpose computer, a dedicated processor, or programmable or dedicated hardware. Among them, the storage medium can be a magnetic disk, an optical disk, a read-only storage memory, a random access memory, a flash memory, a hard disk or a solid-state drive, etc.; further, the storage medium can also include a combination of the above-mentioned types of memory. It can be understood that a computer, a processor, a microprocessor controller or programmable hardware includes a storage component that can store or receive software or computer code. When the software or computer code is accessed and executed by a computer, a processor or hardware, the method shown in the above embodiment is implemented.

[0133] A portion of the present invention may be applied as a computer program product, such as a computer program instruction, which, when executed by a computer, can call or provide the method and / or technical solution according to the present invention through the operation of the computer. Those skilled in the art should understand that the form in which the computer program instruction exists in a computer-readable medium includes, but is not limited to, a source file, an executable file, an installation package file, etc. Accordingly, the way in which the computer program instruction is executed by the computer includes, but is not limited to: the computer directly executes the instruction, or the computer compiles the instruction and then executes the corresponding compiled program, or the computer reads and executes the instruction, or the computer reads and installs the instruction and then executes the corresponding installed program. Here, the computer-readable medium may be any available computer-readable storage medium or communication medium that can be accessed by the computer.

[0134] Although the embodiments of the present invention have been described with reference to the accompanying drawings, those skilled in the art may make various modifications and variations without departing from the spirit and scope of the present invention. Such modifications and variations are all within the scope defined by the appended claims.

Claims

1. A PCB circuit connection method, characterized in that: The method comprises: Get a variety of PCB circuits; Eliminating miscellaneous wires from the various PCB circuits; Connecting the multiple PCB circuits after removing the miscellaneous lines; Finding a trunk path from the connected multiple PCB circuits using a tree-like recursive search algorithm; Verify the backbone path.

2. The PCB circuit connection method according to claim 1, characterized in that: From the connected PCB circuits, a trunk path is found using a tree-like recursive search algorithm, including: Preprocessing the connected multiple PCB circuits to extract line structures; Taking the pad endpoint as the starting point of the line structure; Starting from the current node, search for paths along different directions of the current node, where the current node is a child node of the starting point; At the current node and a plurality of bifurcation points other than the pad endpoint, calculating the length between each bifurcation point and the current node; From the lengths between each bifurcation point and the current node, select the longest path as the trunk path, and eliminate the bifurcation paths between other bifurcation points and the current node; When a closed path is encountered during the path search, the search recursion ends.

3. The PCB circuit connection method according to claim 1, characterized in that: Connecting the removed miscellaneous lines in the plurality of PCB circuits includes: According to the pads, holes and the multiple PCB circuits, the multiple PCB circuits are connected through a tree-like connection algorithm.

4. The PCB circuit connection method according to claim 2, characterized in that: Verifying the backbone path includes: Get the location of the current node; Calculating the target distance between the pad endpoint and the current node position; Verify whether the target distance between the pad endpoint and the current node position is within a preset range; If not, determining the trunk path as the target path; If so, determining that the trunk path is the target path fails.

5. The PCB circuit connection method according to claim 4, characterized in that: The preset range is determined by the following steps: Calculating the actual length of the target path according to the linked list and length of each line segment in the target path; The preset range is determined according to the actual length of the target path.

6. The PCB circuit connection method according to any one of claims 1 to 4, characterized in that: The various PCB circuits include: parallel circuits, closed area combination circuits and closed combination circuits.

7. A PCB circuit connection device, characterized in that: The device comprises: Acquisition module, used to obtain various PCB circuits; A rejection module, used to remove miscellaneous wires from the multiple PCB circuits; Connecting the multiple PCB circuits after removing the miscellaneous lines; A search module, configured to search for a trunk path from the connected plurality of PCB circuits using a tree-like recursive search algorithm; The verification module is used to verify the trunk path and use the trunk path that passes the verification as the target path.

8. A computer device, characterized in that: include: A memory and a processor, wherein the memory and the processor are communicatively connected to each other, the memory stores computer instructions, and the processor executes the PCB circuit connection method according to any one of claims 1 to 6 by executing the computer instructions.

9. A computer-readable storage medium, characterized in that The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a computer to execute the PCB circuit connection method according to any one of claims 1 to 6.

10. A computer program product, characterized in that The method comprises computer instructions, wherein the computer instructions are used to enable a computer to execute the PCB circuit connection method according to any one of claims 1 to 6.

Images