{"title":"Testing domino circuits in SOI technology","authors":"E. MacDonald, N. Touba","doi":"10.1109/ATS.2000.893664","DOIUrl":"https://doi.org/10.1109/ATS.2000.893664","url":null,"abstract":"The proliferation of both partially depleted silicon-on-insulator (PDSOI) technology and domino circuit styles has allowed for increases in circuit performance beyond that of scaling traditional bulk CMOS static circuits. However, interactions between dynamic circuit styles and PD-SOI complicate testing. This paper describes the issues of testing domino circuits fabricated in SOI technology and new tests are proposed to address the interactions. A fault modeling analysis is described which demonstrates that the overall fault coverage can be improved beyond that of traditional testing of domino circuits in bulk technology.","PeriodicalId":403864,"journal":{"name":"Proceedings of the Ninth Asian Test Symposium","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116084102","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Memory test time reduction by interconnecting test items","authors":"Wen-Jer Wu, C. Tang","doi":"10.1109/ATS.2000.893639","DOIUrl":"https://doi.org/10.1109/ATS.2000.893639","url":null,"abstract":"The idea is to interconnect test items to reuse memory states left from the previous test item for saving initialization and verification sequences. Meanwhile, signal settling time of the tester between two consecutive test items being applied can also be minimized since all test items are connected together into a continuous one. The interconnection problem is transformed to the Rural Chinese Postman (RCP) problem. The RCP problem is a famous NP-hard problem, one way to solve the RCP problem is by modeling as an integer linear programming (ILP) model. However, in the worst case, it will incur an exponential number of constraints; therefore, it is not suitable for practical usage. Instead of putting all constraints at once, we generate and solve a number of successive ILP models with the smaller number of constraints. The total numbers of iterations and constraints applied to solve ILP models are analyzed and compared.","PeriodicalId":403864,"journal":{"name":"Proceedings of the Ninth Asian Test Symposium","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124683581","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Accelerated test pattern generators for mixed-mode BIST environments","authors":"Wei-Lun Wang, Kuen-Jong Lee","doi":"10.1109/ATS.2000.893651","DOIUrl":"https://doi.org/10.1109/ATS.2000.893651","url":null,"abstract":"Linear feedback shift registers (LFSRs) are used to generate both pseudorandom and deterministic patterns in the scan-based built-in self-test environment to raise the fault coverage and reduce the test cost. However, like other scan-based methods, the LFSR based pattern generation schemes take a long test application time on feeding deterministic patterns from the LFSR into a scan chain. In this paper we derive a generalized relationship between the bits in the original scan chain and the states of the LFSR such that the bits generated by an LFSR in any future clock cycle can be pre-generated by the proposed test pattern generator. With this relationship, we can divide a scan chain into multiple sub-chains and use an LFSR-based multiple sequence generator to simultaneously generate all the subsequences required by the sub-chains, hence can greatly reduce the test application time.","PeriodicalId":403864,"journal":{"name":"Proceedings of the Ninth Asian Test Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129789752","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fault tolerant multistage interconnection networks with widely dispersed paths","authors":"N. Kamiura, T. Kodera, N. Matsui","doi":"10.1109/ATS.2000.893660","DOIUrl":"https://doi.org/10.1109/ATS.2000.893660","url":null,"abstract":"As a sort of MINs (Multistage Interconnection Networks), we propose the 2-dilated baseline network whose performance in the faulty case degrades as gracefully as possible. All the available paths established between an input terminal and an output one via an identical input of SE (Switching Element) in some stage never pass through an identical SE in the next stage. The loads on SEs, therefore, are shared efficiently. Extra links added to enhance the performance never complicate the routing scheme. There is no difference between our MIN and other ones in hardware overhead. Besides our MIN is superior to other ones in performance, especially in robustness against concentrated SE faults in an identical stage.","PeriodicalId":403864,"journal":{"name":"Proceedings of the Ninth Asian Test Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126097390","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Spirit: satisfiability problem implementation for redundancy identification and test generation","authors":"Emil Gizdarski, H. Fujiwara","doi":"10.1109/ATS.2000.893621","DOIUrl":"https://doi.org/10.1109/ATS.2000.893621","url":null,"abstract":"In this paper an efficient test pattern generation (TPG) algorithm for combinational circuits based on the Boolean satisfiability method (SAT) is presented. We examine some not so popular approaches as a single cone processing, single path oriented propagation and backward justification. We give a new definition for SAT-based test generation and present duality of learning phenomenon. The resultant ATPG system, called SPIRIT, combines the flexibility of SAT-based TPG algorithms with the efficiency of structural TPG algorithms. Experimental results demonstrate the efficiency and robustness of the proposed TPG algorithm. Without fault simulation, SPIRIT is able to generate complete test sets for the ISCAS'85 benchmark circuits and full scan version of the ISCAS'89 benchmark circuits within 3 minutes on a 450 MHz Pentium-III PC.","PeriodicalId":403864,"journal":{"name":"Proceedings of the Ninth Asian Test Symposium","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128945579","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A method for determining whether asynchronous circuits are self-checking","authors":"M. Liebelt, C. Lim","doi":"10.1109/ATS.2000.893669","DOIUrl":"https://doi.org/10.1109/ATS.2000.893669","url":null,"abstract":"While asynchronous circuits offer potential advantages over synchronous circuits, particularly in the form of low power and low noise properties, it is widely held that they are more difficult to test. The self-checking properties of semi-modular asynchronous circuits with respect to certain stuck-at faults have been known for many years, but the restrictions have been such that it has not been feasible to make use of this property to enhance testability. In this paper we demonstrate the feasibility of a technique to determine whether a proposed asynchronous circuit implementation is totally self-checking with respect to all output stuck-at-faults. This test can he incorporated into the design process to select a self-checking implementation when several alternatives are available.","PeriodicalId":403864,"journal":{"name":"Proceedings of the Ninth Asian Test Symposium","volume":"1 7759 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116560760","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ching-Hwa Cheng, W. Jone, Jinn-Shyan Wang, Shih-Chieh Chang
{"title":"Charge sharing fault analysis and testing for CMOS domino logic circuits","authors":"Ching-Hwa Cheng, W. Jone, Jinn-Shyan Wang, Shih-Chieh Chang","doi":"10.1109/ATS.2000.893663","DOIUrl":"https://doi.org/10.1109/ATS.2000.893663","url":null,"abstract":"Because domino logic design offers smaller area and faster delay than conventional CMOS design, it is very popular in the high-performance processor. However, domino logic suffers from several problems and one of the most notable ones is the charge sharing problem. In this paper, we describe a method to measure the sensitivity of the charge-sharing problem for each domino gate. In addition, our algorithm also generates test vectors to detect the worst case of charge-sharing fault.","PeriodicalId":403864,"journal":{"name":"Proceedings of the Ninth Asian Test Symposium","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116771614","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A testable/fault-tolerant FFT processor design","authors":"Shyue-Kung Lu, Jen-Sheng Shih, Cheng-Wen Wu","doi":"10.1109/ATS.2000.893661","DOIUrl":"https://doi.org/10.1109/ATS.2000.893661","url":null,"abstract":"With the advent of VLSI technology, a large collection of processing elements can be gathered to achieve high-speed computation economically. However, due to the low pin-count-to-component-count ratio, the controllability and observability of such circuits decrease significantly. As a result, the testing of such highly complex and dense circuits becomes very difficult and expensive. A testable/fault-tolerant FFT processor is proposed in this paper. We first propose a testable design scheme for FFT butterfly networks based on M-testability conditions. According to the M-testability conditions, a novel design-for-testability approach is presented and applied to the module-level systolic FFT arrays. Our M-testability conditions guarantee 100% single-module-fault testability with a minimum number of test patterns. Based on this testable design, a reconfiguration mechanism is incorporated to bypass the faulty cells and the testable/fault-tolerant structures are constructed. Special cell designs are presented to implement the design-for-testability and reconfiguration mechanisms. The reliability of the FFT system increases significantly and the hardware overhead is low-about 16% for the module-level design.","PeriodicalId":403864,"journal":{"name":"Proceedings of the Ninth Asian Test Symposium","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132945633","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Design for sequential testability: an internal state reseeding approach for 100 % fault coverage","authors":"M. Flottes, C. Landrault, A. Petitqueux","doi":"10.1109/ATS.2000.893657","DOIUrl":"https://doi.org/10.1109/ATS.2000.893657","url":null,"abstract":"This paper proposes a method to select observation points and flip-flops for partial reset. The method does not target minimum DFT insertion but a maximum improvement on testability. The proposed non-scan approach allows a at-speed testing. Experimental results show that the method achieves 100% fault coverage and 100% fault efficiency for benchmark circuits while requiring less ATPG effort (CPU time) with no scan necessity.","PeriodicalId":403864,"journal":{"name":"Proceedings of the Ninth Asian Test Symposium","volume":"2 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132973269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Peak-power reduction for multiple-scan circuits during test application","authors":"Kuen-Jong Lee, Tsung-Chu Huang, Jih-Jeen Chen","doi":"10.1109/ATS.2000.893666","DOIUrl":"https://doi.org/10.1109/ATS.2000.893666","url":null,"abstract":"This paper proposes a novel method to reduce the peak power of multiple scan chain based circuits during testing. The peak periodicity and the peak width of the power waveforms for scan-based circuits are analyzed. An interleaving scan architecture based on adding delay buffers among the scan chains is proposed which can significantly reduce the peak power. This method can be efficiently employed in a recently proposed broadcast multiple scan architecture due to the sharing of scan patterns. The effects of the interleaving scan technique applied to the conventional multiple scan and the broadcast multiple scan with 10 scan chains are investigated. The improvement percentage can be up to 50% when the data output of a scan cell is affected by the scan path during scan. When the data output is disabled during scan, 76% of peak-power reduction can be achieved.","PeriodicalId":403864,"journal":{"name":"Proceedings of the Ninth Asian Test Symposium","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127856441","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}