Pseudo-Exhaustive Testing Based on March Tests
暂无分享,去创建一个
[1] Philippe Flajolet,et al. Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search , 1992, Discret. Appl. Math..
[2] Svetlana V. Yarmolik. Address Sequences and Backgrounds with Different Hamming Distances for Multiple Run March Tests , 2008, Int. J. Appl. Math. Comput. Sci..
[3] A. J. van de Goor,et al. Testing Semiconductor Memories: Theory and Practice , 1998 .
[4] Mark G. Karpovsky,et al. Transparent memory testing for pattern sensitive faults , 1994, Proceedings., International Test Conference.
[5] Dimitris Gizopoulos,et al. Recursive Pseudo-Exhaustive Two-Pattern Generation , 2010, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.
[6] Svetlana V. Yarmolik,et al. Generating modified Sobol sequences for multiple run march memory tests , 2013, Automatic Control and Computer Sciences.
[7] Ireneusz Mrozek,et al. Multi Background Memory Testing , 2007, MIXDES 2007.
[8] M. Karpovsky,et al. Exhaustive testing of almost all devices with outputs depending on limited number of inputs , 1994 .
[9] Priyanshu Pandey,et al. A Bist Circuit For Fault Detection Using Pseudo Exhaustive Two Pattern Generator , 2012 .
[10] Ireneusz Mrozek,et al. Two-Run RAM March Testing with Address Decimation , 2017, J. Circuits Syst. Comput..
[11] Mark G. Karpovsky,et al. Pseudo-exhaustive word-oriented DRAM testing , 1995, Proceedings the European Design and Test Conference. ED&TC 1995.
[12] Ireneusz Mrozek,et al. Impact of the address changing on the detection of pattern sensitive faults , 2005, Information Processing and Security Systems.
[13] Ireneusz Mrozek,et al. Antirandom Test Vectors for BIST in Hardware/Software Systems , 2012, Fundam. Informaticae.