Test Cost Reduction for VLSI Adaptive Test With K-Nearest Neighbor Classification Algorithm

IEEE Transactions on Circuits and Systems II: Express Briefs(2024)

引用 0|浏览10
暂无评分
摘要
Ensuring the impeccable quality of integrated circuits (ICs) is of utmost importance to the customers. However, the increasing scaling of advanced nanoscale circuits has resulted in also increased cost of tests. In order to optimize test cost without compromising IC quality, it is imperative to reduce test time. Addressing the issue of prolonged test duration, associated with conventional full-pattern tests approaches, this paper introduces a novel and efficient pattern selection method known as stepwise k-nearest neighbors (KNN). By harnessing the power of a classification model, this method selectively identifies and applies only the most potent patterns, that are likely to lead to test failures. This approach dramatically expedites the testing process, resulting in substantial time savings. Experimental results showcase an impressive 27% enhancement in the accuracy of the proposed approach compared to Support Vector Machine (SVM) techniques. This signifies the effectiveness and superiority of the presented method in enhancing both the efficiency and reliability of IC testing.
更多
查看译文
关键词
VLSI test,machine learning (ML),adaptive test,circuit under test (CUT),automatic test pattern generation (ATPG)
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要