A chip search method and system based on binary direction priority

Abstract

The present invention relates to a chip search method and system based on binary direction priority, the method comprising: determining multiple candidate search directions according to two reference search directions and their corresponding reverse directions, and setting their priorities; from the candidate search directions of the chips in the previous search point, using the search direction with the highest priority as the main candidate search direction of the current search point; determining a memory point according to the change of the main candidate search direction of the current search point, and using the diagonal direction of the memory point or the current search point as one or more secondary candidate search directions when there is no chip in the candidate search direction; searching for chips according to the main candidate search direction or the secondary candidate search direction of the current search point until all chips are traversed. The present invention can search for elements with only two search directions under normal circumstances, thereby improving the search efficiency; while traversing all elements, it ensures that the search path is relatively simple.

Description

Technical Field

[0001] The present invention belongs to the technical field of chip packaging, and in particular relates to a chip search method and system based on binary direction priority. Background Art

[0002] In the manufacturing process of electronic packaging, global search or traversal of elements such as wafers or chips is often involved, such as detection, sorting, and die bonding. If you want to traverse and search the neatly arranged element array (such as Figure 1 As shown in the figure, the existing methods generally start from any starting point, use a camera to take a real-time photo of the current local element, and use image recognition to search for other elements around the current position element at the same time, and then determine the position of the next search element in sequence according to the specified priority order. This method requires visual calculation of the positions of adjacent elements in at least four directions (i.e., four-element directions, such as +X, -X, +Y, -Y) before confirming the next position, and then directly matches the position of the next search element according to the priority of the four directions. In the process of high-speed real-time processing, it will occupy a large computational overhead, thereby affecting the overall search speed, and there is a large amount of invalid search information. In addition, in order to ensure the globality of the search in the existing methods, a memory point function is set, that is, when starting to search in two negative directions (e.g., -X, -Y), the position information of the nearest element in the corresponding positive direction (i.e., +X, +Y) is memorized, and the search jumps to the memory point after there is no chip in the opposite direction. However, this function starts searching from the middle starting point, and the first row of chips is missing (such as Figure 2 In some cases, the search route may be too complicated, which may even affect the integrity of the search or require too much manual intervention and guidance, which may also affect the search efficiency and effect. Summary of the invention

[0003] In order to solve the problems of low efficiency and search missing of wafer or chip traversal search methods in the existing chip packaging process, a chip search method based on binary direction priority is provided in the first aspect of the present invention, which determines multiple candidate search directions according to two reference search directions and their corresponding reverse directions, and sets their priorities; from the candidate search directions of the existing chips at the previous search point, the search direction with the highest priority is used as the main candidate search direction of the current search point; a memory point is determined according to the change of the main candidate search direction of the current search point, and the diagonal direction of the memory point or the current search point is used as one or more secondary candidate search directions when there is no chip in the candidate search direction; and the chip is searched according to the main candidate search direction or the secondary candidate search direction of the current search point until all chips are traversed.

[0004] The second aspect of the present invention provides a chip search system based on binary direction priority, including: a first determination module, used to determine multiple candidate search directions based on two reference search directions and their corresponding reverse directions, and set their priorities; from the candidate search directions of the existing chips at the previous search point, the search direction with the highest priority is used as the main candidate search direction of the current search point; a second determination module is used to determine the memory point according to the change of the main candidate search direction of the current search point, and use the diagonal direction of the memory point or the current search point as one or more secondary candidate search directions when there is no chip in the candidate search direction; a traversal module is used to search for chips according to the main candidate search direction or the secondary candidate search direction of the current search point until all chips are traversed.

[0005] The third aspect of the present invention provides an electronic device, comprising: one or more processors; a storage device for storing one or more programs, when the one or more programs are executed by the one or more processors, the one or more processors implement the chip search method based on binary direction priority provided in the first aspect of the present invention.

[0006] A fourth aspect of the present invention provides a computer-readable medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the chip search method based on binary direction priority provided in the first aspect of the present invention is implemented.

[0007] The beneficial effects of the present invention are:

[0008] 1. Under normal circumstances, each point only needs the image recognition system to identify and search in two directions, so the speed of searching elements can be guaranteed to be fast. Only in a few cases does it need to search in multiple directions, resulting in a slightly slower speed (such as when searching for element wrapping, when searching in the opposite direction of a certain arrow, etc.);

[0009] 2. Ensure that under normal circumstances, all elements in the element array are traversed, and the search path is simple and efficient compared to traditional search methods. BRIEF DESCRIPTION OF THE DRAWINGS

[0010] Figure 1 A basic flow chart of a method for minimizing the road network data range of an electronic horizon in some embodiments of the present invention;

[0011] Figure 2 is a schematic diagram of an array of neatly arranged elements in some embodiments of the present invention;

[0012] Figure 3 A schematic diagram of an array of elements that may be problematic to search using existing methods in some embodiments of the present invention;

[0013] Figure 4A schematic diagram of searching a certain position on a blue film of a wafer in some embodiments of the present invention;

[0014] Figure 5 A schematic diagram of the priority of each arrow direction in some embodiments of the present invention;

[0015] Figure 6 is a search flow chart when a certain search point is in a blue positive state in some embodiments of the present invention;

[0016] Figure 7 A search flow chart when a certain search point is in a red positive state in some embodiments of the present invention

[0017] Figure 8 A search flow chart when a certain search point is in a red reverse state in some embodiments of the present invention

[0018] Fig. 9 FIG. 1 is a search flow chart when a certain search point is in a blue reverse state in some embodiments of the present invention.

[0019] Fig.10 A search flow chart when a certain search point is a starting point in some embodiments of the present invention

[0020] Fig.11 A schematic diagram of a path for searching a wafer using a wafer search method based on binary direction priority in one embodiment of the present invention;

[0021] Fig.12 is a schematic structural diagram of a wafer search system based on binary direction priority in some embodiments of the present invention;

[0022] Fig.13 It is a schematic diagram of the structure of an electronic device in some embodiments of the present invention. DETAILED DESCRIPTION

[0023] The principles and features of the present invention are described below in conjunction with the accompanying drawings. The examples given are only used to explain the present invention and are not used to limit the scope of the present invention.

[0024] refer to Figures 1 to 4In a first aspect of the present invention, a chip search method based on binary direction priority is provided, comprising: S100. Determine multiple candidate search directions according to two reference search directions and their corresponding reverse directions, and set their priorities; from the candidate search directions of the existing chips at the previous search point, the search direction with the highest priority is used as the main candidate search direction of the current search point; S200. Determine a memory point according to the change of the main candidate search direction of the current search point, and use the diagonal direction of the memory point or the current search point as one or more secondary candidate search directions when there is no chip in the candidate search direction; S300. Search for chips according to the main candidate search direction or the secondary candidate search direction of the current search point until all chips are traversed.

[0025] It can be understood that die bonding is an important process in semiconductor industry packaging, and due to factors such as labor costs, automatic die bonding machines are increasingly widely used. An important step in the die bonding process is to remove the chips from the wafer blue film in sequence according to a certain rule, that is, there is a chip array arranged in a certain overall shape according to a certain rule on the wafer blue film. This step requires first identifying the chips around the current position, and then searching for the next chip according to the established rules, and finally the chips on the wafer blue film can be fixed to the PCB board in sequence. The search state (corresponding to the memory mechanism) in the embodiment of the present invention is represented by the preset search direction of the next search point (the main candidate search direction of the previous search point), and the search point corresponds to the relative position or absolute position of elements such as wafers or chips in their arrays. Therefore, the above-mentioned chip search method based on binary direction priority can also be applied to the search of other wafer or chip elements.

[0026] Without loss of generality, in some steps S100 of the embodiments of the present invention, the determining of multiple candidate search directions based on two reference search directions and their corresponding reverse directions and setting their priorities includes: taking horizontal right and vertical downward as two reference search directions, and taking their corresponding reverse directions and the reference search direction as candidate search directions; the priorities of the candidate search directions from high to low are: vertical upward, horizontal left, horizontal right, and horizontal downward. Two reference search directions

[0027] Specifically, the above chip search method comprises the following steps: S1: setting two search positive directions, namely Figure 4The blue arrow direction (X axis) and the red arrow direction (Y axis) in the figure are referred to as blue positive and red positive respectively; on the contrary, the reverse direction of the blue arrow and the reverse direction of the red arrow are referred to as blue reverse and red reverse respectively. The priority of the direction is: red reverse (up) > blue reverse (left) > blue positive (right) > red positive (down); S2: Each point has a state to facilitate the execution of the following methods respectively. The possible states are: red positive, blue positive, red reverse, blue reverse, and starting point state; S3: When searching at the current point first, the direction of the previous search point is (old element) and does not need to be searched (except for the starting state); S4: The overall method of searching is: at the beginning, only the two with higher priority in the remaining three directions (coordinate axis directions) need to be searched (the priority order is as shown in S1). If these two directions are not available, then search the third one. If there is no up, down, left, or right, then search the diagonal direction (the priority of the diagonal direction: upper left > upper right > lower left > lower right); S5: Every time the first moves in the blue reverse direction, remember the coordinates of the first element point in the blue positive direction. If there is no element, it will not be memorized, and the memory point will be overwritten and cleared after being used once. S6: When moving in the opposite direction of the arrow and when the memory point jumps, line breaking does not change the direction of the arrow. When moving in the positive direction of the arrow, line breaking will change the direction of the blue arrow.

[0028] In step S200 of some embodiments of the present invention, the diagonal direction of the memory point or the current search point is used as one or more secondary candidate search directions when there is no chip in the candidate search direction, including: S201. If the current search point is in the blue reverse or red reverse search state, and the first chip in the priority candidate search direction specified by the state has been traversed (that is, the set memory point jump condition is met), then jump to the memory point, and use the search state of the current search point as the search state of the memory point.

[0029] Furthermore, the method of using the diagonal direction of the memory point or the current search point as one or more secondary candidate search directions when there is no chip in the candidate search direction also includes: S202. If there is no chip at the next search point of the candidate search direction of the current search point and the memory point is empty, the diagonal direction of the current search point is upgraded to a candidate search direction for search.

[0030] Specifically, there are two situations in which the memory point jumps: ① The chip is in the red reverse state, that is, when the chip is taken in the red reverse direction, if there is no chip, then search for chips in the blue reverse direction; if there is, then move the chip in the blue reverse direction; similarly, when there is no chip in the blue reverse direction, search the blue positive direction; if there is no chip in the above directions, jump to the memory point, if the memory point is empty, search the diagonal direction, if there is a chip in the diagonal direction, search in the diagonal direction. If there is none of the above, an error is reported: the element cannot be found and manual adjustment is required. ② When moving the chip in the blue reverse direction, according to the rules, search until there are no chips in the red reverse and blue reverse directions, then jump to the memory point; if the memory point is empty, search in the red positive direction: if there is a chip in the red positive direction, search in the red positive direction; otherwise, search the diagonal direction, and move in the diagonal direction if there is a chip in the diagonal direction. If none of the above is true, an error message is given: the element cannot be found and manual adjustment is required; optionally, the positive directions represented by the above blue positive and red positive can be interchanged, and the representative colors (red or blue) can be replaced with other colors, or corresponding marks or logos to distinguish different search directions.

[0031] In step S200 of some embodiments of the present invention, determining the memory point based on the change of the main candidate search direction of the current search point includes: if the search state of the current search point is inconsistent with the search state of the previous search point for the first time (when and only when searching for the first time in the second priority direction among all candidate search directions, that is, the horizontal left direction), then taking the first search point of the current search point in the opposite direction of the search state as the memory point.

[0032] refer to Figures 6 to 11 , Fig.11 The figure shows the path generated by searching for a chip using this method on a neatly arranged chip element array on a blue film. During the entire search, if the movement in the positive direction of the arrow reaches the end and needs to be changed, the positive direction of the blue arrow will be reversed. The specific search path includes: starting from the starting point to use this method to search for a chip, the starting point uses Fig.10 The search process shown is that first search for chips in both the red reverse and blue reverse directions, then search and move to the red reverse direction with a higher priority, and record the next point as the red reverse state.

[0033] At this time, keep searching in the red reverse direction until point A, which is now in the red reverse state. Use Figure 8 The search process shown is to first search the two directions with higher priority, red reverse and blue reverse. If there is no chip in the red reverse direction but there is a chip in the blue reverse direction, move to the blue reverse direction, record the position of the first chip C in the blue positive direction, and record the next point as the blue reverse state.

[0034] At this time, keep searching in the blue reverse direction until point B, which is now in the blue reverse state. Use Fig. 9The search process shown is to first search the red reverse and blue reverse directions with high priority. If there is no chip in both directions, but there is a memory point at this time, then jump to the location of the memory point C and record point C as the blue positive state.

[0035] At this time, follow the above rules to search until point E, which is in the red positive state. Use Figure 7 The search process shown is to first search the two directions with higher priority, blue reverse and blue positive. If there is a chip in the blue reverse direction, move to the blue reverse direction, record the position of the first chip F in the blue positive direction, and record the next point as the blue reverse state.

[0036] Continue searching according to the above search method until you reach point D, which is now in the blue reverse state. Use Fig. 9 The search process shown is that if there is no chip in both the red reverse and blue reverse directions with high priority, but there is a memory point at this time, then jump to the location of the memory point F and record point F as the blue positive state. After that, the rules are repeatedly used to search, and the end point can be searched eventually, that is, a better global search route is obtained in less time. It can be understood that the above method is equivalent to searching for chips in the primary candidate search direction or the secondary candidate search direction according to the current search point and its search state until all chips are traversed.

[0037] Example 2

[0038] refer to Fig.12 According to a second aspect of the present invention, a chip search system 1 based on binary direction priority is provided, comprising: a first determination module 11, for determining a plurality of candidate search directions according to two reference search directions and their corresponding reverse directions, and setting their priorities; from the candidate search directions of the chips in the previous search point, the search direction with the highest priority is used as the main candidate search direction of the current search point; a second determination module 12 is used to determine a memory point according to the change of the main candidate search direction of the current search point, and use the diagonal direction of the memory point or the current search point as one or more secondary candidate search directions when there is no chip in the candidate search direction; a traversal module 13 is used to search for chips according to the main candidate search direction or the secondary candidate search direction of the current search point until all chips are traversed.

[0039] In some embodiments of the present invention, the first determination module 11 includes: a first determination unit, used to determine multiple candidate search directions based on two reference search directions and their corresponding reverse directions, and set their priorities; a second determination unit, used to select the search direction with the highest priority from the candidate search directions of the existing chip of the previous search point as the main candidate search direction of the current search point.

[0040] Example 3

[0041] refer to Fig.13According to a third aspect of the present invention, an electronic device is provided, comprising: one or more processors; a storage device for storing one or more programs, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the method of the first aspect of the present invention.

[0042] The electronic device 500 may include a processing device (e.g., a central processing unit, a graphics processing unit, etc.) 501, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 502 or a program loaded from a storage device 508 into a random access memory (RAM) 503. In the RAM 503, various programs and data required for the operation of the electronic device 500 are also stored. The processing device 501, the ROM 502, and the RAM 503 are connected to each other via a bus 504. An input / output (I / O) interface 505 is also connected to the bus 504.

[0043] Typically, the following devices may be connected to the I / O interface 505: an input device 506 including, for example, a touch screen, a touch pad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; an output device 507 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; a storage device 508 including, for example, a hard disk, etc.; and a communication device 509. The communication device 509 may allow the electronic device 500 to communicate with other devices wirelessly or by wire to exchange data. Although Fig.13 The electronic device 500 is shown with various devices, but it should be understood that it is not required to implement or possess all the devices shown. More or fewer devices may be implemented or possessed instead. Fig.13 Each block shown in the figure may represent one device, or may represent multiple devices as required.

[0044] In particular, according to an embodiment of the present disclosure, the process described above with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present disclosure includes a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through a communication device 509, or installed from a storage device 508, or installed from a ROM 502. When the computer program is executed by the processing device 501, the above functions defined in the method of the embodiment of the present disclosure are executed. It should be noted that the computer-readable medium described in the embodiment of the present disclosure can be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to, an electrical connection with one or more conductors, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In an embodiment of the present disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. In an embodiment of the present disclosure, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. A computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device. The program code embodied on the computer readable medium may be transmitted using any appropriate medium, including but not limited to: wire, optical cable, RF (radio frequency), etc., or any suitable combination of the foregoing.

[0045] The computer-readable medium may be included in the electronic device, or may exist independently without being installed in the electronic device. The computer-readable medium carries one or more computer programs. When the one or more programs are executed by the electronic device, the electronic device:

[0046] Computer program code for performing the operations of embodiments of the present disclosure may be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages, such as Java, Smalltalk, C++, Python, and conventional procedural programming languages, such as "C" or similar programming languages. The program code may be executed entirely on a user's computer, partially on a user's computer, as a separate software package, partially on a user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving a remote computer, the remote computer may be connected to the user's computer via any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0047] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present disclosure. In this regard, each box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should be noted that each box in the block diagram and / or flow chart, and the combination of the boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0048] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A wafer search method based on binary direction priority, characterized in that: include: Determine multiple candidate search directions according to two reference search directions and their corresponding reverse directions, and set their priorities; From the candidate search directions of the existing wafer at the previous search point, the search direction with the highest priority is used as the main candidate search direction of the current search point; Determine the memory point according to the change of the main candidate search direction of the current search point: if the main candidate search direction of the current search point is inconsistent with the main candidate search direction of the previous search point for the first time, then the first search point of the current search point in the opposite direction of the main candidate search direction is used as the memory point; and using the diagonal direction of the memory point or the current search point as one or more secondary candidate search directions when there is no chip in the candidate search direction; The wafers are searched according to the primary candidate search direction or the secondary candidate search direction of the current search point until all wafers are traversed.

2. The wafer search method based on binary direction priority according to claim 1, characterized in that: The method of using the diagonal direction of the memory point or the current search point as one or more secondary candidate search directions when there is no chip in the candidate search direction includes: If the current search point is in the opposite direction of the reference search direction and the first chip in its main candidate search direction has been traversed, it jumps to the memory point and uses the search state of the current search point as the main candidate search direction of the memory point.

3. The wafer search method based on binary direction priority according to claim 1, characterized in that: The step of using the diagonal direction of the memory point or the current search point as one or more secondary candidate search directions when there is no chip in the candidate search direction also includes: If there is no chip at the next search point in the candidate search direction of the current search point and the memory point is empty, the diagonal direction of the current search point is upgraded to the main candidate search direction for searching.

4. The wafer search method based on binary direction priority according to any one of claims 1 to 3, characterized in that: The memory point is cleared after being used once.

5. The wafer search method based on binary direction priority according to any one of claims 1 to 3, characterized in that: Determining a plurality of candidate search directions according to the two reference search directions and their corresponding reverse directions, and setting their priorities includes: Horizontally rightward and vertically downward are used as two reference search directions, and their corresponding opposite directions and the reference search directions are used as candidate search directions; The priorities of the candidate search directions from high to low are: vertically upward, horizontally left, horizontally right, and horizontally downward.

6. A wafer search system based on binary direction priority, characterized in that: include: A first determination module, used to determine a plurality of candidate search directions according to two reference search directions and their corresponding reverse directions, and set their priorities; From the candidate search directions of the existing wafer at the previous search point, the search direction with the highest priority is used as the main candidate search direction of the current search point; The second determination module is used to determine the memory point according to the change of the main candidate search direction of the current search point: if the main candidate search direction of the current search point is inconsistent with the main candidate search direction of the previous search point for the first time, the first search point of the current search point in the opposite direction of the main candidate search direction is used as the memory point; and using the diagonal direction of the memory point or the current search point as one or more secondary candidate search directions when there is no chip in the candidate search direction; The traversal module is used to search for chips according to the primary candidate search direction or the secondary candidate search direction of the current search point until all chips are traversed.

7. The wafer search system based on binary direction priority according to claim 6, characterized in that: The first determining module comprises: A first determining unit, configured to determine a plurality of candidate search directions according to two reference search directions and their corresponding reverse directions, and to set their priorities; The second determining unit is used to select the search direction with the highest priority from the candidate search directions of the existing wafer at the previous search point as the main candidate search direction of the current search point.

8. An electronic device comprising: one or more processors; A storage device for storing one or more programs, when the one or more programs are executed by the one or more processors, the one or more processors implement the chip search method based on binary direction priority as described in any one of claims 1 to 5.

9. A computer readable medium having a computer program stored thereon, wherein: When the computer program is executed by a processor, the chip search method based on binary direction priority according to any one of claims 1 to 5 is implemented.

Images