WO2008010648A1 - Matching method for multiple stuck-at faults diagnosis - Google Patents

Matching method for multiple stuck-at faults diagnosis Download PDF

Info

Publication number
WO2008010648A1
WO2008010648A1 PCT/KR2007/003127 KR2007003127W WO2008010648A1 WO 2008010648 A1 WO2008010648 A1 WO 2008010648A1 KR 2007003127 W KR2007003127 W KR 2007003127W WO 2008010648 A1 WO2008010648 A1 WO 2008010648A1
Authority
WO
WIPO (PCT)
Prior art keywords
candidate
faults
fault
response
vectorwise
Prior art date
Application number
PCT/KR2007/003127
Other languages
French (fr)
Inventor
Sung-Ho Kang
Original Assignee
Industry-Academic Cooperation Foundation, Yonsei University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Industry-Academic Cooperation Foundation, Yonsei University filed Critical Industry-Academic Cooperation Foundation, Yonsei University
Publication of WO2008010648A1 publication Critical patent/WO2008010648A1/en

Links

Classifications

    • GPHYSICS
    • G05CONTROLLING; REGULATING
    • G05BCONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B23/00Testing or monitoring of control systems or parts thereof
    • G05B23/02Electric testing or monitoring
    • G05B23/0205Electric testing or monitoring by means of a monitoring system capable of detecting and responding to faults
    • G05B23/0259Electric testing or monitoring by means of a monitoring system capable of detecting and responding to faults characterized by the response to fault detection
    • G05B23/0275Fault isolation and identification, e.g. classify fault; estimate cause or root of failure
    • G05B23/0281Quantitative, e.g. mathematical distance; Clustering; Neural networks; Statistical analysis

