Associative search based test algorithms for test acceleration in FAST-RAMs

C. Elm, D. Tavangarian
{"title":"Associative search based test algorithms for test acceleration in FAST-RAMs","authors":"C. Elm, D. Tavangarian","doi":"10.1109/MT.1993.263152","DOIUrl":null,"url":null,"abstract":"To accelerate deterministic functional memory chip testing, the authors propose modifying a memory chip using circuit structures known from flag-oriented associative memories. Based on these modifications new test algorithms have been developed. Compared with existing test algorithms the complexity of algorithms developed for fault detection is one or two orders lower. For fault localization it is approximately one order lower and depends additionally on the number of faulty cells in a memory chip. It is shown that this complexity can be reduced further using contents-oriented processing of the information stored in a memory with corresponding circuit structures. In this contribution the basics of the new test approach, the structure of the newly developed test algorithms, the hardware requirements and the achievable test acceleration are discussed.<<ETX>>","PeriodicalId":248811,"journal":{"name":"Records of the 1993 IEEE International Workshop on Memory Testing","volume":"713 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Records of the 1993 IEEE International Workshop on Memory Testing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MT.1993.263152","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

To accelerate deterministic functional memory chip testing, the authors propose modifying a memory chip using circuit structures known from flag-oriented associative memories. Based on these modifications new test algorithms have been developed. Compared with existing test algorithms the complexity of algorithms developed for fault detection is one or two orders lower. For fault localization it is approximately one order lower and depends additionally on the number of faulty cells in a memory chip. It is shown that this complexity can be reduced further using contents-oriented processing of the information stored in a memory with corresponding circuit structures. In this contribution the basics of the new test approach, the structure of the newly developed test algorithms, the hardware requirements and the achievable test acceleration are discussed.<>
基于关联搜索的fast - ram测试加速算法
为了加速确定性功能记忆芯片的测试,作者提出了使用从面向标志的联想记忆中已知的电路结构来修改记忆芯片。在这些改进的基础上,开发了新的测试算法。与现有的测试算法相比,所开发的故障检测算法的复杂度降低了一到两个数量级。对于故障定位,它大约低一个阶,并且另外取决于存储芯片中故障单元的数量。结果表明,使用具有相应电路结构的存储器中存储的信息的面向内容处理可以进一步降低这种复杂性。本文讨论了新测试方法的基本原理、新开发的测试算法的结构、硬件要求和可实现的测试加速。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信