Geodesic
Application of cellular automata with an expanded set of rules to generate pseudo-random test sequences
Problemy fiziki, matematiki i tehniki, no. 1 (2014), pp. 98-104.

Voir la notice de l'article provenant de la source Math-Net.Ru

The article deals with the cellular automata rules classification in the context of generating pseudo-random sequence of the maximum possible length. The analysis of the possible sets of rules was successful and wittingly failed configurations were identified. The technique for selecting a specific set of rules for different situations has been proposed.
Keywords: maximum length pseudorandom sequence, pseudorandom test sequence, cellular automata, cyclic boundary conditions. 
@article{PFMT_2014_1_a16,
     author = {I. A. Murashko and D. E. Hrabrov},
     title = {Application of cellular automata with an expanded set of rules to generate pseudo-random test sequences},
     journal = {Problemy fiziki, matematiki i tehniki},
     pages = {98--104},
     publisher = {mathdoc},
     number = {1},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PFMT_2014_1_a16/}
}
TY  - JOUR
AU  - I. A. Murashko
AU  - D. E. Hrabrov
TI  - Application of cellular automata with an expanded set of rules to generate pseudo-random test sequences
JO  - Problemy fiziki, matematiki i tehniki
PY  - 2014
SP  - 98
EP  - 104
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PFMT_2014_1_a16/
LA  - ru
ID  - PFMT_2014_1_a16
ER  - 
%0 Journal Article
%A I. A. Murashko
%A D. E. Hrabrov
%T Application of cellular automata with an expanded set of rules to generate pseudo-random test sequences
%J Problemy fiziki, matematiki i tehniki
%D 2014
%P 98-104
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PFMT_2014_1_a16/
%G ru
%F PFMT_2014_1_a16
I. A. Murashko; D. E. Hrabrov. Application of cellular automata with an expanded set of rules to generate pseudo-random test sequences. Problemy fiziki, matematiki i tehniki, no. 1 (2014), pp. 98-104. http://geodesic.mathdoc.fr/item/PFMT_2014_1_a16/

[1] V. Agrawal, M. Bushnell, Essentials of Electronic Testing for Digital, Memory, and Mixed-Signal VLSI Circuits, Springer, 2000, 712 pp.

[2] S. W. Golomb, Shift register sequences, Holden-Day, San Francisco, 1967, 224 pp. | MR | Zbl

[3] P. D. Hortensius, “Parallel random number generation for VLSI systems using cellular automata”, IEEE Transactions on Computers, 38:10 (1989), 1466–1473 | DOI

[4] A. M. del Reya, G. R. Sanchez, “Reversibility of linear cellular automata”, Applied Mathematics and Computation, 217 (2011), 8360–8366 | DOI | MR | Zbl

[5] V. N. Yarmolik, I. A. Murashko, “Realizatsiya generatora psevdosluchainoi posledovatelnosti na kletochnykh avtomatakh”, Avtomatika i vychislitelnaya tekhnika, 1993, no. 3, 9–13

[6] K. Cattell, S. Zhang, “Minimal cost one-dimensional linear hybrid cellular automata of degree through 500”, Journal of Electronic Testing: Theory and Applications, 6 (1995), 255–258 | DOI

[7] Z. Cinki, H. Akin, I. Siap, “Reversibility of 1D cellular automata with periodic boundary over finite fields $Z_p$”, Journal of Statistical Physics, 143:4 (2011), 807–823 | DOI | MR | Zbl

[8] J. Kari, “Reversible cellular automata”, Lecture Notes in Computer Science, 3572, 2005, 57–68 | DOI | MR | Zbl

[9] B. Voorhees, “Nearest neightbor cellular automata over $Z_2$ with periodical boundary conditions”, Physica D, 45 (1990), 26–35 | DOI | MR | Zbl

[10] R. Lidl, G. Niderraiter, Konechnye polya, V 2-kh t., per. s angl., v. 1, Mir, M., 1988, 820 pp. | Zbl

[11] R. P. Brent, Three ways to test irreducibility, INRIA, Nancy, France, 2008, 20 pp.

[12] I. A. Murashko, V. N. Yarmolik, Vstroennoe samotestirovanie. Metody minimizatsii energopotrebleniya, LAP Lambert Academic Publishing, Saarbrucken, 2012, 348 pp.