Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Simple cellular automata as pseudorandom m -sequence generators for built-in self-test

Simple cellular automata as pseudorandom m -sequence generators for built-in self-test We propose an extremely simple and explicit construction of cellular automata (CA) generating pseudorandom m -sequences, which consist of only one type of cells. This construction has advantages over the previous researches in the following points. (1) There is no need to search for primitive polynomials; a simple sufficient number-theoretic condition realizes maximal periodic CA with periods 2 m − 1, m =2, 3, 5, 89, 9689, 21701, 859433. (2) The configuration does not require hybrid constructions. This makes the implementation much easier. This is a modification of the Rule-90 by Wolfram. We list our CAs with maximal period, up to the size 300. We also discuss the controllability of the CA, randomness of the generated sequence, and a two-dimensional version. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Modeling and Computer Simulation (TOMACS) Association for Computing Machinery

Simple cellular automata as pseudorandom m -sequence generators for built-in self-test

Download PDF
12 pages

Loading next page...
 
/lp/association-for-computing-machinery/simple-cellular-automata-as-pseudorandom-m-sequence-generators-for-REA0aRbV8g
Publisher
Association for Computing Machinery
Copyright
Copyright © 1998 by ACM Inc.
ISSN
1049-3301
DOI
10.1145/272991.273007
Publisher site
See Article on Publisher Site

Abstract

We propose an extremely simple and explicit construction of cellular automata (CA) generating pseudorandom m -sequences, which consist of only one type of cells. This construction has advantages over the previous researches in the following points. (1) There is no need to search for primitive polynomials; a simple sufficient number-theoretic condition realizes maximal periodic CA with periods 2 m − 1, m =2, 3, 5, 89, 9689, 21701, 859433. (2) The configuration does not require hybrid constructions. This makes the implementation much easier. This is a modification of the Rule-90 by Wolfram. We list our CAs with maximal period, up to the size 300. We also discuss the controllability of the CA, randomness of the generated sequence, and a two-dimensional version.

Journal

ACM Transactions on Modeling and Computer Simulation (TOMACS) – Association for Computing Machinery

Published: Jan 1, 1998

There are no references for this article.