Abstract. We study the class of “bounded faults ” in random-access memories; these are faults that involve a bounded number of cells. This is a very general class of memory faults that includes, for example, the usual stuck-at, coupling, and pattern-sensitive faults, but also many other types of faults. Some bounded faults are known to require deterministic tests of length proportional to n log2 n, where n is the total number of memory cells. The main result of this paper is that, for any bounded fault satisfying certain very mild conditions, the random test length required for a given level of confidence is always O.n/
105 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988.Presented in this thesis is a...
[[abstract]]Although there are well known test algorithms that have been used by the industry for ye...
[[abstract]]In this paper, we present a memory fault simulator called the Random Access Memory Simul...
The number of (random) patterns required for random testing of RAMs (random-access memories), when c...
Abstract. This article presents results fundamental to the problem of detecting coupling faults in r...
Abstract. This article is concerned with the detection of write-triggered coupling faults and toggli...
ISBN: 0818607033The number of random patterns required is determined for random testing of RAMs when...
[[abstract]]© 2002 Institute of Electrical and Electronics Engineers - The size and density of semic...
Random-access memory (RAM) testing to detect unrestricted pattern-sensitive faults (PSFs) is impract...
Abstract: This paper presents an overview of the problem of testing semiconductor random access memo...
Abstract. This article presents a design strategy for efficient and comprehensive random testing of ...
The urgency of the problem of testing storage devices of modern computer systems is shown. The mathe...
Traditional tests for memories are based on conventional fault models, involving the address decoder...
[[abstract]]© 2002 Institute of Electrical and Electronics Engineers - The authors present test algo...
[[abstract]]Although there are well known test algorithms that have been used by the industry for ye...
105 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988.Presented in this thesis is a...
[[abstract]]Although there are well known test algorithms that have been used by the industry for ye...
[[abstract]]In this paper, we present a memory fault simulator called the Random Access Memory Simul...
The number of (random) patterns required for random testing of RAMs (random-access memories), when c...
Abstract. This article presents results fundamental to the problem of detecting coupling faults in r...
Abstract. This article is concerned with the detection of write-triggered coupling faults and toggli...
ISBN: 0818607033The number of random patterns required is determined for random testing of RAMs when...
[[abstract]]© 2002 Institute of Electrical and Electronics Engineers - The size and density of semic...
Random-access memory (RAM) testing to detect unrestricted pattern-sensitive faults (PSFs) is impract...
Abstract: This paper presents an overview of the problem of testing semiconductor random access memo...
Abstract. This article presents a design strategy for efficient and comprehensive random testing of ...
The urgency of the problem of testing storage devices of modern computer systems is shown. The mathe...
Traditional tests for memories are based on conventional fault models, involving the address decoder...
[[abstract]]© 2002 Institute of Electrical and Electronics Engineers - The authors present test algo...
[[abstract]]Although there are well known test algorithms that have been used by the industry for ye...
105 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988.Presented in this thesis is a...
[[abstract]]Although there are well known test algorithms that have been used by the industry for ye...
[[abstract]]In this paper, we present a memory fault simulator called the Random Access Memory Simul...