Crystal grain failure bit classification method and device, storage medium and equipment

By establishing a physical address array and using the concepts of nine-part grids and twenty-five-part grids to automatically classify grain failure bits, the problems of low classification efficiency and poor accuracy in the existing technology are solved, and efficient and accurate failure bit classification is achieved. Significantly improves the reliability of chip analysis.

CN119071272APending Publication Date: 2024-12-03ZHEJIANG ICSPROUT SEMICONDUCTOR CO LTD
View PDF 0 Cites 3 Cited by

Patent Information

Application Number
CN202411137042.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-16
Publication Date
2024-12-03

AI Technical Summary

Technical Problem

In the prior art, the classification efficiency of grain failure bits is low and error-prone, making it difficult to accurately determine the cause of product failure.

Method used

By obtaining the physical address information of all the failed bits on the grain, establishing a physical address array, and classifying them based on the information of the surrounding adjacent bits, using the concepts of the nine-part grid and the twenty-five-part grid to determine the classification results of the failed bits, and achieving automated classification.

Benefits of technology

It improves the classification efficiency and accuracy of grain failure bits, reduces the probability of misjudgment, significantly shortens the classification time, and improves the reliability of chip yield analysis.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119071272A_ABST
    Figure CN119071272A_ABST
Patent Text Reader

Abstract

The invention discloses a grain failure bit classification method and device, a storage medium and equipment. The method comprises the following steps: acquiring physical address information of all invalid bits on a crystal grain; establishing a corresponding physical address array based on the physical address information of all invalid bits on the crystal grain; determining a classification result of the current invalid bit; the step of determining the classification result of the current invalid bits comprises the substeps of searching the physical address array, and determining the total number of the current invalid bits and the invalid bits existing in the adjacent bits around the current invalid bits; and determining a classification result of the current invalid bit based on the current invalid bit and the total number of invalid bits existing in the surrounding adjacent bits. By adopting the scheme, the classification efficiency of the crystal grain failure bits can be improved, and the classification accuracy can be improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of semiconductor technology, and in particular to a grain failure bit classification method, device, storage medium and equipment. Background Art

[0002] Wafers are silicon chips used to make silicon semiconductor circuits. Wafers are cut into individual dies, and then each die is packaged to obtain chips.

[0003] After the wafer is manufactured, all the dies on the wafer need to be tested to determine the failure bits of each die on the wafer and generate a die failure bit test result file. The failure bits of the dies can then be classified to analyze the wafer manufacturing process and determine the cause of product failure.

[0004] However, existing methods for classifying die failure bits are inefficient and prone to errors. Summary of the invention

[0005] The problem to be solved by the present invention is to improve the classification efficiency of grain failure bits and improve the classification accuracy.

[0006] To solve the above problems, an embodiment of the present invention provides a method for classifying die failure bits, the method comprising:

[0007] Obtaining the physical address information of all failed bits on the die;

[0008] Based on the physical address information of all failed bits on the die, a corresponding physical address array is established;

[0009] Determine the classification result of the current failed bit;

[0010] Determining the classification result of the current failure bit includes: searching the physical address array to determine the total number of failure bits in the current failure bit and surrounding adjacent bits; determining the classification result of the current failure bit based on the total number of failure bits in the current failure bit and surrounding adjacent bits.

[0011] In a possible embodiment, searching the physical address array to determine the total number of failed bits in the current failed bit and surrounding adjacent bits includes:

[0012] Calculate the physical address information of adjacent bits in the nine-square grid centered on the current failed bit;

[0013] Based on the physical address information of the current failed bit and the adjacent bits in the nine-square grid centered on the current failed bit, the physical address array is searched to determine the total number of failed bits in the nine-square grid centered on the current failed bit.

[0014] In a possible embodiment, searching the physical address array based on the physical address information of the current failed bit and the adjacent bits in the nine-square grid centered on the current failed bit to determine the total number of failed bits in the nine-square grid centered on the current failed bit includes:

[0015] The counting variable values ​​of each adjacent bit in the nine-square grid centered on the current failed bit are obtained by adopting the following method: when the physical address array contains the physical address information of the first adjacent bit of the current failed bit, the counting variable of the first adjacent bit is set to the first value; otherwise, the counting variable of the first adjacent bit is kept set to the initial value;

[0016] The count variable values ​​of the failed bits in the nine-square grid centered on the current failed bit are accumulated as the number of failed bits in the nine-square grid centered on the current failed bit.

[0017] In a possible embodiment, the first value is 1, and the initial value is 0.

[0018] In a possible embodiment, determining the classification result of the current failure bit based on the total number of failure bits in the current failure bit and surrounding adjacent bits includes:

[0019] Determine a rough category of the current failed bit based on the total number of failed bits in the nine-square grid centered on the current failed bit;

[0020] Determine the position distribution of each adjacent failed bit relative to the current failed bit within a twenty-five-square grid centered on the current failed bit;

[0021] Based on the current failure bit and the position distribution of each adjacent failure bit in the twenty-five squares centered on the current failure bit relative to the current failure bit, a final classification result is determined from the coarse category of the current failure bit.

[0022] In a possible embodiment, determining the position distribution of each adjacent failed bit in the twenty-five square grid centered on the current failed bit relative to the current failed bit includes: determining whether each adjacent failed bit in the twenty-five square grid centered on the current failed bit is a failed bit by searching the physical address array.

[0023] In a possible embodiment, determining the classification result of each failure bit includes:

[0024] It is determined whether the category of the current failure bit is the SWL category, and the physical address information of all the failure bits with the same horizontal coordinate is obtained.

[0025] In a possible embodiment, the determining whether the category of the current failure bit is the SWL category and obtaining the physical address information of all the failure bits having the same horizontal coordinate includes:

[0026] Repeat the following operations to obtain the physical address information of all failed bits belonging to the SWL category: select a failed bit from the physical address array as the current failed bit, calculate the physical address information of 9 consecutive bits in the column direction starting from the current failed bit, and determine whether the physical address information of the 9 consecutive bits in the column direction exists in the acquired physical address information of all failed bits on the die, and if so, store the physical address information of the current failed bit in the first array;

[0027] Repeat the following operations to obtain the physical address information of the failed bits with the same horizontal coordinate among the failed bits belonging to the SWL category: compare the horizontal coordinate in each physical address information in the first array with the horizontal coordinate in the obtained physical address information of all failed bits on the grain, and obtain the physical address information of all failed bits with the same horizontal coordinate respectively.

