{"title":"一种可重构的基于sat的自动测试模式发生器","authors":"M. Safar, M. Shalan, M. El-Kharashi, A. Salem","doi":"10.1109/IEEEGCC.2011.5752522","DOIUrl":null,"url":null,"abstract":"With the increasing complexity of integrated circuits and transition to Systems-on-Chip (SoC) paradigm, Automatic Test pattern Generation (ATPG) becomes a crucial tool in the Electronic Design Automation (EDA) domain. ATPG based on Boolean Satisfiability (SAT) has been proposed as an alternative to classical structural algorithms for generating test patterns for single stuck-at faults in combinational circuits. SAT-based ATPG provides excellent balance of simplicity and robustness versus structural algorithms. However, a highly efficient and fast SAT solver in needed to overcome the time overhead incurred in extracting the SAT formula. In this paper, we propose a reconfigurable hardware SAT-based test pattern generator. For different circuits, compilation, synthesis and place-and-route overhead is eliminated. We demonstrate the feasibility of our approach by experimenting with ISCAS'85. Our proposed reconfigurable SAT-based test pattern generator achieves 20 times average speedup compared to software SAT-based ATPG.","PeriodicalId":119104,"journal":{"name":"2011 IEEE GCC Conference and Exhibition (GCC)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A reconfigurable SAT-based automatic test pattern generator\",\"authors\":\"M. Safar, M. Shalan, M. El-Kharashi, A. Salem\",\"doi\":\"10.1109/IEEEGCC.2011.5752522\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the increasing complexity of integrated circuits and transition to Systems-on-Chip (SoC) paradigm, Automatic Test pattern Generation (ATPG) becomes a crucial tool in the Electronic Design Automation (EDA) domain. ATPG based on Boolean Satisfiability (SAT) has been proposed as an alternative to classical structural algorithms for generating test patterns for single stuck-at faults in combinational circuits. SAT-based ATPG provides excellent balance of simplicity and robustness versus structural algorithms. However, a highly efficient and fast SAT solver in needed to overcome the time overhead incurred in extracting the SAT formula. In this paper, we propose a reconfigurable hardware SAT-based test pattern generator. For different circuits, compilation, synthesis and place-and-route overhead is eliminated. We demonstrate the feasibility of our approach by experimenting with ISCAS'85. Our proposed reconfigurable SAT-based test pattern generator achieves 20 times average speedup compared to software SAT-based ATPG.\",\"PeriodicalId\":119104,\"journal\":{\"name\":\"2011 IEEE GCC Conference and Exhibition (GCC)\",\"volume\":\"63 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-04-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE GCC Conference and Exhibition (GCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IEEEGCC.2011.5752522\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE GCC Conference and Exhibition (GCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEEEGCC.2011.5752522","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A reconfigurable SAT-based automatic test pattern generator
With the increasing complexity of integrated circuits and transition to Systems-on-Chip (SoC) paradigm, Automatic Test pattern Generation (ATPG) becomes a crucial tool in the Electronic Design Automation (EDA) domain. ATPG based on Boolean Satisfiability (SAT) has been proposed as an alternative to classical structural algorithms for generating test patterns for single stuck-at faults in combinational circuits. SAT-based ATPG provides excellent balance of simplicity and robustness versus structural algorithms. However, a highly efficient and fast SAT solver in needed to overcome the time overhead incurred in extracting the SAT formula. In this paper, we propose a reconfigurable hardware SAT-based test pattern generator. For different circuits, compilation, synthesis and place-and-route overhead is eliminated. We demonstrate the feasibility of our approach by experimenting with ISCAS'85. Our proposed reconfigurable SAT-based test pattern generator achieves 20 times average speedup compared to software SAT-based ATPG.