Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital logic testing
Reexamination Certificate
2005-09-06
2005-09-06
Decady, Albert (Department: 2133)
Error detection/correction and fault detection/recovery
Pulse or data error handling
Digital logic testing
C714S742000, C324S765010
Reexamination Certificate
active
06941497
ABSTRACT:
An N2algorithm for optimizing correlated events, applicable to the optimization of the detection of redundant tests and inefficient tests (RIT's), is disclosed. This algorithm represents a set of N tests with L defects as N L-dimensional correlation vectors. The N2algorithm optimizes in terms of the minimum set of vectors, and the set of vectors that take the minimum time to detect the L defects. The minimum set optimization determines a set of vectors (tests) that contains the minimum number of vectors (tests) by analyzing the correlation among the N vectors. This minimum set optimization provides the minimum test set containing all defects in an algorithm that takes O(N2) operations. The minimum time optimization determines a sequence of vectors (tests) that will detect the defects in a minimum amount of time. Taking into the account of the different execution time of each vector (test), the algorithm analyzes the complicated correlation among the vectors (tests) and gives an optimized sequence of vectors (tests) within O(N2) operations. The optimized sequence of vectors (tests) takes a minimum amount of time to find all the defects.
REFERENCES:
patent: 5345450 (1994-09-01), Saw et al.
patent: 5935264 (1999-08-01), Nevill et al.
patent: 6256593 (2001-07-01), Damon et al.
patent: 6782501 (2004-08-01), Distler et al.
patent: 6810372 (2004-10-01), Unnikrishnan et al.
patent: 1132749 (2001-09-01), None
Coudert, Olivier, “On Solving Covering Problems”, 33rd Design Automation Conference, Proceedings 1996 (IEEE Cat. No.96CH35932), Proceedings of 33rd Design Automation Conference, Las Vegas, NV, USA, Jun. 3-7, 1996, New York, NY, USA, ACM, USA, pp. 197-202. XP002246-016 ISBN: 0-89791-779-0.
Fallah, Farzan et al, “Solving Covering Problems Using LPR-Based Lower Bounds”, IEEE Trans. Very Large Scale Integr. (VLSI) Syst. (USA), IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Feb. 2000, IEEE, USA, vol. 8, No. 1, pp. 9-17, XP002246015 ISSN: 1063-8210.
Coudert, Olivier, “Solving Graph Optimization Problems with ZBDDs”, European Design and Test Conference, 1997, ED&TC 97, Proceedings Paris, France Mar. 17-20, 1997, Los Alamitos, CA, USA, IEEE Comput. Soc, US, pp. 224-228. XP010218503 ISBN: 0-8186-7786-4.
Brosa, Anna M et al, “On Maximizing the Coverage of Catastrophic and Parametric Faults”, European Test Workshop 1999 (CAT. No.PR00390), European Test Workshop 1999, Constance, Germany, May 25-28, 1999, 1999, Los Alamitos, CA, USA, IEEE Comput. Soc, USA, pp. 123-128. XP002246017 ISBN: 0-7695-0390-X.
Stirrat Susan L.
Wu Kang
Abraham Esaw
Agilent Technologie,s Inc.
De'cady Albert
LandOfFree
N-squared algorithm for optimizing correlated events does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with N-squared algorithm for optimizing correlated events, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and N-squared algorithm for optimizing correlated events will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3413396