Optimal Memory Address Seeds for Pattern Sensitive Faults Detection

The goal of this paper is to propose a new technique for memory testing based on transparent memory march tests (van de Goor, 1991 and Nicolaidis, 1996). This paper deals with memory pattern sensitive faults detection problem. It shows the efficiency of multiple runs of march tests for memory passive pattern sensitive faults detection and analyzes the optimal address seeds for multiple march test runs. This paper provides only short fragment of carried researches. All results can be found in extended version of this paper

[1]  A.J. van de Goor,et al.  RAM diagnostic tests , 1996, IEEE International Workshop on Memory Technology, Design and Testing,.

[2]  Cheng-Wen Wu,et al.  Neighborhood pattern-sensitive fault testing for semiconductor memories , 2000 .

[3]  Jacob A. Abraham,et al.  Efficient Algorithms for Testing Semiconductor Random-Access Memories , 1978, IEEE Transactions on Computers.

[4]  Michael Nicolaidis,et al.  Theory of Transparent BIST for RAMs , 1996, IEEE Trans. Computers.

[5]  Janak H. Patel,et al.  Parallel Testing for Pattern-Sensitive Faults in Semiconductor Random-Access Memories , 1989, IEEE Trans. Computers.

[6]  A. J. van de Goor,et al.  Testing Semiconductor Memories: Theory and Practice , 1998 .

[7]  Mark G. Karpovsky,et al.  Transparent memory testing for pattern sensitive faults , 1994, Proceedings., International Test Conference.