Address Sequences and Backgrounds with Different Hamming Distances for Multiple Run March Tests

Author:

Yarmolik Svetlana

Abstract

Address Sequences and Backgrounds with Different Hamming Distances for Multiple Run March TestsIt is widely known that pattern sensitive faults are the most difficult faults to detect during the RAM testing process. One of the techniques which can be used for effective detection of this kind of faults is the multi-background test technique. According to this technique, multiple-run memory test execution is done. In this case, to achieve a high fault coverage, the structure of the consecutive memory backgrounds and the address sequence are very important. This paper defines requirements which have to be taken into account in the background and address sequence selection process. A set of backgrounds which satisfied those requirements guarantee us to achieve a very high fault coverage for multi-background memory testing.

Publisher

Walter de Gruyter GmbH

Subject

Applied Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)

Reference23 articles.

1. An effective technique for minimizing the cost of processor software-based diagnosis in SoCs;E. Bernardi,2006

2. Exploiting an infrastructure IP to reduce the costs of memory diagnosis in SoCs;P. Bernardi,2005

3. Efficient neighborhood pattern-sensitive fault test algorithms for semiconductor memories;K.-L. Cheng,2001

4. Neighborhood pattern sensitive fault testing and diagnostics for random access memories;K.-L. Cheng;IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems,2002

5. Deterministic tests for detecting scrambled pattern-sensitive faults in RAMs;B. Cockburn,1995

Cited by 13 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3