Abstract

An important problem that arises in the area of fault diagnosis and circuit testing is the analog test point selection (ATPS), which is known to be NP-hard. In this paper, we present a new approach for the ATPS problem based on greedy randomized adaptive search procedure (GRASP), with the objective of overcoming the shortcoming of the greedy algorithms which are easily getting trapped into local optima. The proposed method first generates a feasible test point set by introducing randomness into greedy algorithm, and then a local search algorithm is designed to further improve the quality of the test point set got before. The efficiency of the proposed algorithm is demonstrated by a benchmark circuit. Results indicate that the proposed method, compared with other ATPS methods, more efficiently and more accurately finds the optimum set of test points.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.