{"title":"多加权随机lfsr的片上测试嵌入","authors":"D. Kagaris, S. Tragoudas, Amitava Majumdar","doi":"10.1109/DFTVS.1998.732160","DOIUrl":null,"url":null,"abstract":"We present for the first time a systematic approach for partitioning deterministic test set into subsets so that multiple weight-sets, one weight-set per subset, are generated for efficient Weighted Random LFSR Test Pattern Generation. The basic partitioning criterion is the maximum Hamming distance between any two test patterns in the same set. The number of test patterns within each subset is also taken into consideration. The proposed tools make use of optimal partitioning algorithms. Experimental results clearly indicate the effectiveness of the proposed scheme.","PeriodicalId":245879,"journal":{"name":"Proceedings 1998 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (Cat. No.98EX223)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On-chip test embedding for multi-weighted random LFSRs\",\"authors\":\"D. Kagaris, S. Tragoudas, Amitava Majumdar\",\"doi\":\"10.1109/DFTVS.1998.732160\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present for the first time a systematic approach for partitioning deterministic test set into subsets so that multiple weight-sets, one weight-set per subset, are generated for efficient Weighted Random LFSR Test Pattern Generation. The basic partitioning criterion is the maximum Hamming distance between any two test patterns in the same set. The number of test patterns within each subset is also taken into consideration. The proposed tools make use of optimal partitioning algorithms. Experimental results clearly indicate the effectiveness of the proposed scheme.\",\"PeriodicalId\":245879,\"journal\":{\"name\":\"Proceedings 1998 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (Cat. No.98EX223)\",\"volume\":\"71 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-11-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1998 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (Cat. No.98EX223)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DFTVS.1998.732160\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1998 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (Cat. No.98EX223)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DFTVS.1998.732160","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On-chip test embedding for multi-weighted random LFSRs
We present for the first time a systematic approach for partitioning deterministic test set into subsets so that multiple weight-sets, one weight-set per subset, are generated for efficient Weighted Random LFSR Test Pattern Generation. The basic partitioning criterion is the maximum Hamming distance between any two test patterns in the same set. The number of test patterns within each subset is also taken into consideration. The proposed tools make use of optimal partitioning algorithms. Experimental results clearly indicate the effectiveness of the proposed scheme.