[0028] In a possible embodiment, determining the classification result of each failure bit includes:

[0029] It is determined whether the category of the current failure bit is the SBL category, and the physical address information of all the failure bits with the same ordinate is obtained.

[0030] In a possible embodiment, determining whether the category of the current failure bit is the SBL category and obtaining the physical address information of all the failure bits having the same vertical coordinate includes:

[0031] Repeat the following operations to obtain the physical address information of all failed bits belonging to the SBL category: select a failed bit from the physical address array as the current failed bit, calculate the physical address information of 9 consecutive bits in the row direction starting from the current failed bit, and determine whether the physical address information of the 9 consecutive bits in the row direction exists in the acquired physical address information of all failed bits on the die, and if so, store the physical address information of the current failed bit in the third array;

[0032] Repeat the following operations to obtain the physical address information of the failed bits with the same vertical coordinate among the failed bits belonging to the SBL category: compare the vertical coordinate in each physical address information in the third array with the vertical coordinate in the physical address information of all failed bits on the obtained die, and obtain the physical address information of all failed bits with the same vertical coordinate respectively.

[0033] In a possible embodiment, the obtaining of the physical address information of all failed bits on the die includes: obtaining a die failed bit test result file, and reading the physical address information of all failed bits on the die from the die failed bit test result file.

[0034] In a possible embodiment, the method further includes: collecting statistics on classification result information of failed bits of all dies on the wafer.

[0035] An embodiment of the present invention further provides a device for classifying die failure bits, the device comprising:

[0036] An acquisition unit, adapted to acquire physical address information of all failed bits on the die;

[0037] An array establishing unit, adapted to establish a corresponding physical address array based on the physical address information of all failed bits on the die;

[0038] A classification unit, adapted to determine a classification result of each failed bit;

[0039] The classification unit includes: a first classification subunit, adapted to search the physical address array to determine the total number of failed bits in the current failed bit and the surrounding adjacent bits; and determine the classification result of the current failed bit based on the total number of failed bits in the current failed bit and the surrounding adjacent bits.

[0040] In a possible embodiment, the classification unit further includes: a second classification subunit, adapted to determine whether the category of the current failure bit is the SWL category, and to obtain physical address information of all failure bits having the same horizontal coordinate.

[0041] In a possible embodiment, the classification unit further includes: a third classification subunit, adapted to determine whether the category of the current failure bit is the SBL category, and to obtain physical address information of all the failure bits having the same vertical coordinate.

[0042] An embodiment of the present invention further provides a computer-readable storage medium on which a computer program is stored. The computer program is executed by a processor to implement the steps of any of the above methods.

[0043] An embodiment of the present invention further provides an electronic device, including a memory and a processor, wherein the memory stores a computer program that can be run on the processor, and the processor executes the steps of any of the above methods when running the computer program.

[0044] Compared with the prior art, the technical solution of the embodiment of the present invention has the following advantages:

[0045] By applying the scheme of the present invention, the physical address information of all failed bits on the die is obtained, a corresponding physical address array is established, and then the physical address information of the current failed bit and the physical address information of the adjacent bits around the current failed bit is searched in the physical address array to determine the total number of failed bits in the current failed bit and the adjacent bits around it, and finally the classification result of the current failed bit is determined based on the total number of failed bits in the current failed bit and the adjacent bits around it, thereby realizing automatic classification of failed bits using a computer program. Compared with using an Excel tool or using the personal experience of engineers to classify failed bits, the classification efficiency can be improved, and the classification accuracy can be improved. BRIEF DESCRIPTION OF THE DRAWINGS

[0046] Figure 1 is a flow chart of a die failure bit classification in an embodiment of the present invention;

[0047] Figure 2 is a flow chart of another die failure bit classification in an embodiment of the present invention;

[0048] Figures 3 to 28 is a schematic diagram of different categories of failed bits;

[0049] Fig.29 It is a schematic diagram of statistical results of a failed bit category Sbit on a wafer in an embodiment of the present invention;

[0050] Fig.30 It is a schematic diagram for comparing classification efficiency;

[0051] Fig.31 Schematic diagram of the structure of the grain failure bit classification device in an embodiment of the present invention. DETAILED DESCRIPTION

[0052] In practical applications, after the wafer is manufactured, all the dies on the wafer need to be tested to determine the failed bits of each die on the wafer and generate a die failed bit test result file. Some dies may have multiple bit failures, and some dies may have no failed bits. Among them, the failure of a bit on a die refers to a fault in the semiconductor structure corresponding to the bit, which is usually a static random access memory (SRAM). By writing a data stream to the SRAM and performing a read test, it is determined which bit of the SRAM has a read error.

[0053] The die failure bit test result file records the test results of each failure bit on the die in text form, usually a .txt file. The die failure bit test result file can contain the physical address information and logical address information of each failure bit in the die. Among them. The physical address information is the physical coordinate of the failure bit in the die. For example, a piece of information in the die failure bit test result file can be: 0, 0, 19.48, 348.45, where the first "0" represents the logical address, the second "0" represents the failure bit number, "19.48" represents the x-coordinate of the failure bit, and "348.45" represents the y-coordinate of the failure bit.

[0054] The failed bits of the die can then be classified, thereby analyzing the wafer manufacturing process to determine the cause of product failure.

[0055] Existing solutions for classifying failed bits of die usually include the following two methods: the first method is to convert the logical address and physical address of the failed bit into a formula through an Excel tool to obtain the classification result of the failed bit; the second method is to classify the failed bits based on the personal experience of engineers to obtain the classification result of the failed bits.

[0056] However, using the above two solutions, the efficiency of classifying failed bits is low and the probability of misjudgment is high.

[0057] To address this problem, the present invention provides a method for classifying grain failure bits. The method can realize automatic classification of grain failure bits using a computer program, thereby improving classification efficiency and reducing the probability of misjudgment.

[0058] In order to make the above-mentioned objects, features and advantages of the present invention more obvious and easy to understand, specific embodiments of the present invention are described in detail below with reference to the accompanying drawings.

[0059] Reference Figure 1 The embodiment of the present invention provides a method for classifying die failure bits, which may include the following steps:

[0060] Step 11, obtaining the physical address information of all failed bits on the die.

[0061] In a specific implementation, when classifying the failed bits on any die on a wafer, the die failed bit classification method in the embodiment of the present invention can be used.