Definitions

  • the present invention relates to a semiconductor testing method, and more particularly, to a matching algorithm for diagnosing multiple stuck-at faults.
  • the fault diagnosis refers to a process of deducing locations of defects and kinds of defects causing an operational error.
  • An exact fault diagnosis can identify both design and process errors, which results in a yield improvement. Therefore, it is important to develop an effective fault diagnosis method for improving the quality of chips and reducing fabrication costs.
  • a rank matching algorithm generally assumes the single fault assumption. While the single fault assumption simplifies the diagnosis process, it leads to problems with multiple or complex faults.
  • the operations of a semiconductor integrated circuit device are simulated at a switch level using a test vector set in an apparatus for diagnosing faults of the semiconductor integrated circuit device, and thus, simulation results are generated.
  • the semiconductor integrated circuit device is tested using the test vector set to generate a test result.
  • a first set of combinations of circuit elements is defined based on a circuit data of the test circuit device.
  • the semiconductor circuit device is composed of the circuit elements.
  • a final set of candidate faults is estimated from the first set of combinations based on the simulation result and the test result for each of the test vectors, and then, the final set of candidate faults is outputted.
  • FIG. 1 is a flowchart illustrating a process of diagnosing multiple stuck-at faults according to an embodiment of the present invention
  • FIG. 2 is a diagram showing an example of a process of ranking candidate faults
  • FIG. 3 is a diagram showing an example of a process of determining a final set of candidate faults.
  • the present invention has been developed to solve problems of the conventional art and to lessen the problem in that the time to perform a fault simulation using a multiple stuck-at fault simulator is long.
  • the present invention can greatly reduce the simulating time by using a single stuck-at fault simulator.
  • fault scores and a vectorwise intersection table are generated by outputting the simulation result, and positions of the faults are determined based on the fault scores and the vectorwise intersection table. Therefore, the time for storing and searching for the simulation result is not required, and hardware for storing the simulation results is also not required.
  • the present invention provides a matching algorithm for diagnosing multiple stuck-at faults using a single stuck-at fault simulator, and can diagnose the multiple stuck-at faults using a small number of candidate faults through a ranking method for improving identification between the multiple stuck-at faults.
  • a matching method of diagnosing multiple stuck-at faults including: performing a single stuck-at fault simulation using a circuit design file, test patterns, and tester response results of a faulty chip; calculating scores of candidate faults during the performing of the single stuck-at fault simulation; generating a vectorwise intersection table during the performing of the single stuck-at fault simulation; and determining a final set of candidate faults using the scores of the candidate faults and the vectorwise intersection table after completing the single stuck-at fault simulation,
  • the faults may be classified as a vectorwise intersection, an intersection, a misprediction, a nonprediction, and a no error, and the calculation of the scores may be performed for each of the classifications.
  • the patterns showing the vectorwise intersections may be stored by the fault unit to generate the vectorwise intersection table.
  • the vectorwise intersection in the calculation of the candidate fault scores may be a case where errors are generated in both the tester response and the simulation response, and the score may be increased by the number of all primary outputs.
  • the intersection in the calculation of the candidate fault scores may be a case where errors are generated in both the tester response and the simulation response and the errors do not coincide with each other, and the score may be increased by the number of primary outputs showing the errors in both the tester response and the simulation response and the score is reduced by the number of primary outputs showing the errors in one of the tester response and the simulation response.
  • the misprediction in the calculation of the candidate fault scores may be a case where an error is not shown in the tester response and an error is shown in the simulation response, and the score may be reduced by the number of primary outputs showing the errors in the simulation response.
  • the nonprediction in the calculation of the candidate fault scores may be a case where an error is not shown in the simulation response and an error is shown in the tester response, and the score may be reduced by the number of primary outputs showing the errors in the tester response.
  • the no error in the calculation of the candidate fault scores may be a case where no error is shown in both the tester response and the simulation response, and the score may not be changed.
  • the determination of the final candidate faults may include: (a) arranging the candidate faults in an order of scores; (b) selecting the candidate fault mostly showing the vectorwise intersection portion among the candidate faults having the highest score so as to be included in a final set of the candidate faults; (c) when the test result shows an error and there is no candidate fault having the vectorwise intersection portion with respect to the fail pattern in the final set of the candidate faults, the candidate fault having the vectorwise intersection portion to the pattern and having the highest score in the final set of the candidate faults is included; (d) repeating operation (c) until the faults having the vectorwise intersection portions with respect to all of the tester response showing the errors are included in the final set of the candidate faults.
  • a single stuck-at fault simulator is used, and the simulating time can be reduced.
  • the simulation result is not stored, hardware for storing the simulation result is not required, and thus, the time for storing and searching for the simulation result is not required. Even if the plurality of multiple stuck-at faults exists, the multiple stuck-at faults can be exactly diagnosed from a few sets of candidate faults using an effective fault diagnosing algorithm.
  • FIG. 1 illustrates a flowchart of the matching method according to an embodiment of the present invention.
  • a design file of a circuit, a test pattern, and a test response result of a chip in which an error occurs are input (operation 100).
  • a single stuck-at fault simulation is performed when the above elements are input (110), and ranks of each candidate fault is calculated during the single stuck-at fault simulation (111) so as to generate a vectorwise intersection table (112).
  • a final set of candidate faults is determined based on the ranks of the candidate faults and the vectorwise intersection table (120), and then, a final fault diagnosis result is output (130).
  • the process of calculating the ranks of the candidate faults (111) is performed during the single stuck-at fault simulation process (110) that is performed in a double-loop form, that is, simulating all of the patterns with respect to a selected fault in a fault list.
  • the simulation for a pattern is performed, the score is calculated using the matching algorithm, and the scores of all the patterns are summed to determine the score of the selected fault.
  • the faults are classified as the following five kinds, and the calculation method is determined.
  • intersection Errors occur in both the response of the tester and the response of the simulation, however, do not completely coincide with each other.
  • the score is increased by the number of primary outputs, in which the errors occur in both the tester and the simulation, and the score is reduced by the number of the primary outputs, in which the error occurs only in one of the tester and the simulation.
  • misprediction The error does not occur in the response of the tester, however, the error occurs in the response of the simulation. In this case, the score is reduced by the number of primary outputs, in which the error occurs in the response of the simulation.
  • nonprediction The error does not occur in the response of the simulation, however, occurs in the response of the tester. The score is reduced by the number of the primary outputs, in which the error occurs in the response of the tester.
  • the process of calculating the score will be described in detail with reference to FIG. 2.
  • the values shown in FIG. 2 are signature values, in which O' represents that there is no error and '1' represents that there is an error.
  • the signature values of the tester response and the candidate fault No. 1 are both 00110, which represents errors, and the same type values are shown with respect to all primary outputs, and thus, the candidate fault No. 1 is calculated as the vectorwise intersection.
  • this system of the current embodiment includes five main primary outputs, the candidate fault No. 1 increases a score of 5.
  • a candidate fault No. 3 is calculated as the intersection since the errors are shown in both the tester response and the simulation response of the candidate fault, however, the errors do not coincide with each other.
  • the candidate fault No. 1 has a score of 5
  • the candidate fault No. 2 has a score of - 6
  • the candidate fault No. 3 has a score of - 4. Therefore, the candidate fault No. 1 can be determined to be similar to the actual defect since the candidate fault 1 has the highest score.
  • test patterns showing the vectorwise intersections are stored by the fault unit to generate a vectorwise intersection table that is used when the final candidate fault is determined with the scores.
  • the scores representing the similarity between the tester responses and each of the candidate faults and the vectorwise intersection table aid to determine the final set of candidate fault.
  • the final set of the candidate fault is determined based on the above two standards.
  • the final set of the candidate faults is determined through following processes.
  • the candidate faults are arranged in an order of the scores.
  • the candidate fault mostly showing the vectorwise intersections is selected among the candidate faults having the highest score, and then, the selected candidate fault is included in the final set of the candidate faults.
  • the candidate fault having the vectorwise intersection with respect to the pattern and having the highest score is included in the final set of the candidate faults.
  • the circuit has five candidate faults, and score of each of the candidate faults is determined through the process of calculating scores of the candidate faults (111) as described in the above paragraph (1 ).
  • a sign of H represents the vectorwise intersection.
  • the patterns stored in the vectorwise intersection must be the patterns showing the errors in the tester responses.
  • the candidate fault 1 has the highest score, and thus, the fault No. 1 is selected. However, if there are faults having the highest scores, the fault mostly having the vectorwise intersection is selected. In addition, if there are faults having the vectorwise intersection that is the same as each other, all of the candidate faults are included in the final set of the candidate faults. Then, in a third operation, the fault No. 4 showing the vectorwise intersection with respect to the pattern No. 3 is included in the final set of the candidate faults. The final set of the candidate faults that includes the fault No. 1 and the fault No. 4, and the diagnosis result is output.

