Modified Gray And Counter Sequences For Memory Test Address Generation

The goal of this paper is to propose the new techniques for memory test address generation for pattern sensitive faults detection. It has been shown that the previous results based on the multiple runs memory testing are very efficient only for the first iterations. To achieve the high fault coverage the different types of modification have to be used. Two kind of memory address transformation have been proposed, analysed and experimentally validated

[1]  Michael Nicolaidis,et al.  TRANSPARENT BIST FOR RAMS , 1992, Proceedings International Test Conference 1992.

[2]  Kuen-Jong Lee,et al.  A complete memory address generator for scan based March algorithms , 2005, 2005 IEEE International Workshop on Memory Technology, Design, and Testing (MTDT'05).

[3]  Carla Savage,et al.  A Survey of Combinatorial Gray Codes , 1997, SIAM Rev..

[4]  John P. Hayes Testing Memories for Single-Cell Pattern-Sensitive Faults , 1980, IEEE Transactions on Computers.

[5]  Tayuan Huang,et al.  Metrics on Permutations, a Survey , 2004 .

[6]  E. Gilbert Gray codes and paths on the N-cube , 1958 .

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

[8]  Svetlana V. Yarmolik,et al.  Address sequences for march tests to detect pattern sensitive faults , 2006, Third IEEE International Workshop on Electronic Design, Test and Applications (DELTA'06).

[9]  Yervant Zorian,et al.  Testing embedded-core based system chips , 1998, Proceedings International Test Conference 1998 (IEEE Cat. No.98CH36270).

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

[11]  Yervant Zorian,et al.  Testing Embedded-Core-Based System Chips , 1999, Computer.

[12]  Erik Jan Marinissen,et al.  Challenges in embedded memory design and test , 2005, Design, Automation and Test in Europe.