[0062] Specifically, after testing the wafer, a failed bit test result file of each die on the wafer can be obtained. When classifying any die, the physical address information of each failed bit, that is, the physical coordinate information of each failed bit, can be obtained from the failed bit test result file of the die.

[0063] Step 12: establishing a corresponding physical address array based on the physical address information of all failed bits on the die.

[0064] In a specific implementation, after obtaining the physical address information of all failed bits on the die, the physical address of each failed bit can be analyzed to establish a corresponding physical address array. The physical addresses of all failed bits on the die are located in the same physical address array.

[0065] In the physical address array, the physical addresses of the failed bits with the same horizontal coordinate are located in the same row, and the physical addresses of the failed bits with the same vertical coordinate are located in the same column. In the same row of the physical address array, the physical addresses of the failed bits can be arranged in a certain order, for example, in an order from small to large, or in an order from large to small. In the same column of the physical address array, the physical addresses of the failed bits can be arranged in a certain order, for example, in an order from small to large, or in an order from large to small.

[0066] By setting the physical address array, the adjacent failed bits around the current failed bit can be determined by searching the physical address array, so there is no need to search the failed bit test result file of the die, thereby improving the search efficiency and further improving the classification efficiency.

[0067] Step 13: Determine the classification result of the current failure bit.

[0068] In a specific implementation, the categories of the failed bits may include: Sbit (Singlebit, i.e., a single bit fails), DBC (DoubleBitColumn, i.e., two consecutive failed bits in the column direction), DBR (DoubleBitRow, i.e., two consecutive failed bits in the row direction), AB (AdjecentBit, i.e., only the diagonal bit in the grid fails), TriB (TripleBit, i.e., there are three bit failures in the grid), QB (QuadBitRow, i.e., 4 bits fail in the grid), SWL (SingleWordLine, i.e., 10 consecutive bits fail along the column direction) and SBL (SingleBitLine, i.e., 10 consecutive bits fail along the row direction), etc.

[0069] Specifically, a variety of methods may be used to determine the classification result of the current failed bit. Subsequently, the classification results of each failed bit on the die may be counted to obtain the classification results of all failed bits on the die.

[0070] Figure 2 FIG. 1 is a flow chart of a method for classifying a die failure bit in an embodiment of the present invention. Figure 2, the method may include the following steps:

[0071] Step 21, obtaining the physical address information of all failed bits on the die.

[0072] Step 22: establishing a corresponding physical address array based on the physical address information of all failed bits on the die.

[0073] Regarding step 21 and step 22, you can refer to the above description of steps 11 and 12 for implementation, and will not repeat them here.

[0074] Step 23, determining the total number of failed bits in the current failed bit and surrounding adjacent bits by searching the physical address array.

[0075] In a specific implementation, the physical address information of the adjacent bits in the nine-square grid centered on the current failed bit can be calculated, and based on the physical address information of the current failed bit and the adjacent bits in the nine-square grid centered on the current failed bit, the physical address array can be searched to determine the total number of failed bits in the nine-square grid centered on the current failed bit.

[0076] Specifically, referring to Table 1, the adjacent bits in the nine-square grid centered on the current invalid bit may include: the left bit lf, the right bit rf, the previous bit up, the next bit dw, the upper left bit lu, the upper right bit ru, the lower left bit ld and the lower right bit rd of the current invalid bit.

[0077] Assuming that the physical coordinates of the current invalid bit are (x, y), the physical coordinates of the left bit lf of the current invalid bit should be (x-1, y), the physical coordinates of the right bit rf should be (x+1, y), the physical coordinates of the previous bit up should be (x, y+1), the physical coordinates of the next bit dw should be (x, y-1), the physical coordinates of the upper left bit lu should be (x-1, y+1), the physical coordinates of the upper right bit ru should be (x+1, y+1), the physical coordinates of the lower left bit ld should be (x-1, y-1), and the physical coordinates of the lower right bit rd should be (x+1, y-1). The adjacent bits of the current invalid bit may be invalid bits or non-invalid bits.

[0078] In a specific implementation, a counting variable can be configured in advance for each adjacent bit in the nine-square grid, and the counting variable has an initial value. After obtaining the physical address information of the adjacent bits in the nine-square grid centered on the current failed bit, the first adjacent bit is used as any adjacent bit around the current failed bit, and the physical address array is searched. When the physical address information of the first adjacent bit of the current failed bit exists in the physical address array, the counting variable of the first adjacent bit is set to the first value, otherwise, the counting variable of the first adjacent bit is kept set to the initial value. Repeat the above steps until the counting variable values ​​of each adjacent bit in the nine-square grid centered on the current failed bit are obtained. The counting variable values ​​of the current failed bit and the counting variable values ​​of each adjacent bit in the nine-square grid are accumulated to obtain the number of failed bits in the current failed bit and the surrounding adjacent bits.

[0079] In one embodiment, the first value may be 1, and the initial value may be 0.

[0080] Table 1

[0081] lulu uplu upup upru ruru lflu lu up ru rftu lflf lf Current invalid bit rf rfrf lfld ld dw rd rfrd ldld dwld dw dwrd rdrd

[0082] At this time, referring to Table 1, the total number of failed bits FailBitTotalCount in the nine-square grid centered on the current failed bit can be expressed as:

[0083] FailBitTotalCount=FailBitFirstCount+FailBitlfCount+FailBitrtCount+FailBit upCount+FailBitdwCount+FailBitluCount+FailBitruCount+FailBitldCount+FailBi trdCount.

[0084] Among them, FailBitFirstCount represents the counting variable value of the current failure bit, FailBitlfCount represents the counting variable value of the left bit lf of the current failure bit, FailBitrtCount represents the counting variable value of the right bit rf of the current failure bit, FailBitupCount represents the counting variable value of the previous bit up of the current failure bit, FailBitdwCount represents the counting variable value of the next bit dw of the current failure bit, FailBitluCount represents the counting variable value of the upper left bit lu of the current failure bit, FailBitruCount represents the counting variable value of the upper right bit ru of the current failure bit, FailBitldCount represents the counting variable value of the lower left bit ld of the current failure bit, and FailBitrdCount represents the counting variable value of the lower right bit rd of the current failure bit.

[0085] In other embodiments, the first value may also be other values, for example, the first value may be 2, 3 or 4. At this time, the ratio of the value of FailBitTotalCount to the first value is the total number of failed bits in the current failed bit and surrounding adjacent bits.

[0086] Step 24: Determine the classification result of the current failed bit based on the total number of failed bits in the nine-square grid centered on the current failed bit.

