It 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.
@article{bwmeta1.element.bwnjournal-article-amcv18i3p329bwm,
author = {Svetlana Yarmolik},
title = {Address sequences and backgrounds with different Hamming distances for multiple run March tests},
journal = {International Journal of Applied Mathematics and Computer Science},
volume = {18},
year = {2008},
pages = {329-339},
zbl = {1178.94268},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-amcv18i3p329bwm}
}
Svetlana Yarmolik. Address sequences and backgrounds with different Hamming distances for multiple run March tests. International Journal of Applied Mathematics and Computer Science, Tome 18 (2008) pp. 329-339. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-amcv18i3p329bwm/
[000] Bernardi E., Sancez M., Squillero G. and Sonza Reorda M. (2006). An effective technique for minimizing the cost of processor software-based diagnosis in SoCs, Proceedings of the Conference on Design, Automation and Test in Europe, Munich, Germany, pp. 412-417.
[001] Bernardi P., Grosso M., Rebaudengo M. and Sonza Reorda M. (2005). Exploiting an infrastructure IP to reduce the costs of memory diagnosis in SoCs, Proceedings of the European Test Symposium, Tallinn, Estonia, pp. 202-207.
[002] Cheng K.-L., Tsai M.-F. and Wu C.-W. (2001). Efficient neighborhood pattern-sensitive fault test algorithms for semiconductor memories, Proceedings of the IEEE VLSI Test Symposium (VTS), Marina del Rey, CA, USA, pp. 225-237.
[003] Cheng K.-L., Tsai M.-F. and Wu C.-W. (2002). Neighborhood pattern sensitive fault testing and diagnostics for random access memories, IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems 21(11): 1328-1336.
[004] Cockburn B. E. (1995). Deterministic tests for detecting scrambled pattern-sensitive faults in RAMs, Proceeding IEEE International Workshop on Memory Technology, Design and Testing (MTDT 95), San Jose, CA, USA, pp. 117-122.
[005] Franklin M. and Saluja K. K. (1996). Testing reconfigured RAM's and scrambled address RAM's for pattern sensitive faults, IEEE Transactions on Computer-Aided Design of Integrated Circuits 15(9): 1081-1087.
[006] Gilbert E. N. (1958). Gray codes and paths on the n-cube, Bell System Technical Journal 37: 815-826.
[007] Goor A. J. v. d. (1991). Testing Semiconductor Memories: Theory and Practice, John Wiley & Sons, Chichester.
[008] Gray F. (1958). 2,632,058. Pulse code communication, U.S. Patent
[009] Hayes J. P. (1975). Detection of pattern sensitive faults in random access memories, IEEE Transactions on Computers 24(2): 150-157. | Zbl 0298.94035
[010] Hayes J. P. (1980). Testing memories for single cell pattern sensitive fault, IEEE Transactions on Computers 29(2): 249-254. | Zbl 0431.94054
[011] Li J.-F. (2007). Transparent-test methodologies for random access memories without/with ECC, Transactions on Computer-Aided Design of Integrated Circuits and Systems 26(10): 1888-1983.
[012] Niggemeyer D., Redeker M. and Otterstedt J. (1998). Integration of non-classical faults in standard march tests, Proceedings of the 1998 IEEE International Workshop on Memory Technology, Design and Testing, San Jose, CA, USA, pp. 91-96.
[013] Niggemeyer D., Redeker M. and Rudnick E. (2000). Diagnostic testing of embedded memories based on output tracing, Proceedings of the IEEE International Workshop on Memory Technology, Design and Testing, San Jose, CA, USA, pp. 113-118.
[014] Pomeranz I. and Reddy S. M. (2006). Fault detection by output response comparison of identical circuits using halffrequency compatible sequences, Proceedings of the International Test Conference, Santa Clara, CA, USA, pp. 202-207.
[015] Savage C. (1997). A survey of combinatorial Gray codes, SIAM Review 39(4): 605-629. | Zbl 1049.94513
[016] Sokol B. and Yarmolik S. V. (2006). Address sequence for March tests to detect pattern sensitive faults, Proceedings of the 3rd IEEE International Workshop on Electronic Design Test & Applications (DELTA'06), Kuala Lumpur, Malaysia, pp. 354-357.
[017] Suk D. S. and Reddy S. M. (1980). Test procedures for a class of pattern sensitive faults in semiconductor random access memories, IEEE Transactions on Computers 29(6): 419-429. | Zbl 0436.94043
[018] Yarmolik S. V. (2006). Gray code with maximum of Hamming distance, Proceedings of the 4th International SciencePractice Forum on Information Technologies and Cybernetics, Dnipropetrovsk, Ukraine, p. 77.
[019] Yarmolik S. V. and Sokol B. (2006). Optimal memory address seeds for pattern sensitive faults detection, Proceedings of the IEEE Workshop on Design and Diagnostics of Electronic Circuits and Systems (DDECS'2006), Prague, Czech Republic, pp. 220-221.
[020] Yarmolik S. V. and Yarmolik V. N. (2006a). Memory pattern sensitive faults detection using multiple runs of March tests, Informatics 1(9): 104-113.
[021] Yarmolik V. N., Klimets Y. and Demidenko, S. (1998). March PS(23n) test for DRAM pattem sensitive faults, Proceedings of the 7th IEEE Asian Test Symposium (ATS), Singapore, pp. 354-351.
[022] Yarmolik V. N. and Yarmolik S. V. (2006b). Address sequences for multiple run march tests, Automatic Control and Computer Sciences 5: 59-68. | Zbl 1178.94268