Abstract

Provided is a matching method of diagnosing multiple stuck-at faults, which can accurately diagnose the multiple stuck-at faults using a single stuck-at fault simulator. The matching method includes calculating scores of candidate faults; generating a vectorwise intersection table; and determining a final set of candidate faults. The operations of calculating scores of the candidate faults and generating the vectorwise intersection table are serially performed during the simulation. The faults are classified as a vectorwise intersection, an intersection, a misprediction, a nonprediction, and a no error, and the calculation of the scores is performed for each of the classifications.

Description

MATCHING METHOD FOR MULTIPLE STUCK-AT FAULTS DIAGNOSIS
TECHNICAL FIELD
The present invention relates to a semiconductor testing method, and more particularly, to a matching algorithm for diagnosing multiple stuck-at faults.
BACKGROUND ART
As the complexity of VLSI (Very Large Scale Integration) has increased, and thus, the demands for diagnosing faults has also increased. The fault diagnosis refers to a process of deducing locations of defects and kinds of defects causing an operational error. An exact fault diagnosis can identify both design and process errors, which results in a yield improvement. Therefore, it is important to develop an effective fault diagnosis method for improving the quality of chips and reducing fabrication costs.
As such, a rank matching algorithm generally assumes the single fault assumption. While the single fault assumption simplifies the diagnosis process, it leads to problems with multiple or complex faults.
According to the invention of Korean Registered Patent No. 10-0334473, the operations of a semiconductor integrated circuit device are simulated at a switch level using a test vector set in an apparatus for diagnosing faults of the semiconductor integrated circuit device, and thus, simulation results are generated. In addition, the semiconductor integrated circuit device is tested using the test vector set to generate a test result. Then, a first set of combinations of circuit elements is defined based on a circuit data of the test circuit device. Here, the semiconductor circuit device is composed of the circuit elements. A final set of candidate faults is estimated from the first set of combinations based on the simulation result and the test result for each of the test vectors, and then, the final set of candidate faults is outputted.
In the thesis of "Poirot: Applications of a logic fault diagnosis tool / Venkataraman, S.; Drummonds, S. B. / Design & Test of Computers, IEEE Volume 18, Issue 1 , Jan. -Feb. 2001 Page(s): 19-30", the type of faults is diagnosed by counting the cases of Vectorwise intersection, Intersection, Nonprediction, and Misprediction, and then, the candidate fault is determined to coincide with the actual defect when there are a lot of Vectorwise intersections. Then, the fault is diagnosed in the order of the Intersection, Nonprediction, and Misprediction.
BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a flowchart illustrating a process of diagnosing multiple stuck-at faults according to an embodiment of the present invention;
FIG. 2 is a diagram showing an example of a process of ranking candidate faults; and
FIG. 3 is a diagram showing an example of a process of determining a final set of candidate faults.
DETAILED DESCRIPTION OF THE INVENTION
TECHNICAL PROBLEM
The present invention has been developed to solve problems of the conventional art and to lessen the problem in that the time to perform a fault simulation using a multiple stuck-at fault simulator is long. The present invention can greatly reduce the simulating time by using a single stuck-at fault simulator. In addition, fault scores and a vectorwise intersection table are generated by outputting the simulation result, and positions of the faults are determined based on the fault scores and the vectorwise intersection table. Therefore, the time for storing and searching for the simulation result is not required, and hardware for storing the simulation results is also not required.
Therefore, the present invention provides a matching algorithm for diagnosing multiple stuck-at faults using a single stuck-at fault simulator, and can diagnose the multiple stuck-at faults using a small number of candidate faults through a ranking method for improving identification between the multiple stuck-at faults.
TECHNICAL SOLUTION
According to an aspect of the present invention, there is provided a matching method of diagnosing multiple stuck-at faults, the method including: performing a single stuck-at fault simulation using a circuit design file, test patterns, and tester response results of a faulty chip; calculating scores of candidate faults during the performing of the single stuck-at fault simulation; generating a vectorwise intersection table during the performing of the single stuck-at fault simulation; and determining a final set of candidate faults using the scores of the candidate faults and the vectorwise intersection table after completing the single stuck-at fault simulation,
In the calculating of the candidate faults scores, the faults may be classified as a vectorwise intersection, an intersection, a misprediction, a nonprediction, and a no error, and the calculation of the scores may be performed for each of the classifications. In the generating of the vectorwise intersection table, the patterns showing the vectorwise intersections may be stored by the fault unit to generate the vectorwise intersection table. The vectorwise intersection in the calculation of the candidate fault scores may be a case where errors are generated in both the tester response and the simulation response, and the score may be increased by the number of all primary outputs.
The intersection in the calculation of the candidate fault scores may be a case where errors are generated in both the tester response and the simulation response and the errors do not coincide with each other, and the score may be increased by the number of primary outputs showing the errors in both the tester response and the simulation response and the score is reduced by the number of primary outputs showing the errors in one of the tester response and the simulation response.
The misprediction in the calculation of the candidate fault scores may be a case where an error is not shown in the tester response and an error is shown in the simulation response, and the score may be reduced by the number of primary outputs showing the errors in the simulation response.
The nonprediction in the calculation of the candidate fault scores may be a case where an error is not shown in the simulation response and an error is shown in the tester response, and the score may be reduced by the number of primary outputs showing the errors in the tester response.
The no error in the calculation of the candidate fault scores may be a case where no error is shown in both the tester response and the simulation response, and the score may not be changed. The determination of the final candidate faults may include: (a) arranging the candidate faults in an order of scores; (b) selecting the candidate fault mostly showing the vectorwise intersection portion among the candidate faults having the highest score so as to be included in a final set of the candidate faults; (c) when the test result shows an error and there is no candidate fault having the vectorwise intersection portion with respect to the fail pattern in the final set of the candidate faults, the candidate fault having the vectorwise intersection portion to the pattern and having the highest score in the final set of the candidate faults is included; (d) repeating operation (c) until the faults having the vectorwise intersection portions with respect to all of the tester response showing the errors are included in the final set of the candidate faults.
ADVANTAGEOUS EFFECTS
According to the present invention, a single stuck-at fault simulator is used, and the simulating time can be reduced. In addition, since the simulation result is not stored, hardware for storing the simulation result is not required, and thus, the time for storing and searching for the simulation result is not required. Even if the plurality of multiple stuck-at faults exists, the multiple stuck-at faults can be exactly diagnosed from a few sets of candidate faults using an effective fault diagnosing algorithm.
BEST MODE
Hereinafter, embodiments of a matching method of diagnosing multiple stuck-at faults according to the present invention will be described with reference to accompanying drawings. FIG. 1 illustrates a flowchart of the matching method according to an embodiment of the present invention. For performing a fault diagnosis, a design file of a circuit, a test pattern, and a test response result of a chip in which an error occurs are input (operation 100). A single stuck-at fault simulation is performed when the above elements are input (110), and ranks of each candidate fault is calculated during the single stuck-at fault simulation (111) so as to generate a vectorwise intersection table (112). After completing the single stuck-at fault simulation, a final set of candidate faults is determined based on the ranks of the candidate faults and the vectorwise intersection table (120), and then, a final fault diagnosis result is output (130).
Hereinafter, technical elements in each of the above operations will be described in more detail as follows.
(1 ) calculating ranks of the candidate faults (111 )
The process of calculating the ranks of the candidate faults (111) is performed during the single stuck-at fault simulation process (110) that is performed in a double-loop form, that is, simulating all of the patterns with respect to a selected fault in a fault list. The simulation for a pattern is performed, the score is calculated using the matching algorithm, and the scores of all the patterns are summed to determine the score of the selected fault.
According to the matching method of the current embodiment, the faults are classified as the following five kinds, and the calculation method is determined.
(a) vectorwise intersection : Errors occur both in the response of the tester and in the response of the simulation, and coincide with each other. In this case, the score is increased by the number of primary outputs.
(b) intersection : Errors occur in both the response of the tester and the response of the simulation, however, do not completely coincide with each other. The score is increased by the number of primary outputs, in which the errors occur in both the tester and the simulation, and the score is reduced by the number of the primary outputs, in which the error occurs only in one of the tester and the simulation.
(c) misprediction : The error does not occur in the response of the tester, however, the error occurs in the response of the simulation. In this case, the score is reduced by the number of primary outputs, in which the error occurs in the response of the simulation. (d) nonprediction : The error does not occur in the response of the simulation, however, occurs in the response of the tester. The score is reduced by the number of the primary outputs, in which the error occurs in the response of the tester.
(e) no error : The errors do not occur both in the response of the tester and the response of the simulation. The score does not change.
In a case of the vectorwise intersection, weighed values are applied as the number of primary outputs, and thus, a size of the circuit can be dealt with flexibly. In addition, even when the responses of the tester and the simulation coincide with each other, the vectorwise intersection and the no error area are distinguished according to the existence of the fault. Therefore, a problem in that the fault that less propagates has a higher score and a higher rank, in the no error area can be prevented.
The process of calculating the score will be described in detail with reference to FIG. 2. The values shown in FIG. 2 are signature values, in which O' represents that there is no error and '1' represents that there is an error. With respect to a test pattern 1 , the signature values of the tester response and the candidate fault No. 1 are both 00110, which represents errors, and the same type values are shown with respect to all primary outputs, and thus, the candidate fault No. 1 is calculated as the vectorwise intersection. In addition, since this system of the current embodiment includes five main primary outputs, the candidate fault No. 1 increases a score of 5. With respect to the test pattern No. 1 , a candidate fault No. 2 is calculated as the nonprediction since there is an error in the tester response and there is no error in the simulation response of the candidate fault. In this case, since the tester response shows the error twice, a score of 2 is reduced. Then, with respect to the test pattern No. 1 , a candidate fault No. 3 is calculated as the intersection since the errors are shown in both the tester response and the simulation response of the candidate fault, however, the errors do not coincide with each other.
Here, since the error is shown at the same output end once, a score of 1 is increased, and then, since the error is shown in one of the tester response and the simulation response twice, a score of 2 is reduced, and thus, a score of 1 is finally reduced. When the sum of the scores with respect to all of the test patterns is calculated as described above, the candidate fault No. 1 has a score of 5, the candidate fault No. 2 has a score of - 6, and the candidate fault No. 3 has a score of - 4. Therefore, the candidate fault No. 1 can be determined to be similar to the actual defect since the candidate fault 1 has the highest score.
(2) vectorwise intersection table (112)
During the single stuck-at fault simulation process (110), if the vectorwise intersection is shown, the test patterns showing the vectorwise intersections are stored by the fault unit to generate a vectorwise intersection table that is used when the final candidate fault is determined with the scores.
(3) determination of the final set of candidate faults (120) After the single stuck-at fault simulation process (110) is completed, the scores representing the similarity between the tester responses and each of the candidate faults and the vectorwise intersection table aid to determine the final set of candidate fault. The final set of the candidate fault is determined based on the above two standards.
The final set of the candidate faults is determined through following processes.
1. The candidate faults are arranged in an order of the scores.
2. The candidate fault mostly showing the vectorwise intersections is selected among the candidate faults having the highest score, and then, the selected candidate fault is included in the final set of the candidate faults.
3. In a case where the candidate fault, showing the error in the test response and no vectorwise intersection with respect to that pattern, is not in the final set of the candidate faults, the candidate fault having the vectorwise intersection with respect to the pattern and having the highest score is included in the final set of the candidate faults.
4. The above process 3 is repeated until the candidate faults having vectorwise intersections with respect to the test responses showing the errors are included in the final set of the candidate faults. If there is no candidate fault having the vectorwise intersection with respect to the test response, this process is omitted
The above operations are described with reference to FIG. 3. In FIG. 3, the circuit has five candidate faults, and score of each of the candidate faults is determined through the process of calculating scores of the candidate faults (111) as described in the above paragraph (1 ). In FIG. 3, a sign of H represents the vectorwise intersection. Hence, since the errors must be shown in both the tester response and the simulation response in the vectorwise intersection, the patterns stored in the vectorwise intersection must be the patterns showing the errors in the tester responses. When the faults are arranged in an order of the scores through a first process, the faults are arranged as shown in FIG. 3. In a second process, the fault mostly having the vectorwise intersection is selected among the faults having the highest score. In the example shown in FIG. 3, the candidate fault 1 has the highest score, and thus, the fault No. 1 is selected. However, if there are faults having the highest scores, the fault mostly having the vectorwise intersection is selected. In addition, if there are faults having the vectorwise intersection that is the same as each other, all of the candidate faults are included in the final set of the candidate faults. Then, in a third operation, the fault No. 4 showing the vectorwise intersection with respect to the pattern No. 3 is included in the final set of the candidate faults. The final set of the candidate faults that includes the fault No. 1 and the fault No. 4, and the diagnosis result is output. Multiple stuck-at faults cannot be diagnosed by simply selecting the candidate faults having the highest score because even if one fault is diagnosed as the first rank, other faults may be located at lower ranks. In order to solve the above problem, even if the candidate fault is located at the low rank, it can be included in the final set of the candidate faults when the vectorwise intersection with respect to the pattern that is not described by the faults in the set of the candidate faults is there. Through the above processes, the final diagnosis result is output.