[0087] In a specific implementation, the number of failed bits in the nine-square grid centered on the current failed bit is accumulated to obtain the total number of failed bits in the nine-square grid centered on the current failed bit.

[0088] After determining the total number of failed bits in the nine-square grid centered on the current failed bit, the coarse category of the current failed bit can be determined based on the total number of failed bits in the nine-square grid centered on the current failed bit, and then the position distribution of each adjacent failed bit in the twenty-five square grids centered on the current failed bit relative to the current failed bit is determined. Finally, based on the current failed bit and the position distribution of each adjacent failed bit in the twenty-five square grids centered on the current failed bit relative to the current failed bit, the final classification result is determined from the coarse category of the current failed bit.

[0089] Specifically, when FailBitTotalCount=2, it indicates that there are more than two failed bits in the adjacent bits around the current failed bit. At this time, the category of the current failed bit can be DBC (DoubleBitColumn, i.e., two consecutive failed bits in the column direction), DBR (DoubleBitRow, i.e., two consecutive failed bits in the row direction) and AB (AdjecentBit, i.e., only diagonal bits in the grid fail). At this time, the category to which the current failed bit finally belongs can be determined based on the position distribution of the adjacent failed bits relative to the current failed bit.

[0090] In a specific implementation, after the rough category of the current failure bit is determined, the final classification result is determined from the rough category of the current failure bit.

[0091] Specifically, after determining the rough category of the current failure bit, the final classification result can be determined based on the position distribution of each adjacent failure bit relative to the current failure bit in the twenty-five squares centered on the current failure bit. For example, when FailBitTotalCount=2, it can be determined which category the current failure bit belongs to, DBC, DBR, or AB, based on the position distribution of the current failure bit and the surrounding adjacent failure bits. When FailBitTotalCount=4, it can be determined that the current failure bit is specifically QB based on the position distribution of the current failure bit and the surrounding failure bits.

[0092] In a specific implementation, the position distribution of the current failure bit and the surrounding adjacent failure bits refers to the position of the surrounding adjacent failure bits relative to the current failure bit. Specifically, the count variable value of the surrounding adjacent failure bits can be determined by searching the physical address array, and the position distribution of the adjacent failure bits relative to the current failure bit can be determined based on the count variable value. The method for determining the count variable value of the surrounding adjacent failure bits can be implemented with reference to the above-mentioned method for determining the count variable value of the first adjacent failure bit.

[0093] Assume that FailBitTotalCount=2, refer to Table 1, when there are two consecutive adjacent failed bits in the row where the current failed bit is located, the current failed bit category is DBR. Specifically, if FailBitFirstCount=1 and FailBitlfCount=1, but FailBitlflfCount=0, FailBitlfluCount=0 and FailBitlfldCount=0, it indicates that the current failed bit and the bit to its left are both failed bits, such as Figure 3 As shown (where C represents the current failure bit, Figures 4 to 28If FailBitFirstCount=1 and FailBitrtCount=1, but FailBitrfrfCount=0, FailBitrfruCount=0 and FailBitrfrdCount=0, it indicates that the current failed bit and its right bit rf are both failed bits. Figure 4 As shown, the current failure bit type is DBR. Wherein, FailBitlflfCount represents the count variable value of bit lflf. FailBitrfrfCount represents the count variable value of bit rfrf.

[0094] When there are two consecutive failed bits in the column, the current failed bit category is DBC. Specifically, if FailBitFirstCount=1 and FailBitupCount=1, but FailBitupupCount=0, FailBitupluCount=0, and FailBitupruCount=0, it indicates that the current failed bit and its previous bit are both failed bits. Figure 5 As shown in , the current failure bit category is DBC. If FailBitFirstCount=1 and FailBitdwCount=1, but FailBitdwdwCount=0, FailBitdwldCount=0 and FailBitdwrdCount=0, it means that the current failure bit and its next bit are both failure bits, such as Figure 6 As shown, the current failure bit category is DBC. Among them, FailBitupupCount represents the count variable value of bit upup. FailBitdwdwCount represents the count variable value of bit dwdw. FailBitdwldCount represents the count variable value of bit dwld. FailBitdwrdCount represents the count variable value of bit dwrd.

[0095] In the grid where the current invalid bit is located, when only the diagonal bits are invalid, that is, when only the current invalid bit and the upper left bit, the current invalid bit and the upper right bit, the current invalid bit and the lower left bit, or the current invalid bit and the lower right bit are invalid, the current invalid bit category is AB.

[0096] Specifically, if FailBitFirstCount=1 and FailBitluCount=1, but FailBitlflfCount=0, FailBitlfluCount=0, FailBitluluCount=0, FailBitupluCount=0, and FailBitupupCount=0, it indicates that the current failed bit and the upper left bit are failed, such as Figure 7 As shown. Among them, FailBitlflfCount represents the counting variable value of bit lflf. FailBitlfluCount represents the counting variable value of bit lflu. FailBitluluCount represents the counting variable value of bit lulu. FailBitupluCount represents the counting variable value of bit uplu.

[0097] If FailBitFirstCount=1 and FailBitruCount=1, but FailBitrfrfCount=0, FailBitrfruCount=0, FailBitruruCount=0, FailBitupruCount=0 and FailBitupupCount=0, it indicates that the current failed bit and the upper right bit are failed, such as Figure 8 As shown in FIG. 1 , FailBitrfruCount represents the count variable value of the bit rfru. FailBitruruCount represents the count variable value of the bit ruru. FailBitupruCount represents the count variable value of the bit upru.

[0098] If FailBitFirstCount=1 and FailBitldCount=1, but FailBitlflfCount=0, FailBitlfldCount=0, FailBitldldCount=0, FailBitdwldCount=0 and FailBitdwdwCount=0, it indicates that the current failed bit and the lower left bit are Fig. 9 shown.

[0099] If FailBitFirstCount=1 and FailBitrdCount=1, but FailBitrfrfCount=0, FailBitrfrdCount=0, FailBitrdrdCount=0, FailBitdwrdCount=0 and FailBitdwdwCount=0, it means that the current failed bit and the lower right bit are failed. Fig.10 shown.

[0100] In a specific implementation, after the total number of failed bits exists in the nine-square grid centered on the current failed bit, the final category of the current failed bit can be determined directly based on the position distribution of the adjacent failed bits in the nine-square grid centered on the current failed bit.

[0101] For example, when FailBitTotalCount=1, it indicates that there is no failed bit in the adjacent bits around the current failed bit. At this time, the category of the current failed bit should be Sbit (Singlebit, ie, single bit failure).

[0102] When FailBitTotalCount=3, the category of the current failed bit may be TriB (TripleBit, ie, there are three bit failures in the grid).

[0103] When FailBitTotalCount=4, the category of the current failed bit may be QB (QuadBitRow, ie, 4 bits in the grid are failed).

[0104] Assume that when FailBitTotalCount=3, the category of the current failed bit is TriB. At this time, there are three failed bits in the grid where the current failed bit is located, which may include the following 12 situations:

[0105] 1) FailBitFirstCount=1, FailBitupCount=1 and FailBitluCount=1, but FailBitlflfCount=0, FailBitlfluCount=0, FailBitluluCount=0, FailBitupluCount=0, FailBitupupCount=0 and andFailBitupruCount=0, indicating that the current failed bit and its previous bit and upper left bit are failed bits, such as Fig.11 shown.

