Abstract
In order to meet the demand of test points selection on higher speed, a new test points selection algorithm based on simplified entropy and multidimensional search is proposed. With the proposed algorithm, statistic results, instead of the complex entropy calculation, are utilized to estimate the order of entropy. In addition, multidimensional search method is adopted to find potential test points sets that can isolate the potential faults. The proposed method is also adaptive to the complexity of fault dictionary. In each iteration of the proposed algorithm, the dimension of multidimensional search could be changed according to the complexity of fault dictionary. Statistical experiments have shown that the proposed algorithm is more efficient in finding local optimum sets of test points compared with other test points selection algorithms.
Sign-in/Register to access full text options 
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 callMore From: Journal of Computational and Theoretical Nanoscience
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.