Claims

1. A matching method of diagnosing multiple stuck-at faults, the method comprising: performing a single stuck-at fault simulation using a circuit design file, test patterns, and tester response results of a faulty chip; calculating scores of candidate faults during the performing of the single stuck-at fault simulation; generating a vectorwise intersection table during the performing of the single stuck-at fault simulation; and determining a final set of candidate faults using the scores of the candidate faults and the vectorwise intersection table after completing the single stuck-at fault simulation, wherein in the calculating of the candidate faults scores, the faults are classified as a vectorwise intersection, an intersection, a misprediction, a nonprediction, and a no error, and the calculation of the scores is performed for each of the classifications, in the generating of the vectorwise intersection table, the patterns showing the vectorwise intersections are stored by the fault unit to generate the vectorwise intersection table.
2. The matching method of claim 1 , wherein the vectorwise intersection in the calculation of the candidate fault scores is a case where errors are generated in both the tester response and the simulation response, and the score is increased by the number of all primary outputs.
3. The matching method of claim 1 , wherein the intersection in the calculation of the candidate fault scores is a case where errors are generated in both the tester response and the simulation response and the errors do not coincide with each other, and the score is increased by the number of primary outputs showing the errors in both the tester response and the simulation response and the score is reduced by the number of primary outputs showing the errors in one of the tester response and the simulation response.
4. The matching method of claim 1 , wherein the misprediction in the calculation of the candidate fault scores is a case where an error is not shown in the tester response and an error is shown in the simulation response, and the score is reduced by the number of primary outputs showing the errors in the simulation response.
5. The matching method of claim 1 , wherein the nonprediction in the calculation of the candidate fault scores is a case where an error is not shown in the simulation response and an error is shown in the tester response, and the score is reduced by the number of primary outputs showing the errors in the tester response.
6. The matching method of claim 1 , wherein the no error in the calculation of the candidate fault scores is a case where no error is shown in both the tester response and the simulation response, and the score is not changed.
7. The matching method of claim 1 , wherein the determination of the final candidate faults comprises:
(a) arranging the candidate faults in an order of scores; (b) selecting the candidate fault mostly showing the vectorwise intersection portion among the candidate faults having highest score so as to be included in a final set of the candidate faults;
(c) when the test result shows an error and there is no candidate fault having the vectorwise intersection portion with respect to the pattern showing fail in the final set of the candidate faults, the candidate fault having the vectorwise intersection portion to the pattern and having the highest score in the final set of the candidate faults is included;
(d) repeating operation (c) until the faults having the vectorwise intersection portions with respect to all of the tester response showing the errors are included in the final set of the candidate faults.
PCT/KR2007/003127 2006-07-21 2007-06-27 Matching method for multiple stuck-at faults diagnosis WO2008010648A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
KR1020060068415A KR100713206B1 (en) 2006-07-21 2006-07-21 Matching method for multiple stuck-at faults diagnosis
KR10-2006-0068415 2006-07-21

