{"title":"Estimating Error Propagation Probabilities with Bounded Variances","authors":"H. Asadi, M. Tahoori, C. Tirumurti","doi":"10.1109/DFT.2007.51","DOIUrl":"https://doi.org/10.1109/DFT.2007.51","url":null,"abstract":"Fast and accurate estimation of soft error rate (SER) is essential in obtaining the reliability parameters of a digital system and cost-effective reliability improvements. In this paper we present an approach to obtain uncertainty bounds on the error propagation probability (EPP) values used in SER estimation based on an analytical approach. We demonstrate how we can compute EPP values and their uncertainty bounds (variances) by examining the logic gates in a topological order. Comparison of this method with the Monte-Carlo (MC) fault simulation approach confirms the accuracy of the presented technique for both the computed EPP values and uncertainty bounds. Also, this technique is 3-5 orders of magnitude faster than fault simulation.","PeriodicalId":259700,"journal":{"name":"22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (DFT 2007)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127844605","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}
J. Semião, J. Rodríguez-Andina, F. Vargas, Marcelino B. Santos, I. Teixeira, João Paulo Teixeira
{"title":"Improving the Tolerance of Pipeline Based Circuits to Power Supply or Temperature Variations","authors":"J. Semião, J. Rodríguez-Andina, F. Vargas, Marcelino B. Santos, I. Teixeira, João Paulo Teixeira","doi":"10.1109/DFT.2007.60","DOIUrl":"https://doi.org/10.1109/DFT.2007.60","url":null,"abstract":"A new methodology is proposed to increase the robustness of pipeline-based circuits. The goal is to improve signal integrity in the presence of power-supply voltage (VDD) and/or temperature (T) variations, without degrading circuit performance. In the proposed methodology, we dynamically control the instant of data capture (the clock edge trigger) in key memory cells, according to local VDD and/or T variations. This way, data integrity loss is avoided, and circuit tolerance to power supply and/or temperature variations is enhanced. The methodology is based on a dynamic delay buffer (DDB) block, used to sense VDD/T variations and to induce dynamic clock skews driving a limited subset of memory elements. Experimental results based on SPICE simulations for 2 sequential circuits are used to demonstrate that careful design may lead to improvements on circuit tolerance to VDD and/or T variations.","PeriodicalId":259700,"journal":{"name":"22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (DFT 2007)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124395004","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}
T. Aikyo, Hiroshi Takahashi, Y. Higami, Junichi Ootsu, Kyohei Ono, Y. Takamatsu
{"title":"Timing-Aware Diagnosis for Small Delay Defects","authors":"T. Aikyo, Hiroshi Takahashi, Y. Higami, Junichi Ootsu, Kyohei Ono, Y. Takamatsu","doi":"10.1109/DFT.2007.30","DOIUrl":"https://doi.org/10.1109/DFT.2007.30","url":null,"abstract":"As semiconductor technologies progress, testing of small delay defects are becoming more important for SoCs. However, fault diagnosis of small delay defects has not been developed. We propose a novel timing-aware method for diagnosing small delay defects with a small computation cost using gate delay fault simulation with the minimum detectable delay, as introduced in the statistical delay quality model. The experimental results show that the proposed method is capable of identifying fault locations for small delay defects with a small computation cost.","PeriodicalId":259700,"journal":{"name":"22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (DFT 2007)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114415315","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":"Production Yield and Self-Configuration in the Future Massively Defective Nanochips","authors":"P. Zając, J. Collet","doi":"10.1109/DFT.2007.34","DOIUrl":"https://doi.org/10.1109/DFT.2007.34","url":null,"abstract":"We address two problems in this work, namely, 1) the resilience challenge in the future chips made up of massively defective nanoelements and organized in replicative multicore architectures and 2) the issue of preserving the production yield. Our main suggestion is that the chip should be self-configuring at the architectural level, enabling with almost no external control mechanisms, core mutual-test to isolate the defective core and self-configuration of communications to discover the routes in the defective network. Our contribution is a systematic study of the dependence of the production yield versus the core failure probability (possibly as high as 0.4) in several networks with different node connectivity ranging from 3 to 5. The result is obtained in terms of a probabilistic metrics to warrant that a minimal fraction of nodes can be contacted by the input-output port for participating to the processing.","PeriodicalId":259700,"journal":{"name":"22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (DFT 2007)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124654703","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":"Analysis of Specified Bit Handling Capability of Combinational Expander Networks","authors":"A. Jas, S. Patil","doi":"10.1109/DFT.2007.52","DOIUrl":"https://doi.org/10.1109/DFT.2007.52","url":null,"abstract":"Test compression schemes based on combinational expander networks have become very popular in recent times. The idea behind these schemes is to use m bits from the tester to produce N(m < N) bits for the internal scan chains of the circuit under test. In this paper we address the general problem of designing combinational expander networks with N outputs which guarantee that any S specified bits can be justified at the expander output. By analyzing the constraints imposed on the output space of such a network we derive formulae that provide the minimum value of m (and consequently a maximum value of the amount of compression that can be achieved). We then show that a subclass of one of the state-of-the-art combinational expander designs (XPAND) being currently used in several industrial designs achieves the maximum amount of compression possible.","PeriodicalId":259700,"journal":{"name":"22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (DFT 2007)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128687928","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}
Jorge Luis Lagos-Benites, D. Appello, P. Bernardi, M. Grosso, D. Ravotto, E. Sánchez, M. Reorda
{"title":"An Effective Approach for the Diagnosis of Transition-Delay Faults in SoCs, based on SBST and Scan Chains","authors":"Jorge Luis Lagos-Benites, D. Appello, P. Bernardi, M. Grosso, D. Ravotto, E. Sánchez, M. Reorda","doi":"10.1109/DFT.2007.47","DOIUrl":"https://doi.org/10.1109/DFT.2007.47","url":null,"abstract":"In this paper, a Software-Based Diagnosis (SBD) procedure suitable for SoCs is proposed to tackle the diagnosis of transition-delay faults. The illustrated methodology takes advantage of an initial Software-Based Self-Test (SBST) test set and of the scan-chains included in the final SoC design release. In principle, the proposed methodology consists in partitioning the considered SBST test set in several slices, and then proceeding to the evaluation of the diagnostic ability owned by each slice with the aim of discarding diagnosis-ineffective test programs portions. The proposed methodology is aimed to provide precise feedback to the failure analysis process focusing the systematic timing failures characteristic of new technologies. Experimental results show the effectiveness and feasibility of the proposed approach on a suitable SoC test vehicle including an 8-bit microcontroller, 4 SRAM memories and an arithmetic core, manufactured by STMicroelectronics, whose purpose is to provide precise information to the failure analysis process. The reached diagnostic resolution is up to the 99.75%, compared to the 93.14% guaranteed by the original SBST procedure.","PeriodicalId":259700,"journal":{"name":"22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (DFT 2007)","volume":"371 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132775914","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":"Soft Error Hardened Latch Scheme for Enhanced Scan Based Delay Fault Testing","authors":"Takashi Ikeda, K. Namba, Hideo Ito","doi":"10.1109/DFT.2007.44","DOIUrl":"https://doi.org/10.1109/DFT.2007.44","url":null,"abstract":"In recent high-density, high-speed and low-power VLSIs, soft errors (SEs) and delay faults (DFs) frequently occur. Therefore, SE hardened design and DF testing are essential. This paper proposes three types of scan flip-flops (FFs) which have SE tolerant capability and allow enhanced scan shifting for DF testing, i.e. arbitrary two-pattern testing. The slave latches used in these FFs are constructed by adding some extra transistors which make enhanced scan shifting possible for DF testing on an existing SE hardened latch. The areas and time overheads of the proposed latches are up to 33.3% and 31.4% larger than those of the existing SE hardened latch respectively. However, the areas of the proposed FFs are about 30% smaller than existing FFs which have SE tolerant capability and allow enhanced scan shifting for DF testing.","PeriodicalId":259700,"journal":{"name":"22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (DFT 2007)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128019901","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":"Matrix Codes: Multiple Bit Upsets Tolerant Method for SRAM Memories","authors":"C. Argyrides, H. Zarandi, D. Pradhan","doi":"10.1109/DFT.2007.29","DOIUrl":"https://doi.org/10.1109/DFT.2007.29","url":null,"abstract":"This paper presents a high level method called Matrix code to protect SRAM-based memories against multiple bit upsets. The proposed method combines hamming code and parity code to assure the reliability of memory in presence of multiple bit-upsets with low area and performance overhead. The method is evaluated using one million multiple-fault injection experiments; next reliability and MTTF of the protected memories are estimated based on fault injection experiments and several equations. The fault detection/correction coverage are also calculated and compared with previous methods i.e., Reed-Muller and hamming code. The results reveal that the proposed method behaves better than these methods in terms of fault detection and correction of multiple faults regarding to the area overhead.","PeriodicalId":259700,"journal":{"name":"22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (DFT 2007)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126395856","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":"Reconstruction of Erasure Correcting Codes for Dependable Distributed Storage System without Spare Disks","authors":"H. Kaneko, E. Fujiwara","doi":"10.1109/DFT.2007.26","DOIUrl":"https://doi.org/10.1109/DFT.2007.26","url":null,"abstract":"Demand is increasing for large-scale dependable storage systems for use in data-intensive servers, such as database and multimedia servers. Conventional dependable disk arrays utilize erasure correcting code to recover lost data stored on failed disks, and require two types of redundant disks: check disks to store check bits, and spare disks to replace failed disks. To reduce the number of redundant disks, this paper proposes a distributed storage system that does not require spare disks. Specifically, the proposed system replaces a failed disk with a check disk rather than with a spare disk. Erasure correction capability of the system gradually degrades with accumulation of failed disks. This paper proposes a reconstruction method for the parity-check matrix of low-density triple-erasure correcting code. Evaluation of the mean time to data loss (MTTDL) shows that, for a storage system with 120 information disks, the proposed storage system with 21 check disks gives an MTTDL of 7.9 x 104 years, while a conventional system with 26 redundant disks gives an MTTDL of 5.8 x 101 years, where the mean time to failure of each disk is 0.5 x 106 years and the maintenance interval of each system is 5,376 hours (i.e., 32 weeks).","PeriodicalId":259700,"journal":{"name":"22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (DFT 2007)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116637285","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}
G. Xenoulis, M. Psarakis, D. Gizopoulos, A. Paschalis
{"title":"On-Line Periodic Self-Testing of High-Speed Floating-Point Units in Microprocessors","authors":"G. Xenoulis, M. Psarakis, D. Gizopoulos, A. Paschalis","doi":"10.1109/DFT.2007.32","DOIUrl":"https://doi.org/10.1109/DFT.2007.32","url":null,"abstract":"On-line periodic testing of microprocessors is a viable low-cost alternative for a wide variety of embedded systems which cannot afford hardware or software redundancy techniques but necessitate the detection of intermittent or permanent faults. Low-cost, on-line periodic testing has been previously applied to the integer datapaths of microprocessors but not to their high-performance real number processing counterparts consisting of sophisticated high-speed floating-point (FP) units. In this paper, we present, an effective on-line periodic self-testing methodology for high-speed FP units and demonstrate it on high-speed FP adders/subtracters of both single and double precision. The proposed self-test code development methodology leads to compact self-test routines that exploit the integer part of the processors instruction set architecture to apply test sets to the FP subsystem periodically. The periodic self-test routines exhibit very low memory storage requirements along with a very small number of memory references which are both fundamental requirements for on-line periodic testing. A comprehensive set of experiments on both single and double precision FP units including pipelined versions, and on a RISC processor with a complete FP unit demonstrate the efficacy of the methodology in terms of very high fault coverage and low memory footprint thus rendering the proposed methodology highly appropriate for on-line periodic testing.","PeriodicalId":259700,"journal":{"name":"22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (DFT 2007)","volume":"1228 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120939767","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}