Proceedings 1999 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (EFT'99)最新文献

筛选
英文 中文
LFSR/SR pseudoexhaustive TPG in fewer test cycles LFSR/SR伪穷举TPG在更少的测试周期
D. Kagaris, S. Tragoudas
{"title":"LFSR/SR pseudoexhaustive TPG in fewer test cycles","authors":"D. Kagaris, S. Tragoudas","doi":"10.1109/DFTVS.1999.802878","DOIUrl":"https://doi.org/10.1109/DFTVS.1999.802878","url":null,"abstract":"Linear feedback shift registers are the most commonly used mechanism in built-in test architectures for digital combinational or fully scanned circuits and systems. The goal in pseudo-exhaustive TPG is to minimize the required test length with low hardware overhead. Existing approaches are based on primitive characteristic polynomials. The hardware overhead (seeds) is minimal in this case, but the candidate polynomials are few. Our experiments show that these methods often fail to produce pseudoexhaustive tests. There are no approaches that allow a small number of seeds in order to obtain pseudoexhaustive test sets within a prescribed bound. Our method allows consideration of still more candidate polynomials, that are not primitive, but offer a very small number of seeds. Experimental results on the ISCAS'85 benchmarks show that the method often succeeds with a very low number of seeds when all previous methods fail.","PeriodicalId":448322,"journal":{"name":"Proceedings 1999 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (EFT'99)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128254731","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}
引用次数: 0
Soft-error detection through software fault-tolerance techniques 通过软件容错技术进行软错误检测
M. Rebaudengo, M. Reorda, Marco Torchiano, M. Violante
{"title":"Soft-error detection through software fault-tolerance techniques","authors":"M. Rebaudengo, M. Reorda, Marco Torchiano, M. Violante","doi":"10.1109/DFTVS.1999.802887","DOIUrl":"https://doi.org/10.1109/DFTVS.1999.802887","url":null,"abstract":"The paper describes a systematic approach for automatically introducing data and code redundancy into an existing program written using a high-level language. The transformations aim at making the program able to detect most of the soft-errors affecting data and code, independently of the Error Detection Mechanisms (EDMs) possibly implemented by the hardware. Since the transformations can be automatically applied as a pre-compilation phase, the programmer is freed from the cost and responsibility of introducing suitable EDMs in its code. Preliminary experimental results are reported, showing the fault coverage obtained by the method, as well as some figures concerning the slow-down and code size increase it causes.","PeriodicalId":448322,"journal":{"name":"Proceedings 1999 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (EFT'99)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133165214","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}
引用次数: 170
Determination of yield bounds prior to routing 在路由之前确定产量界限
Arunshankar Venkataraman, I. Koren
{"title":"Determination of yield bounds prior to routing","authors":"Arunshankar Venkataraman, I. Koren","doi":"10.1109/DFTVS.1999.802863","DOIUrl":"https://doi.org/10.1109/DFTVS.1999.802863","url":null,"abstract":"Integrated circuit manufacturing complexities have resulted in decreasing product yields and reliabilities. This process has been accelerated with the advent of very deep sub-micron technologies coupled with the introduction of newer materials and technologies like copper interconnects, silicon-on-insulator and increased wafer sizes. The need to improve product yields has been recognized and currently some yield enhancement techniques are used in industry CAD tools. Still, the significant increase in problem size implies that considerable time and effort can be saved if the designer could predict the yield of each design stage. In this paper we undertake an effort to derive bounds on the yield of the routing for a given placement. When the design is routed, resulting in a yield which is significantly smaller than the bound, the designer can choose to change the router cost functions, modify the placement or even re-design the unit in an attempt to increase the yield. We compare the bounds on yield obtained for a set of standard benchmarks against exact yield values for the \"vanilla\" routings, and the run times needed to calculate the two. The results indicate that reasonably good estimates of yield can be obtained in significantly lower amounts of run time. The accuracy of the estimates increases when larger designs are considered as the simplifying assumptions made and the model no longer influences the estimates significantly.","PeriodicalId":448322,"journal":{"name":"Proceedings 1999 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (EFT'99)","volume":"388 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123918971","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}
引用次数: 12
Erasure error correction with hardware detection 擦除错误纠正与硬件检测
W. Armitage, Jien-Chung Lo
{"title":"Erasure error correction with hardware detection","authors":"W. Armitage, Jien-Chung Lo","doi":"10.1109/DFTVS.1999.802896","DOIUrl":"https://doi.org/10.1109/DFTVS.1999.802896","url":null,"abstract":"Error-control coding methods have been the primary method used to protect digital communications from transmission errors. Such codes are well understood and their capabilities for error detection and correction clearly established in the literature. For correction purposes, error location is required; for this reason error-control codes' detection capabilities significantly exceed their correction capabilities. If error location information can be determined and supplied prior to processing by code-checking circuitry, such correction capability can be significantly enhanced in special circumstances. One such circumstance is that of bit \"erasures\". This work focuses on the use of undefined logic levels (near neither V/sub dd/ nor V/sub ss/) as an erasure detection method. It is shown how the error correction capabilities of error-correction codes of various d/sub min/ are enhanced by pre-detection of erasures. An implementation example is presented: this 9-bit parity-based erasure correction circuit is described; test results of the the fabricated circuit are presented as a comparison with capabilities of a simple parity checker. Specific details of extension to higher-order codes are presented.","PeriodicalId":448322,"journal":{"name":"Proceedings 1999 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (EFT'99)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117082036","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}
引用次数: 3
Good processor identification in two-dimensional grids 良好的处理器识别在二维网格
F. Meyer, F. Lombardi, Jun Zhao
{"title":"Good processor identification in two-dimensional grids","authors":"F. Meyer, F. Lombardi, Jun Zhao","doi":"10.1109/DFTVS.1999.802902","DOIUrl":"https://doi.org/10.1109/DFTVS.1999.802902","url":null,"abstract":"We examine the problem of identifying good processors in self-testing two-dimensional grid systems. The grids have boundaries (not wrap-around) and degree 8. Our diagnostic objective is to identify at least one fault-free processor. From this, at feast one faulty processor could be identified and it would be possible to sequentially diagnose the system by repeated repair. We establish an upper bound on the worst case maximum number of faults while still being able to meet the diagnostic goal with an ideal diagnosis algorithm. A straightforward ideal diagnosis algorithm would have exponential complexity and would involve 16 parallel rounds of processor testing. We give a test schedule with at most 6 parallel rounds of testing. This test schedule tolerates asymptotically as many faults as an ideal algorithm (by a constant factor). The new test schedule will also work for grids with degree 4, which have inferior diagnostic potential.","PeriodicalId":448322,"journal":{"name":"Proceedings 1999 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (EFT'99)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117124499","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}
引用次数: 1
Power characterization of LFSRs lfsr的功率特性
Marco Brazzarola, F. Fummi
{"title":"Power characterization of LFSRs","authors":"Marco Brazzarola, F. Fummi","doi":"10.1109/DFTVS.1999.802879","DOIUrl":"https://doi.org/10.1109/DFTVS.1999.802879","url":null,"abstract":"This paper presents a formal analysis on the power consumption of BIST architectures composed of primitive-polynomial LFSRs connected to a combinational CUT. An exact power characterization of all primitive-polynomial LFSRs has been identified, since interesting invariant properties have been discovered.","PeriodicalId":448322,"journal":{"name":"Proceedings 1999 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (EFT'99)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124937352","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}
引用次数: 14
A CMOS-based logic cell for the implementation of self-checking FPGAs 一种用于实现自检fpga的基于cmos的逻辑单元
P. Lala, Anup Singh, A. Walker
{"title":"A CMOS-based logic cell for the implementation of self-checking FPGAs","authors":"P. Lala, Anup Singh, A. Walker","doi":"10.1109/DFTVS.1999.802890","DOIUrl":"https://doi.org/10.1109/DFTVS.1999.802890","url":null,"abstract":"This paper proposes a logic cell that can be used as a building block for online testable FPGAs. The proposed logic cell consists of two 2-to-1 multiplexers, three 4-to-1 multiplexers and a D flip-flop. The cell has been designed using Differential Cascode Voltage Switch (DCVS) logic. It is self-checking for all single transistor stuck-on and stuck-off faults as well as stuck-at faults at the inputs of each multiplexer and the D flip-flop. The multiplexers and the D flip-flop provide either correct (complementary) output in the absence of above-mentioned faults or identical outputs in the presence of fault.","PeriodicalId":448322,"journal":{"name":"Proceedings 1999 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (EFT'99)","volume":"649 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122696058","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}
引用次数: 5
Novel control pattern generators for interconnect testing with boundary scan 边界扫描互连测试控制模式的新方法
Wenyi Feng, F. Meyer, F. Lombardi
{"title":"Novel control pattern generators for interconnect testing with boundary scan","authors":"Wenyi Feng, F. Meyer, F. Lombardi","doi":"10.1109/DFTVS.1999.802876","DOIUrl":"https://doi.org/10.1109/DFTVS.1999.802876","url":null,"abstract":"We give a comprehensive model of interconnect testing in boundary scan architectures. This includes two fault categories: driver faults (stuck-at, stuck-driving, and stuck-not-driving (equivalent to stuck-open)) and net faults (shorts). We permit short faults to exhibit zero-dominance (wired-AND), one-dominance (wired-OR), and net-dominance. We split the built-in self-test hardware into two components: a control pattern test generator (CTPG) and a data pattern test generator (DTPG). For the DTPG, we use a complementary counting sequence, which is an instance of a maximal independent test set. We give novel designs for CTPGs that guarantee 100% fault coverage with low hardware overhead and time complexity. We give a general and complete procedure to implement the CTPGs. Using a linear feedback shift register as a one-shot counter to cover all control cells in the boundary scan, we ensure that no two control cells of one net are assigned to a single register; this avoids circuit damage when testing.","PeriodicalId":448322,"journal":{"name":"Proceedings 1999 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (EFT'99)","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134561689","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}
引用次数: 7
Stratified testing of multichip module systems under uneven known-good-yield 已知良率不均匀条件下多芯片模块系统的分层测试
N. Park, F. Lombardi
{"title":"Stratified testing of multichip module systems under uneven known-good-yield","authors":"N. Park, F. Lombardi","doi":"10.1109/DFTVS.1999.802885","DOIUrl":"https://doi.org/10.1109/DFTVS.1999.802885","url":null,"abstract":"In this paper, a stratified technique is proposed for testing multichip module (MCM) systems. Its advantages are an improvement in quality level (QL) and cost-effectiveness. The proposed testing approach is accomplished in the presence of uneven known-good-yield (KGY) for MCMs consisting of different sets (or strata) of chips. This approach referred to as the lowest yield-stratum first-testing (LYSFT) considers the unevenness of KGY between strata for testing the chips and improving the QL. For comparison purposes, exhaustive testing (ET), random testing (RT) and random stratified testing (RST) are also evaluated. Given the strata, KGY and the sample size of the chips under test, the proposed LYSFT approach allocates and tests the sampled chips in a greedy (first) fashion, while RT and RST select the chip (for RT) and the stratum (for RST) randomly. A Markov-chain model is developed to analyze these testing approaches and is solved analytically in O(SN/sup 3/) for the LYSFT (where S is the number of strata and N is the number of chips in the MCM). A cost model is proposed as figure of merit and shown to relate the defect level (DL) with the number of tests performed. Parametric results show that the LYSFT dramatically outperforms RT and RST for improving the QL. A considerable reduction in tests can be achieved by the LYSFT at a very small loss in QL compared with ET.","PeriodicalId":448322,"journal":{"name":"Proceedings 1999 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (EFT'99)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130866384","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}
引用次数: 3
Optimal vector selection for low power BIST 低功耗BIST的最优矢量选择
Fulvio Corno, M. Reorda, M. Rebaudengo, M. Violante
{"title":"Optimal vector selection for low power BIST","authors":"Fulvio Corno, M. Reorda, M. Rebaudengo, M. Violante","doi":"10.1109/DFTVS.1999.802888","DOIUrl":"https://doi.org/10.1109/DFTVS.1999.802888","url":null,"abstract":"In the last decade, researchers have devoted increasing efforts to reduce the average power consumption in VLSI systems during normal operation mode, while power consumption during test operation mode was usually neglected. However, during test application the circuits are subject to an activity higher than the normal one: the extra power consumption due to test application may thus give rise to severe hazards to the circuit reliability. Moreover, it can dramatically shorten the battery life when periodic testing of battery-powered systems is considered. In this paper we propose a low power BIST architecture devised for full scan testing of sequential circuits. Experimental results show that our approach can achieve an average power reduction ranging from 37% to 89% without affecting the quality of the test. The new architecture can be easily integrated into an existing design flow and is barely invasive with respect to the original BIST circuit.","PeriodicalId":448322,"journal":{"name":"Proceedings 1999 IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (EFT'99)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129386773","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}
引用次数: 18
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信