A VLSI implementation of cellular automata randomizers

The paper presents the general design of integrated cellular automata randomizers. An important aim of the paper is to highlight the specificity of pseudo-random sequence generation between other cellular automata applications and to present the structures and types of output of cellular automata-based pseudo-random sequence generator. The paper also presents a new model of generalized cellular automata, that includes a supplementary memory layer for improving the statistical properties of the random signal and sequence generator. One important aspect of the dynamics of cellular automata is that in many cases there are no means to predict the behavior of the system (excepting, of course, to run the system itself). Therefore, in these cases-which are also the cases most appropriate for our application-the experiment is the only solution to guarantee the quality of the generator. The VLSI implementation of cellular automata randomizers is dedicated first of all for testing the properties of these randomizers.