I. A. Murashko, D. E. Hrabrov, “Application of cellular automata with an expanded set of rules to generate pseudo-random test sequences”, PFMT, 2014, no. 1(18), 98

Problemy Fiziki, Matematiki i Tekhniki (Problems of Physics, Mathematics and Technics)

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

	General information
	Latest issue
	Archive

	Search papers
	Search references

	RSS
	Latest issue
	Current issues
	Archive issues
	What is RSS

PFMT:
Year:
Volume:
Issue:
Page:
	Find

Personal entry:
Login:
Password:
	Save password
	Enter
	Forgotten password?
	Register

Problemy Fiziki, Matematiki i Tekhniki (Problems of Physics, Mathematics and Technics), 2014, Issue 1(18), Pages 98–104 (Mi pfmt296)

TECHNICS

Application of cellular automata with an expanded set of rules to generate pseudo-random test sequences

I. A. Murashko, D. E. Hrabrov

P. O. Sukhoi Gomel State Technical University, Gomel, Belarus

Full-text PDF (415 kB)

References:

PDF

HTML

Abstract: 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.

Received: 14.11.2013

Document Type: Article

UDC: 004.3

Language: Russian

Citation: I. A. Murashko, D. E. Hrabrov, “Application of cellular automata with an expanded set of rules to generate pseudo-random test sequences”, PFMT, 2014, no. 1(18), 98–104

Citation in format AMSBIB

\Bibitem{MurKhr14}

\by I.~A.~Murashko, D.~E.~Hrabrov

\paper Application of cellular automata with an expanded set of rules to generate pseudo-random test sequences

\jour PFMT

\yr 2014

\issue 1(18)

\pages 98--104

\mathnet{http://mi.mathnet.ru/pfmt296}

Linking options:

https://www.mathnet.ru/eng/pfmt296

https://www.mathnet.ru/eng/pfmt/y2014/i1/p98

Citing articles in Google Scholar: Russian citations, English citations
Related articles in Google Scholar: Russian articles, English articles

Statistics & downloads:
Abstract page:	175
Full-text PDF :	156
References:	18

Что такое QR-код?

Registration to the website

Logotypes