[0106] 2) FailBitFirstCount=1, FailBitupCount=1 and FailBitruCount=1, but FailBitupluCount=0, FailBitupupCount=0, FailBitupruCount=0, FailBitruruCount=0, FailBitrfruCount=0 and FailBitrfrfCount=0, indicating that the current failed bit and its previous bit and upper right bit are failed bits, such as Fig.12 shown.

[0107] 3) FailBitFirstCount=1, FailBitupCount=1 and FailBitlfCount=1, but FailBitlfluCount=0, FailBitlfldCount=0, FailBitupupCount=0, FailBitupluCount=0 and FailBitupruCount=0, indicating that the current failed bit and its previous bit and left bit are failed bits, such as Fig.13 shown.

[0108] 4) FailBitFirstCount=1, FailBitupCount=1 and FailBitrtCount=1, but FailBitrfrfCount=0, FailBitrfruCount=0, FailBitrfrdCount=0, FailBitupupCount=0, FailBitupluCount=0 and FailBitupruCount=0, which indicates that the current failed bit and the previous bit and the right bit are failed bits, such as Fig.14 shown.

[0109] 5) FailBitFirstCount=1, FailBitrtCount=1 and FailBitruCount=1, but FailBitrfrdCount=0, FailBitupupCount=0, FailBitupruCount=0, FailBitruruCount=0, FailBitrfruCount=0 and FailBitrfrfCount=0, which indicates that the current failed bit and its right bit and upper right bit are failed bits, such as Fig.15 shown.

[0110] 6) FailBitFirstCount=1, FailBitrtCount=1 and FailBitrdCount=1, but FailBitdwdwCount=0, FailBitdwrdCount=0, FailBitrdrdCount=0, FailBitrfrdCount=0, FailBitrfrfCount=0 and FailBitrfruCount=0, which indicates that the current failed bit and its right bit and lower right bit are failed bits, such as Fig.16 shown.

[0111] 7) If FailBitFirstCount = 1, FailBitrtCount = 1, and FailBitdwCount = 1, but FailBitdwdwCount = 0, FailBitdwldCount = 0, FailBitdwrdCount = 0, FailBitrfrfCount = 0, FailBitrfruCount = 0, and FailBitrfrdCount = 0, it indicates that the current failed bit and its right adjacent bit and the next bit are failed bits, as Fig.17 shown.

[0112] 8) If FailBitFirstCount = 1, FailBitdwCount = 1, and FailBitldCount = 1, but FailBitdwdwCount = 0, FailBitdwrdCount = 0, FailBitdwldCount = 0, FailBitlflfCount = 0, FailBitlfldCount = 0, and FailBitldldCount = 0, it indicates that the current failed bit and its lower left bit and the next bit are failed bits, as Fig.18 shown.

[0113] 9) If FailBitFirstCount = 1, FailBitdwCount = 1, and FailBitrdCount = 1, but FailBitdwdwCount = 0, FailBitdwrdCount = 0, FailBitdwldCount = 0, FailBitrdrdCount = 0, FailBitrfrdCount = 0, and FailBitrfrfCount = 0, it indicates that the current failed bit and its next bit and the lower right bit are failed bits, as Fig.19 shown.

[0114] 10) If FailBitFirstCount = 1, FailBitdwCount = 1, and FailBitlfCount = 1, but FailBitdwdwCount = 0, FailBitdwrdCount = 0, FailBitdwldCount = 0, FailBitlflfCount = 0, FailBitlfluCount = 0, and FailBitlfldCount = 0, it indicates that the current failed bit and its next bit and the left adjacent bit are failed bits, as Fig. 20 shown.

[0115] 11) FailBitFirstCount = 1, FailBitlfCount = 1, and FailBitluCount = 1, but FailBitlflfCount = 0, FailBitlfldCount = 0, FailBitlfluCount = 0, FailBitluluCount = 0, FailBitupluCount = 0, and FailBitupupCount = 0, which indicates that the current failed bit and its leftmost bit and upper left bit are failed bits, as Fig.21 shown.

[0116] 12) FailBitFirstCount = 1, FailBitlfCount = 1, and FailBitldCount = 1, but FailBitlflfCount = 0, FailBitlfldCount = 0, FailBitlfluCount = 0, FailBitldldCount = 0, FailBitdwldCount = 0, and FailBitdwdwCount = 0, which indicates that the current failed bit and its leftmost bit and lower left bit are failed bits, as Fig. 22 shown.

[0117] Assume FailBitTotalCount = 4. When all four bits in the square grid where the current failed bit is located are failed bits, the category QB of the current failed bit specifically includes the following four cases:

[0118] 1) FailBitFirstCount = 1, FailBitluCount = 1, FailBitupCount = 1, and FailBitlfCount = 1, but FailBitlfldCount = 0, FailBitlflfCount = 0, FailBitlfluCount = 0, FailBitluluCount = 0, FailBitupluCount = 0, FailBitupupCount = 0, and FailBitupruCount = 0, indicating that all four bits in the square grid with the current failed bit as the lower right bit are failed bits, as Fig.23 shown.

[0119] 2) FailBitFirstCount = 1, FailBitupCount = 1, FailBitruCount = 1, and FailBitrtCount = 1, but FailBitrfrdCount = 0, FailBitrfrfCount = 0, FailBitrfruCount = 0, FailBitruruCount = 0, FailBitupluCount = 0, FailBitupupCount = 0, and FailBitupruCount = 0, indicating that within the tic-tac-toe grid with the current failed bit as the lower-left bit, all four bits are failed bits, as Fig.24 shown.

