{"title":"用于组合电路的15值快速测试发生器","authors":"S.J. Hong","doi":"10.1109/ATS.1993.398789","DOIUrl":null,"url":null,"abstract":"This paper proposes a test generation algorithm which can be applied to practical VLSI circuits. The key idea of the algorithm is to construct a sensitized path from the primary output to the site of the fault. This change of path construction order is very effective especially for the redundant faults, where their fault effects never propagate to any primary output. Whether or not a fault effect propagates can be easily checked by using 15-value logic. In this case, we can save computation time by not processing path sensitization. Another advantage of this approach is that the number of backtracks is greatly reduced by using information on the fault propagation during the path sensitization and line justification processes. This algorithm is implemented in C and is tested with the well-known benchmark circuits. The test results show that the new algorithm is extremely faster than PODEM.<<ETX>>","PeriodicalId":228291,"journal":{"name":"Proceedings of 1993 IEEE 2nd Asian Test Symposium (ATS)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A 15-valued fast test generation for combinational circuits\",\"authors\":\"S.J. Hong\",\"doi\":\"10.1109/ATS.1993.398789\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a test generation algorithm which can be applied to practical VLSI circuits. The key idea of the algorithm is to construct a sensitized path from the primary output to the site of the fault. This change of path construction order is very effective especially for the redundant faults, where their fault effects never propagate to any primary output. Whether or not a fault effect propagates can be easily checked by using 15-value logic. In this case, we can save computation time by not processing path sensitization. Another advantage of this approach is that the number of backtracks is greatly reduced by using information on the fault propagation during the path sensitization and line justification processes. This algorithm is implemented in C and is tested with the well-known benchmark circuits. The test results show that the new algorithm is extremely faster than PODEM.<<ETX>>\",\"PeriodicalId\":228291,\"journal\":{\"name\":\"Proceedings of 1993 IEEE 2nd Asian Test Symposium (ATS)\",\"volume\":\"88 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1993 IEEE 2nd Asian Test Symposium (ATS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ATS.1993.398789\",\"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 of 1993 IEEE 2nd Asian Test Symposium (ATS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ATS.1993.398789","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A 15-valued fast test generation for combinational circuits
This paper proposes a test generation algorithm which can be applied to practical VLSI circuits. The key idea of the algorithm is to construct a sensitized path from the primary output to the site of the fault. This change of path construction order is very effective especially for the redundant faults, where their fault effects never propagate to any primary output. Whether or not a fault effect propagates can be easily checked by using 15-value logic. In this case, we can save computation time by not processing path sensitization. Another advantage of this approach is that the number of backtracks is greatly reduced by using information on the fault propagation during the path sensitization and line justification processes. This algorithm is implemented in C and is tested with the well-known benchmark circuits. The test results show that the new algorithm is extremely faster than PODEM.<>