一种基于march的非链接静态故障定位和全面诊断算法

2006 IEEE International Workshop on Memory Technology, Design, and Testing (MTDT'06) Pub Date : 2006-08-02 DOI:10.1109/MTDT.2006.5

T. A. Gyonjyan, Gurgen Harutunyan, V. Vardanian

{"title":"一种基于march的非链接静态故障定位和全面诊断算法","authors":"T. A. Gyonjyan, Gurgen Harutunyan, V. Vardanian","doi":"10.1109/MTDT.2006.5","DOIUrl":null,"url":null,"abstract":"A new March-based fault location and full diagnosis algorithm is proposed for word-oriented static RAMs. A March algorithm of complexity 31N, N is the number of memory words, is defined for fault detection and partial diagnosis. Then March-like algorithms of complexity 3N to 5N are used to locate the aggressor words of coupling faults (CF) and achieve full diagnosis for all unlinked static CFs. Another March-like algorithm of complexity 16logB+18, B is the number of bits in the word, is applied to locate the aggressor bit in the aggressor word. A software tool is developed for automated generation of fault syndromes for detection, partial and full diagnosis of all static unlinked faults","PeriodicalId":320365,"journal":{"name":"2006 IEEE International Workshop on Memory Technology, Design, and Testing (MTDT'06)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A March-based algorithm for location and full diagnosis of all unlinked static faults\",\"authors\":\"T. A. Gyonjyan, Gurgen Harutunyan, V. Vardanian\",\"doi\":\"10.1109/MTDT.2006.5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new March-based fault location and full diagnosis algorithm is proposed for word-oriented static RAMs. A March algorithm of complexity 31N, N is the number of memory words, is defined for fault detection and partial diagnosis. Then March-like algorithms of complexity 3N to 5N are used to locate the aggressor words of coupling faults (CF) and achieve full diagnosis for all unlinked static CFs. Another March-like algorithm of complexity 16logB+18, B is the number of bits in the word, is applied to locate the aggressor bit in the aggressor word. A software tool is developed for automated generation of fault syndromes for detection, partial and full diagnosis of all static unlinked faults\",\"PeriodicalId\":320365,\"journal\":{\"name\":\"2006 IEEE International Workshop on Memory Technology, Design, and Testing (MTDT'06)\",\"volume\":\"99 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-08-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE International Workshop on Memory Technology, Design, and Testing (MTDT'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MTDT.2006.5\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE International Workshop on Memory Technology, Design, and Testing (MTDT'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MTDT.2006.5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

针对面向字的静态ram，提出了一种新的基于march的故障定位与全诊断算法。定义了一种复杂度为31N的March算法，其中N为存储字数，用于故障检测和部分诊断。然后采用复杂度为3N ~ 5N的类march算法对耦合故障的攻击词进行定位，实现对所有非链接静态耦合故障的全面诊断。另一种复杂度为16logB+18 (B为单词的位数)的类march算法用于定位单词中的侵略位。开发了一种软件工具，用于自动生成故障综合征，用于检测，部分和完全诊断所有静态非链接故障

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A March-based algorithm for location and full diagnosis of all unlinked static faults

A new March-based fault location and full diagnosis algorithm is proposed for word-oriented static RAMs. A March algorithm of complexity 31N, N is the number of memory words, is defined for fault detection and partial diagnosis. Then March-like algorithms of complexity 3N to 5N are used to locate the aggressor words of coupling faults (CF) and achieve full diagnosis for all unlinked static CFs. Another March-like algorithm of complexity 16logB+18, B is the number of bits in the word, is applied to locate the aggressor bit in the aggressor word. A software tool is developed for automated generation of fault syndromes for detection, partial and full diagnosis of all static unlinked faults

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2006 IEEE International Workshop on Memory Technology, Design, and Testing (MTDT'06)

自引率

0.00%

发文量