[0120] 3) FailBitFirstCount = 1, FailBitdwCount = 1, FailBitlfCount = 1, and FailBitldCount = 1, but FailBitlfldCount = 0, FailBitlflfCount = 0, FailBitlfluCount = 0, FailBitldldCount = 0, FailBitdwrdCount = 0, FailBitdwdwCount = 0, and FailBitdwldCount = 0, indicating that within the tic-tac-toe grid with the current failed bit as the upper-right bit, all four bits are failed bits, as Fig.25 shown.

[0121] 4) FailBitFirstCount = 1, FailBitdwCount = 1, FailBitrtCount = 1, and FailBitrdCount = 1, but FailBitrfrdCount = 0, FailBitrfrfCount = 0, FailBitrfruCount = 0, FailBitrdrdCount = 0, FailBitdwrdCount = 0, FailBitdwdwCount = 0, and FailBitdwldCount = 0, indicating that within the tic-tac-toe grid with the current failed bit as the upper-left bit, all four bits are failed bits, as Fig.26 shown.

[0122] In a specific implementation, the categories of the current failed bit may further include: SWL (Single Word Line, i.e., 10 consecutive bits fail along the column direction) and SBL (Single Bit Line, i.e., 10 consecutive bits fail along the row direction).

[0123] To this end, in one embodiment of the present invention, after establishing the physical address array, step 13 may further include:

[0124] Step 25, determining whether the category of the current failure bit is the SWL category, and obtaining the physical address information of all the failure bits having the same horizontal coordinate.

[0125] In a specific implementation, the determining whether the category of the current failure bit is the SWL category and obtaining the physical address information of all the failure bits having the same horizontal coordinate may include:

[0126] Repeat the following operations to obtain the physical address information of all failed bits belonging to the SWL category: select a failed bit from the physical address array as the current failed bit, calculate the physical address information of 9 consecutive bits in the column direction starting from the current failed bit, and determine whether the physical address information of the 9 consecutive bits in the column direction exists in the acquired physical address information of all failed bits on the die, and if so, store the physical address information of the current failed bit in the first array;

[0127] Repeat the following operations to obtain the physical address information of the failed bits with the same horizontal coordinate among the failed bits belonging to the SWL category: compare the horizontal coordinate in each physical address information in the first array with the horizontal coordinate in the obtained physical address information of all failed bits on the grain, and obtain the physical address information of all failed bits with the same horizontal coordinate respectively.

[0128] Specifically, refer to Fig. 27 , after establishing the physical address array, select the failed bit C as the current failed bit, and first calculate the physical address information of the 9 bits that are consecutively adjacent in the column direction starting from the current failed bit C, that is, the 9 failed bits that have the same horizontal coordinates as the current failed bit C and are consecutively adjacent in the vertical coordinates. Assuming that the physical address information of the current failed bit C is (x, y), the physical address information of the 9 bits that are consecutively adjacent in the column direction can be (x, y+1), (x, y+2), ..., (x, y+9) in sequence.

[0129] Afterwards, the die failure bit test result file is traversed to determine whether the physical address information of the 9 consecutive bits in the column direction exists. If so, it indicates that the 9 consecutive bits in the column direction are all failure bits. At this time, the current failure bit C category is SWL, and the physical address information of the current failure bit C is (x, y) and stored in the first array. In this way, the physical address information of all failure bits belonging to the SWL category can be obtained.

[0130] Next, after deduplication and sorting of the first array, each element in the first array can be traversed, and each element in the first array is compared with the horizontal coordinate in the physical address information of each failed bit in the die failure bit test result file. If they are consistent, the physical address information of all failed bits (referred to as failed bits on a SWL) with the same horizontal coordinate as the element in the die failure bit test result file is obtained and stored in the second array. In this way, the physical address information of failed bits on multiple SWLs can be stored in the second array. The second array can be deduplicated and sorted later and then output.

[0131] In one embodiment of the present invention, after establishing the physical address array, step 13 may further include:

[0132] Step 26, determining whether the category of the current failure bit is the SBL category, and obtaining the physical address information of all the failure bits having the same vertical coordinate.

[0133] In a specific implementation, the determining whether the category of the current failure bit is the SBL category and obtaining the physical address information of all the failure bits having the same vertical coordinate may include:

[0134] Repeat the following operations to obtain the physical address information of all failed bits belonging to the SBL category: select a failed bit from the physical address array as the current failed bit, calculate the physical address information of 9 consecutive bits in the row direction starting from the current failed bit, and determine whether the physical address information of the 9 consecutive bits in the row direction exists in the acquired physical address information of all failed bits on the die, and if so, store the physical address information of the current failed bit in the third array;

[0135] Repeat the following operations to obtain the physical address information of the failed bits with the same vertical coordinate among the failed bits belonging to the SWL category: compare the horizontal coordinate in each physical address information in the third array with the vertical coordinate in the obtained physical address information of all failed bits on the grain, and obtain the physical address information of all failed bits with the same vertical coordinate respectively.

[0136] Specifically, refer to Fig.28 , after establishing the physical address array, select the failed bit C as the current failed bit, and first calculate the physical address information of the 9 bits that are consecutively adjacent in the row direction starting from the current failed bit C, that is, the 9 failed bits that have the same ordinate as the current failed bit C and whose abscissas are consecutively adjacent. Assuming that the physical address information of the current failed bit C is (x, y), the physical address information of the 9 bits that are consecutively adjacent in the row direction can be (x+1, y), (x+2, y), ..., (x+9, y) in sequence.

[0137] Afterwards, the die failure bit test result file is traversed to determine whether the physical address information of the 9 consecutive adjacent bits in the row direction exists. If so, it indicates that the 9 consecutive adjacent bits in the row direction are all failure bits. At this time, the current failure bit C category is SBL, and the physical address information of the current failure bit C is (x, y) and stored in the third array. In this way, the physical address information of all failure bits belonging to the SBL category can be obtained.

[0138] Next, after deduplication and sorting of the third array, each element in the third array can be traversed, and each element in the third array is compared with the vertical coordinate in the physical address information of each failed bit in the die failure bit test result file. If they are consistent, the physical address information of all failed bits (referred to as failed bits on a SBL) with the same vertical coordinate as the element in the die failure bit test result file is obtained and stored in the fourth array. Thus, the physical address information of failed bits on multiple SBLs can be stored in the fourth array. The fourth array can be removed and sorted later and then output.