Publications (1)

Publication Number Publication Date
WO2008010648A1 true WO2008010648A1 (en) 2008-01-24

Family

ID=38269353

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2007/003127 WO2008010648A1 (en) 2006-07-21 2007-06-27 Matching method for multiple stuck-at faults diagnosis

Country Status (2)

Country Link
KR (1) KR100713206B1 (en)
WO (1) WO2008010648A1 (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9274884B2 (en) * 2012-10-10 2016-03-01 HGST Netherlands B.V. Encoding and decoding data to accommodate memory cells having stuck-at faults
KR101390319B1 (en) * 2012-10-17 2014-04-30 연세대학교 산학협력단 Apparatus and method for diagnosing failure of circuit
US8943388B2 (en) 2012-12-12 2015-01-27 HGST Netherlands B.V. Techniques for encoding and decoding using a combinatorial number system
CN112512762B (en) * 2018-07-31 2023-10-20 日产自动车株式会社 Abnormality determination device and abnormality determination method

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5539652A (en) * 1995-02-07 1996-07-23 Hewlett-Packard Company Method for manufacturing test simulation in electronic circuit design
US6461882B2 (en) * 2000-06-19 2002-10-08 Advantest Corporation Fault simulation method and fault simulator for semiconductor integrated circuit
US6790680B1 (en) * 2002-01-17 2004-09-14 Advanced Micro Devices, Inc. Determining a possible cause of a fault in a semiconductor fabrication process

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100630722B1 (en) * 2004-12-04 2006-10-02 삼성전자주식회사 An efficient matching algorithm based on number of primary outputs

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5539652A (en) * 1995-02-07 1996-07-23 Hewlett-Packard Company Method for manufacturing test simulation in electronic circuit design
US6461882B2 (en) * 2000-06-19 2002-10-08 Advantest Corporation Fault simulation method and fault simulator for semiconductor integrated circuit
US6790680B1 (en) * 2002-01-17 2004-09-14 Advanced Micro Devices, Inc. Determining a possible cause of a fault in a semiconductor fabrication process

Also Published As

Publication number Publication date
KR100713206B1 (en) 2007-05-02

Similar Documents

Publication Publication Date Title
Guo et al. A technique for fault diagnosis of defects in scan chains
US5515384A (en) Method and system of fault diagnosis of application specific electronic circuits
US5570376A (en) Method and apparatus for identifying faults within a system
JP5270458B2 (en) Fault location estimation device
EP0222392A2 (en) Method for test generation
JPH10312406A (en) Failure diagnostic device for integrated circuit and recording medium for the device
US7139948B2 (en) Method for determining the impact on test coverage of scan chain parallelization by analysis of a test set for independently accessible flip-flops
Mehta et al. Timing-aware multiple-delay-fault diagnosis
WO2008010648A1 (en) Matching method for multiple stuck-at faults diagnosis
US8402421B2 (en) Method and system for subnet defect diagnostics through fault compositing
Ye et al. Diagnose failures caused by multiple locations at a time
US6662328B1 (en) Method of making logic devices
US20060156100A1 (en) Test wrapper including integrated scan chain for testing embedded hard macro in an integrated circuit chip
Mhamdi et al. Cell-aware diagnosis of customer returns using Bayesian inference
Lee et al. An efficient diagnosis-aware pattern generation procedure for transition faults
US10338137B1 (en) Highly accurate defect identification and prioritization of fault locations
US6876934B2 (en) Method for determining fault coverage from RTL description
Pomeranz et al. Location of stuck-at faults and bridging faults based on circuit partitioning
US7500165B2 (en) Systems and methods for controlling clock signals during scan testing integrated circuits
Pomeranz et al. $ z $-Diagnosis: A Framework for Diagnostic Fault Simulation and Test Generation Utilizing Subsets of Outputs
Pomeranz New Targets for Diagnostic Test Generation
Yamazaki et al. Diagnosing resistive open faults using small delay fault simulation
Takahashi et al. BIST based fault diagnosis using ambiguous test set
Nandakumar et al. Improved Chain Diagnosis Methodology for Clock and Control Signal Defect Identification
Nandakumar et al. High Throughput Multiple Device Chain Diagnosis Methodology for Clock and Control Line Defects

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 07768502

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

NENP Non-entry into the national phase

Ref country code: RU

122 Ep: pct application non-entry in european phase

Ref document number: 07768502

Country of ref document: EP

Kind code of ref document: A1