Universal Address Sequence Generator for Memory Built-in Self-test

• Autorzy: Mrozek Ireneusz , Shevchenko Nikolai A. , Yarmolik Vyacheslav N.

Identyfikatory

DOI

10.3233/FI-222141

• Języki publikacji: EN

Abstrakty

EN

This paper presents the universal address sequence generator (UASG) for memory built-in-self-test. The studies are based on the proposed universal method for generating address sequences with the desired properties for multirun march memory tests. As a mathematical model, a modification of the recursive relation for quasi-random sequence generation is used. For this model, a structural diagram of the hardware implementation is given, of which the basis is a storage device for storing so-called direction numbers of the generation matrix. The form of the generation matrix determines the basic properties of the generated address sequences. The proposed UASG generates a wide spectrum of different address sequences, including the standard ones, such as linear, address complement, gray code, worst-case gate delay, 2i, next address, and pseudorandom. Examples of the use of the proposed methods are considered. The result of the practical implementation of the UASG is presented, and the main characteristics are evaluated.

Słowa kluczowe

EN

antirandom tests; controlled random tests; multiple tests; RAM testing

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2022
• Tom: Vol. 188 nr 1
• Strony: 41--61
• Opis fizyczny: Bibliogr. 50 poz., rys., tab.

Twórcy

autor

Mrozek Ireneusz

• Bialystok University of Technology, Bialystok, Poland

autor

Shevchenko Nikolai A.

• Gymnasium, Darmstadt, Germany

autor

Yarmolik Vyacheslav N.

• Belarusian State University of Informatics and Radioelectronics, Minsk, Belarus

Bibliografia