[0139] It should be noted that, in actual applications, after the physical address array is established, step 23, step 26 and step 27 may be executed sequentially, and there is no restriction on which step is executed first. For example, step 23, step 26 and step 27 may be executed sequentially, or step 26, step 27 and step 23 may be executed sequentially. The same failure bit may belong to only one category, or may belong to two or more categories.

[0140] Step 27, determine whether there are unclassified failure bits.

[0141] After determining the classification result of the current failure bit, it can be determined whether there is an unclassified failure bit. If there is an unclassified failure bit, an unclassified failure bit can be reselected as the current failure bit, and steps 23 to 27 are repeated until there is no unclassified failure bit. If there is no unclassified failure bit, the failure bit classification process can be terminated.

[0142] In a specific implementation, after determining the classification result of each failed bit on the die, the physical address information of the failed bits contained in each category on the die can be counted, and the corresponding statistical results can be generated. Specifically, by executing the above steps, eight target folders Sbit, DBR, DBC, AB, TriB, QB, SBL, and SWL can be generated to store the classified results, and each folder can include: a .txt file recording the physical address information of the failed bits of the classified die.

[0143] In one embodiment of the present invention, after executing the above steps, the classification result information of the failed bits of all the dies on the wafer can also be counted. That is, the classification results of the failed bits of each die on the entire wafer are counted and the corresponding .png images are generated. For example, Fig.29 This is the statistical result information of the failed bit type Sbit on a certain wafer. Fig.29 , each square in the coordinate system represents a die, the horizontal axis represents the horizontal coordinate of the die, and the vertical axis represents the vertical coordinate of the die. The number in the square represents the number of failed bits of category Sbit on the die at that position. This makes it easier to analyze the wafer process based on the statistical results and determine the cause of product failure.

[0144] The time required for classifying the failed bits using the solution of the present invention is compared with the time required for classifying the failed bits using the existing Excel tool and the time required for classifying the failed bits using the personal experience of engineers. Fig.30 As shown, the existing use of Excel tools to classify the time required for the failed bits on the wafer takes a total of 2 hours, and the use of engineers' personal experience to classify the time required for the failed bits on the wafer takes a total of 5 hours. The use of the scheme of the present invention to classify the time required for the failed bits on the wafer only takes 0.2 hours. It can be seen that the scheme of the present invention can improve the classification efficiency by more than 90% compared with the two existing schemes.

[0145] In addition, the solution of the present invention can also improve the accuracy of failure bit classification, thereby providing an accurate and reliable data source for chip yield analysts to quickly determine the location of defects and judge the cause of failure.

[0146] In order to enable those skilled in the art to better understand and implement the present invention, the device, test system, electronic device and computer-readable storage medium corresponding to the above method are described in detail below.

[0147] Reference Fig.31 The embodiment of the present invention further provides a device 30 for classifying grain failure bits, which may include: an acquisition unit 31, an array establishment unit 32, and a classification unit 33. Among them:

[0148] The acquisition unit 31 is adapted to acquire the physical address information of all failed bits on the die;

[0149] The array establishing unit 32 is adapted to establish a corresponding physical address array based on the physical address information of all failed bits on the die;

[0150] The classification unit 33 is adapted to determine the classification result of the current failure bit;

[0151] The classification unit 33 includes: a first classification subunit 331, adapted to search the physical address array to determine the total number of failed bits in the current failed bit and the surrounding adjacent bits; based on the total number of failed bits in the current failed bit and the surrounding adjacent bits, determine the classification result of the current failed bit.

[0152] In one embodiment, the classification unit 33 may further include: a second classification subunit 332. The second classification subunit 332 is adapted to determine whether the category of the current failure bit is the SWL category, and obtain physical address information of all failure bits with the same horizontal coordinate.

[0153] In another embodiment, the classification unit 33 may further include: a third classification subunit 333. The third classification subunit 333 is adapted to determine whether the category of the current fail bit is the SBL category, and obtain the physical address information of all fail bits with the same ordinate.

[0154] An embodiment of the present invention further provides a computer-readable storage medium on which a computer program is stored. The computer program is executed by a processor to implement the steps of any of the above methods.

[0155] In a specific implementation, the computer-readable storage medium may include: ROM, RAM, magnetic disk or optical disk, etc.

[0156] An embodiment of the present invention further provides an electronic device, comprising a memory and a processor, wherein the memory stores a computer program that can be run on the processor, and the processor executes the steps of any of the above methods when running the computer program.

[0157] Regarding the various modules / units included in the various devices and products described in the above embodiments, they can be software modules / units, or hardware modules / units, or they can be partially software modules / units and partially hardware modules / units. For example, for various devices and products applied to or integrated in a chip, the various modules / units included therein can all be implemented in the form of hardware such as circuits, or at least some of the modules / units can be implemented in the form of software programs, which run on a processor integrated inside the chip, and the remaining (if any) modules / units can be implemented in the form of hardware such as circuits; for various devices and products applied to or integrated in a chip module, the various modules / units included therein can all be implemented in the form of hardware such as circuits, and different modules / units can be located in the same component (such as a chip, circuit module, etc.) or different components of the chip module, or at least some of the modules / units can be implemented in the form of hardware such as circuits. The element can be implemented in the form of a software program, which runs on a processor integrated inside the chip module, and the remaining (if any) modules / units can be implemented in the form of hardware such as circuits; for various devices and products applied to or integrated in the terminal, the various modules / units contained therein can be implemented in the form of hardware such as circuits, and different modules / units can be located in the same component (for example, chip, circuit module, etc.) or in different components in the terminal, or, at least some modules / units can be implemented in the form of a software program, which runs on a processor integrated inside the terminal, and the remaining (if any) modules / units can be implemented in the form of hardware such as circuits.

[0158] Although the present invention is disclosed as above, the present invention is not limited thereto. Any person skilled in the art can make various changes and modifications without departing from the spirit and scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the scope defined by the claims.

Claims

1. A method for classifying grain failure bits, characterized in that: include: Obtaining the physical address information of all failed bits on the die; Based on the physical address information of all failed bits on the die, a corresponding physical address array is established; Determine the classification result of the current failed bit; Determining the classification result of the current failure bit includes: searching the physical address array to determine the total number of failure bits in the current failure bit and surrounding adjacent bits; Based on the total number of failed bits in the current failed bit and surrounding adjacent bits, a classification result of the current failed bit is determined.

