March tests for word-oriented memories

被引:52
|
作者
van de Goer, AJ [1 ]
Tlili, IBS [1 ]
机构
[1] Delft Univ Technol, Fac Informat Technol & Syst, Sect Comp Architecture & Digital Technique, NL-2628 CD Delft, Netherlands
来源
DESIGN, AUTOMATION AND TEST IN EUROPE, PROCEEDINGS | 1998年
关键词
bit-oriented memories; word-oriented memories; memory rests; march tests; data backgrounds; fault models;
D O I
10.1109/DATE.1998.655905
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Most memory rest algorithms are optimized tests for a particular memory technology and a particular set of fault models, under the assumption that the memory is bit-oriented; i.e., read and write operations affect only a single bit in the memory. Traditionally, word-oriented memories have been tested by repeated application of a test for bit-oriented memories whereby a different data background (which depends on the used intra-word fault model) is used during each iteration. This results in time inefficiencies and limited fault coverage. A new approach for testing word-oriented memories is presented, distinguishing between inter-word and intra-word faults and allowing for a systematic way of converting tests for bit-oriented memories to tests for word-oriented memories. The conversion consists of concatenating the bit-oriented test for inter-word faults with a test for intra-word faults. This approach results in more efficient tests with complete coverage of the targeted faults. Because most memories have an external data path which is wider than one bit, word-oriented memory tests are very important.
引用
收藏
页码:501 / 508
页数:8
相关论文
共 50 条
  • [21] Testing of inter-word coupling faults in word-oriented SRAMs
    Wang, X
    Ottavi, M
    Lombardi, F
    19TH IEEE INTERNATIONAL SYMPOSIUM ON DEFECT AND FAULT TOLERANCE IN VLSI SYSTEMS, PROCEEDINGS, 2004, : 111 - 119
  • [22] New application methods for word-oriented cryptographic primitives
    Yang Yang
    Zeng Guang
    Jin ChengHui
    Qu YunYing
    SCIENCE CHINA-INFORMATION SCIENCES, 2012, 55 (09) : 2149 - 2160
  • [23] New application methods for word-oriented cryptographic primitives
    YANG Yang 1
    2 State Key Laboratory of Information Security
    ScienceChina(InformationSciences), 2012, 55 (09) : 2149 - 2160
  • [24] Exploiting multiples of the connection polynomial in word-oriented stream ciphers
    Hawkes, P
    Rose, GG
    ADVANCES IN CRYPTOLOGY ASIACRYPT 2000, PROCEEDINGS, 2000, 1976 : 303 - 316
  • [25] Single-Error-Correction Code for Simultaneous Testing of Data Bit and Check Bit Arrays for Word-Oriented Memories
    Cha, Sanguhn
    Yoon, Hongil
    IEEE TRANSACTIONS ON DEVICE AND MATERIALS RELIABILITY, 2013, 13 (01) : 266 - 271
  • [26] A Word-Oriented Stream Cipher For 3rd Generation: TAIYI
    Zeng, Guang
    Han, Wenbao
    He, Kaicheng
    Wang, Zheng
    2008 THIRD INTERNATIONAL CONFERENCE ON COMMUNICATIONS AND NETWORKING IN CHINA, VOLS 1-3, 2008, : 1094 - 1098
  • [27] Fast computation of linear approximation of general word-oriented composite function
    Ma, Sudong
    Jin, Chenhui
    Guan, Jie
    Guan, Ziyu
    Liu, Shuai
    DISCRETE APPLIED MATHEMATICS, 2025, 364 : 157 - 172
  • [28] A programmable boundary scan technique for board-level, parallel functional duplex march testing of word-oriented multiport static RAMs
    Chakraborty, K
    Mazumder, P
    EUROPEAN DESIGN & TEST CONFERENCE - ED&TC 97, PROCEEDINGS, 1997, : 330 - 334
  • [29] Primitive polynomials, singer cycles and word-oriented linear feedback shift registers
    Ghorpade, Sudhir R.
    Ul Hasan, Sartaj
    Kumari, Meena
    DESIGNS CODES AND CRYPTOGRAPHY, 2011, 58 (02) : 123 - 134
  • [30] SRAM word-oriented redundancy methodology using, built in self-repair
    Lee, J
    Lee, YJ
    Kim, YB
    IEEE INTERNATIONAL SOC CONFERENCE, PROCEEDINGS, 2004, : 219 - 222