• [1] Test and Test Equipment. The International Technology Roadmap for Semiconductors, http://wwwitrsnet/.2015.
• [2] Bhunia S, Tehranipoor M. System on Chip (SoC) Design and Test. In: Hardware Security. United States: Morgan Kaufmann Publishers; 2019. p. 47-78.
• [3] Marinissen EJ, Prince B, Keltel-Schulz D, Zorian Y. Challenges in embedded memory design and test. In: Proceedings of the Design, Automation and Test in Europe. vol. 2; 2005. p. 722-727. doi:10.1109/DATE.2005.92.
• [4] Bushnell M, Agrawa DV. Essentials of Electronic Testing for Digital, Memory and Mixed-Signal VLSI Circuits. Frontiers in Electronic Testing. Springer US; 2002. doi:10.1007/b117406.
• [5] Hayes JP. Detection of Pattern-Sensitive Faults in Random-Access Memories. IEEE Transactions on Computers. 1975;24(2):150-157.
• [6] van de Goor AJ. Testing Semiconductor Memories: Theory and Practice. Chichester, England: John Wiley & Sons; 1991. ISBN: 0471925861, 9780471925866.
• [7] Cockburn BF. Deterministic tests for detecting scrambled pattern-sensitive faults in RAMs. In: Proceedings of the IEEE International Workshop on Memory Technology, Design and Testing. IEEE Computer Society; 1995. p. 117-122.
• [8] Franklin M, Saluja KK. Testing reconfigured RAM’s and scrambled address RAM’s for pattern sensitive faults. IEEE Transactions on CAD of Integrated Circuits and Systems. 1996;15(9):1081-1087.
• [9] Cheng KL, Wu CW. Neighborhood Pattern-Sensitive Fault Testing for Semiconductor Memories. In: Proceedings of the VLSI Design/CAD Symposium; 2000. p. 401-404.
• [10] Bernardi P, Grosso M, Reorda MS, Zhang Y. A programmable BIST for DRAM testing and diagnosis. In: Proceedings of the IEEE International Test Conference. ITC’10; 2010. p. 1-10. doi:10.1109/TEST.2010.5699247.
• [11] Sfikas Y, Tsiatouhas Y. Testing Neighbouring Cell Leakage and Transition Induced Faults in DRAMs.IEEE Transactions on Computers. 2016;65(7):2339-2345.
• [12] Cascaval P, Bennett S, Hut¸anu C. Efficient March Tests for a Reduced 3-Coupling and 4-Coupling Faults in Random-Access Memories. Journal of Electronic Testing. 2004;20(3):227-243. Available from: http://dx.doi.org/10.1023/B:JETT.0000029457.21312.23. doi:10.1023/B:JETT.0000029457.21312.23.
• [13] Huzum C, Cascaval P. A Multibackground March Test for Static Neighborhood Pattern-Sensitive Faults in Random-Access Memories. Electronics and Electrical Engineering. 2012;119(3):81-86.
• [14] Wunderlich HJ. Multiple distributions for biased random test patterns. In: Proceedings of the IEEE International Conference on Test: new frontiers in testing. ITC; 1988. p. 236-244.
• [15] Du X, Mukherjee N, Cheng WT, Reddy SM. Full-speed field-programmable memory BIST architecture. In: Proceedings of the IEEE International Conference on Test. ITC; 2005. p. 1173. doi:10.1109/TEST.2005.1584084.
• [16] Aswin AM, Ganesh SS. Implementation and Validation of Memory Built in Self Test (MBIST) Survey (September 11, 2019). International Journal of Mechanical Engineering and Technology. 2019;10(3):153-160.
• [17] Harutyunyan G, Shoukourian S, Zorian Y. Fault Awareness for Memory BIST Architecture Shaped by Multidimensional Prediction Mechanism. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 2019 March;38(3):562-575. doi:10.1109/TCAD.2018.2818688.
• [18] van de Goor AJ, Offerman A, Schanstra I. Towards a Uniform Notation for Memory Tests. In: Proceedings of the European Design and Test Conference. ED&TC. Paris; 1996. p. 420-427. doi:10.1109/EDTC.1996.494335.
• [19] Yarmolik VN, Klimets Y, Demidenko S. March PS(23N) Test for DRAM Pattern-Sensitive Faults. In: Proceedings of the 7th Asian Test Symposium. ATS’98. IEEE Computer Society; 1998. p. 354-357.
• [20] Nicolaidis M. Transparent BIST for RAMs. In: Proceedings IEEE International Test Conference 1992, Discover the New World of Test and Design, Baltimore, Maryland, USA, September 20-24, 1992. IEEE Computer Society; 1992. p. 598-607.
• [21] Karpovsky MG, van de Goor AJ, Yarmolik VN. Pseudo-exhaustive word-oriented DRAM testing. In: Proceedings of the European Conference on Design and Test. EDTC ’95. IEEE Computer Society; 1995. p. 126.
• [22] Kuhn RD, Okum V. Pseudo-Exhaustive Testing for Software. In: Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop. IEEE Computer Society; 2006. p. 153-158.
• [23] Wagner KD, Chin CK, McCluskey EJ. Pseudorandom Testing. IEEE Transactions on Computers. 1987 Mar;36(3):332-343. doi:10.1109/TC.1987.1676905.
• [24] Das D, Karpovsky MG. Exhaustive and Near-Exhaustive Memory Testing Techniques and their BIST Implementations. Journal of Electronic Testing. 1997;10(3):215-229.
• [25] Mrozek I, Yarmolik VN. Iterative Antirandom Testing. Journal of Electronic Testing. 2012 Jun;28(3):301-315.
• [26] Yarmolik SV, Zankovich AP, Ivanyuk AA. Marshevye testy dlya samotestirovaniya OZU (March Tests for RAM Self-testing). Minsk: Beloruss. Gos. Univ.; 2009.
• [27] van de Goor AJ, Kukner H, Hamdioui S. Optimizing memory BIST Address Generator implementations. In: Proceedings of the 6th International Conference on Design Technology of Integrated Systems in Nanoscale Era (DTIS); 2011. p. 1-6.
• [28] Kumar S, Rajkumar M. Efficient Memory Built in Self-Test Address Generator Implementation. International Journal of Applied Engineering Research. 2015;10(7):1679716813.
• [29] Cascaval P, Silion R, Cascaval D. A BIST Logic Design for MarchS(3)C Memory Test BIST Implementation. Romanian Journal of Information Science and Technology. 2009;12(4):440-454.
• [30] van de Goor AJ, Jung C, Hamdioui S, Gaydadjiev G. Low-cost, customized and flexible SRAM MBIST engine. In: Proceedings of the 13th IEEE Symposium on Design and Diagnostics of Electronic Circuits and Systems; 2010. p. 382-387. doi:10.1109/DDECS.2010.5491749.
• [31] Mukherjee N, Pogiel A, Rajski J, Tyszer J. High Volume Diagnosis in Memory BIST Based on Compressed Failure Data. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 2010 March;29(3):441-453. doi:10.1109/TCAD.2010.2041852.
• [32] Saravanan S, Hailu M, Gouse GM, Lavanya M, Vijaysai R. Design and Analysis of Low-Transition Address Generator. In: Zimale FA, Enku Nigussie T, Fanta SW, editors. Advances of Science and Technology. Cham: Springer International Publishing; 2019. p. 239-247.
• [33] Sosnowski J. Analyzing BIST robustness. In: Proceedings of the IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems; 2001. p. 104-109. doi:10.1109/DFTVS.2001.966758.
• [34] Pavani P, Anitha G, Bhavana J, Raj JP. A Novel Architecture Design of Address Generators for BIST Algorithms. International Journal of Scientific & Engineering Research. 2016 Feb;7(2):1484-1488.
• [35] Singh B, Narang SB, Khosla A. Address Counter / Generators for Low Power Memory BIST. International Journal of Computer Science. 2011 July;8(1):561-565.
• [36] Yarmolik VN, Yarmolik SV. Generating modified Sobol sequences for multiple run march memory tests. Automatic Control and Computer Sciences. 2013;47(5):242-247. Available from: http://dx.doi.org/10.3103/S0146411613050088. doi:10.3103/S0146411613050088.
• [37] Savage C. A Survey of Combinatorial Gray Codes. SIAM Review. 1996;39(2):605-629.
• [38] Yarmolik VN, Yarmolik SV. The repeated nondestructive march tests with variable address sequences. Automation and Remote Control. 2007;68(4):688-698.
• [39] Yarmolik SV, Yarmolik VN. Modified Gray And Counter Sequences For Memory Test Address Generation. In: Proceedings of the International Conference Mixed Design of Integrated Circuits and System, 2006. MIXDES 2006. Gdynia, Poland; 2006. p. 572-576.
• [40] Chen TY, Merkel RG. Quasi-Random Testing. IEEE Transactions on Reliability. 2007;56(3):562-568.
• [41] Yarmolik VN, Sokol B, Yarmolik SV. Counter Sequences for Memory Test Address Generation. In: Proceedings of the 12th International Conference Mixed Design of Integrated Circuits and Systems. MIXDES’05. Krakow, Poland: IEEE Computer Society; 2005. p. 413-418.
• [42] Mrozek I, Yarmolik VN. Problemy funkcjonalnego testowania pamieci RAM. Bialystok, Poland: Bialystok University of Technology; 2009. ISSN 0867-096X.
• [43] Boyd S, Vandenberghe L. Introduction to Applied Linear Algebra Vectors, Matrices, and Least Squares. Cambridge University Press; 2018. doi:10.1017/9781108583664.
• [44] Kolchin VF. Random Graphs. Cambridge University Press; 1998. doi:10.1017/CBO9780511721342.
• [45] Yarmolik VN, Yarmolik SV. Address sequences for multi run RAM testing (In Russ.). Informatics. 2014; (2):124-136.
• [46] Yarmolik VN, Mrozek I, Yarmolik SV. Controlled method of random test synthesis. Automatic Control and Computer Sciences. 2016;49(6):395-403. Available from: http://dx.doi.org/10.3103/S0146411615060115. doi:10.3103/S0146411615060115.
• [47] Yarmolik SV, Yarmolik VN. Memory Address Generation for Multiple Run march Tests with Different Average Hamming Distance. In: Proceedings of the IEEE East-West Design and Test Workshop. EWDTW’06. Sochi, Russia; 2006. p. 212-216.
• [48] Mrozek I, Yarmolik VN. Multiple Controlled Random Testing. Fundamenta Informaticae. 2016;144(1): 23-43.
• [49] Mrozek I, Yarmolik VN. Two-Run RAM March Testing with Address Decimation. Journal of Circuits, Systems, and Computers. 2017;26(2):1750031. Available from: http://dx.doi.org/10.1142/S0218126617500311. doi:10.1142/S0218126617500311.
• [50] Liu H, Chen TY. Randomized Quasi-Random Testing. IEEE Transactions on Computers. 2016 June;65(6):1896-1909. doi:10.1109/TC.2015.2455981.