Industry 4.0
Vol. 6 (2021), Issue 1, pg(s) 3-6

TECHNOLOGICAL BASIS OF “INDUSTRY 4.0”

Generation of test sequences with a given switching activity

  • 1 Weird Science Club, Lichtenbergschule Darmstadt

Abstract

The Proposed study is based on the universal method of quasi-random Sobol sequences generation, efficiently used for address test sequence formation. As the mathematical model, a modification of the economical method of Antonov and Saleev is used. The main idea of the suggested approach is the use of generating matrixes with not necessarily the maximum rank for the procedure of generating test patterns. The proposed approach allows the generation of significantly more different sequences with different switching activities of the individual bits as well as the sequences itself. Mathematical expressions are obtained that make it possible to estimate the limiting values of the switching activity, both of the test sequence itself and the individual bits. Examples of the application of the proposed methods are considered.

Keywords

References

  1. M.L. Bushnell and V.D. Agrawal, New York: Kluwer Academic Publishers, Essentials of Electronic Testing for Digital, Memory & Mixed-Signal VLSI Circuits (2000).
  2. L.-T. Wang, C.-W. Wu and X. Wen, New York: Elsevier Inc. VLSI Test Principles and Architectures: Design for Testability. (2006).
  3. I. A. Grout, Springer-Verlag, Integrated Circuit Test Engineering. Modern Techniques (2006).
  4. E.J. Marinissen, B. Prince, D. Keitel-Schulz and Y. Zorian, Proc. of Design, Automation and Test in Europe Conference and Exhibition, Munich, Germany, Challenges in Embedded Memory Design and Test, pp. 722–727 (2005).
  5. V.N. Yarmolik, Bestprint, Kontrol’ I diagnostika vuchislitel’nuh system (2019).
  6. I. Pomeranz, IEEE Trans. Comput., An Adjacent Switching Activity Metric under Functional Broadside Tests, vol. 62, № 4, pp. 404–410 (2013).
  7. P.A Girard, L. Guiller, C. Landrault, and S. Pravossondovitch, Proc. Ninth Great Lakes Symposium on VLSI, A test vector ordering technique for switching activity reduction during test operation, pp. 24–27 (1999).
  8. S. Wang and S.K. Gupta, IEEE Trans. Comput.-Aided Design of Integr. Circuits and Systems, An automatic test pattern generator for minimizing switching activity during scan testing activity, vol. 21, № 8, pp. 954–968 (2002).
  9. S. Saravanan, M. Hailu, G.M. Gouse, M. Lavanya, and R. Vijaysai, Proc. of 6th EAI International Conference, ICAST, Bahir Dar, Ethiopia, Design and Analysis of Low-Transition Address Generator (2018).
  10. P.A. Pavani, G. Anitha, J. Bhavana, and J.P. Raj, Inter. J. of Scien. & Eng. Research, Novel Architecture Design of Address Generators for BIST Algorithms, vol. 7, № 2, pp. 1484–1488 (2016).
  11. V.N. Yarmolik, and S.V. Yarmolik, Autom. Control Comput. Sci, Address sequences, pp. 207–213, vol. 48, № 4 (2014).
  12. B. Singh, S. Narang, and A. Khosla, IJCSI Int. J. Comput Sci. Issues, Address Counter / Generators for Low Power Memory BIST, vol. 8, Issue 4, № 1, pp. 561–567 (2011)
  13. I. Mrozek and V.N. Yarmolik, Journal of Electronic Testing: Theory and Applications, Iterative Antirandom Testing, vol. 9, № 3, pp. 251–266
  14. Yarmolik, V.N. and Yarmolik, S.V., Generating Modified Sobol Sequences for Multiple Run March Memory Test, Autom. Control Comput. Sci, vol. 47, № 5, pp. 242–247 (2013).
  15. V.N. Yarmolik, and S.V. Yarmolik, Autom. Control Comput. Sci, Address sequences for multiple-run March tests of random-access memory, vol. 40, № 5, pp. 42–49. (2006)
  16. A.J. Goor, H. Kukner, and S. Hamdioui, , Proc. of 2011 6th Int. Conf. on Design & Tech. of Integrated Systems in Nanoscale Era, Optimizing memory BIST Address Generator implementations, pp. 572–576 (2011).
  17. V.N. Yarmolik, and M.A. Shauchenka, Informatics, Generation of address sequences with a given switching activity vol. 17, № 1, pp. 47–62 (2020).
  18. S. Boyd, Cambridge, UK: University Printing House, Introduction to Applied Linear Algebra: Vectors, Matrices, and Least Squares (2018).
  19. P. Ferreira, B. Jesus, J. Vieira, and A.J. Pinho, IEEE Communic. Let., The Rank of Random Binary Matrices and Distributed Storage Applications, vol. 17, № 1, pp. 151–154 (2013).
  20. I.A. Antonov, and V.M. Saleev, Zh. Vychisl. Matem. Mat. Fiz, Economical method of LP sequences calculation, vol. 19, pp. 243–245 (1979).

Article full text

Download PDF