2. The method for classifying die failure bits according to claim 1, characterized in that: The searching of the physical address array to determine the total number of failed bits in the current failed bit and surrounding adjacent bits includes: Calculate the physical address information of adjacent bits in the nine-square grid centered on the current failed bit; Based on the physical address information of the current failed bit and the adjacent bits in the nine-square grid centered on the current failed bit, the physical address array is searched to determine the total number of failed bits in the nine-square grid centered on the current failed bit.

3. The method for classifying grain failure bits according to claim 2, characterized in that: The method of searching the physical address array based on the physical address information of the current failed bit and the adjacent bits in the nine-square grid centered on the current failed bit to determine the total number of failed bits in the nine-square grid centered on the current failed bit includes: The counting variable values ​​of each adjacent bit in the nine-square grid centered on the current failed bit are obtained by adopting the following method: when the physical address array contains the physical address information of the first adjacent bit of the current failed bit, the counting variable of the first adjacent bit is set to the first value; otherwise, the counting variable of the first adjacent bit is kept set to the initial value; The count variable values ​​of the failed bits in the nine-square grid centered on the current failed bit are accumulated as the number of failed bits in the nine-square grid centered on the current failed bit.

4. The method for classifying grain failure bits according to claim 3, characterized in that: The first value is 1, and the initial value is 0.

5. The method for classifying grain failure bits according to claim 2 or 3, characterized in that: The determining of the classification result of the current failure bit based on the total number of failure bits in the current failure bit and surrounding adjacent bits includes: Determine a rough category of the current failed bit based on the total number of failed bits in the nine-square grid centered on the current failed bit; Determine the position distribution of each adjacent failed bit relative to the current failed bit within a twenty-five-square grid centered on the current failed bit; Based on the current failure bit and the position distribution of each adjacent failure bit in the twenty-five squares centered on the current failure bit relative to the current failure bit, a final classification result is determined from the coarse category of the current failure bit.

6. The method for classifying die failure bits according to claim 5, characterized in that: The determining of the position distribution of each adjacent failed bit relative to the current failed bit in the twenty-five square grids centered on the current failed bit includes: By searching the physical address array, it is determined whether each adjacent failed bit in the twenty-five squares centered on the current failed bit is a failed bit.

7. The method for classifying die failure bits according to claim 1, wherein: The determining of the classification results of each failure bit includes: It is determined whether the category of the current failure bit is the SWL category, and the physical address information of all the failure bits with the same horizontal coordinate is obtained.

8. The method for classifying die failure bits according to claim 7, characterized in that: The determining whether the category of the current failure bit is the SWL category and obtaining the physical address information of all the failure bits having the same horizontal coordinates includes: Repeat the following operations to obtain the physical address information of all failed bits belonging to the SWL category: select a failed bit from the physical address array as the current failed bit, calculate the physical address information of 9 consecutive bits in the column direction starting from the current failed bit, and determine whether the physical address information of the 9 consecutive bits in the column direction exists in the acquired physical address information of all failed bits on the die, and if so, store the physical address information of the current failed bit in the first array; Repeat the following operations to obtain the physical address information of the failed bits with the same horizontal coordinate among the failed bits belonging to the SWL category: compare the horizontal coordinate in each physical address information in the first array with the horizontal coordinate in the obtained physical address information of all failed bits on the grain, and obtain the physical address information of all failed bits with the same horizontal coordinate respectively.

9. The method for classifying die failure bits according to claim 1, wherein: The determining of the classification results of each failure bit includes: It is determined whether the category of the current failure bit is the SBL category, and the physical address information of all the failure bits with the same ordinate is obtained.

10. The method for classifying die failure bits according to claim 8, wherein: The determining whether the category of the current failure bit is the SBL category and obtaining the physical address information of all the failure bits having the same vertical coordinate includes: Repeat the following operations to obtain the physical address information of all failed bits belonging to the SBL category: select a failed bit from the physical address array as the current failed bit, calculate the physical address information of 9 consecutive bits in the row direction starting from the current failed bit, and determine whether the physical address information of the 9 consecutive bits in the row direction exists in the acquired physical address information of all failed bits on the die, and if so, store the physical address information of the current failed bit in the third array; Repeat the following operations to obtain the physical address information of the failed bits with the same vertical coordinate among the failed bits belonging to the SBL category: compare the vertical coordinate in each physical address information in the third array with the vertical coordinate in the physical address information of all failed bits on the obtained die, and obtain the physical address information of all failed bits with the same vertical coordinate respectively.

11. The method for classifying die failure bits according to claim 1, characterized in that: The obtaining of the physical address information of all failed bits on the die includes: obtaining a die failed bit test result file, and reading the physical address information of all failed bits on the die from the die failed bit test result file.

12. The die failure bit classification method according to claim 1, characterized in that: Also includes: The classification result information of the failed bits of all the dies on the wafer is counted.

13. A device for classifying grain failure bits, characterized in that: include: An acquisition unit, adapted to acquire physical address information of all failed bits on the die; An array establishing unit, adapted to establish a corresponding physical address array based on the physical address information of all failed bits on the die; A classification unit, adapted to determine a classification result of each failed bit; The classification unit comprises: a first classification subunit adapted to search the physical address array to determine the total number of failed bits in the current failed bit and surrounding adjacent bits; Based on the total number of failed bits in the current failed bit and surrounding adjacent bits, a classification result of the current failed bit is determined.

14. The device for classifying die failure bits according to claim 13, characterized in that: The classification unit further includes: a second classification subunit, adapted to determine whether the category of the current failure bit is the SWL category, and to obtain the physical address information of all the failure bits having the same horizontal coordinate.

15. The die failure bit classification device according to claim 13, characterized in that: The classification unit further includes: a third classification subunit, adapted to determine whether the category of the current failure bit is the SBL category, and to obtain the physical address information of all the failure bits having the same vertical coordinate.

16. A computer-readable storage medium having a computer program stored thereon, characterized in that: The computer program is executed by a processor to implement the steps of the method according to any one of claims 1 to 12.

17. An electronic device comprising a memory and a processor, wherein the memory stores a computer program that can be run on the processor, wherein: When the processor runs the computer program, the steps of the method according to any one of claims 1 to 12 are performed.

Citation Information

Cited By

  • Self-supervision enhanced semi-supervised wafer failure prediction method and system

    CN119557571A

  • A failure analysis method and system for static random access memory (SRAM) chips.

    CN122676895A