Pseudo random sequences with cellular automata

  1. Antonio J. Tomeu Hardasmal 1
  2. Esther Lidia Silva Ramírez 1
  1. 1 Departamento de Lenguajes y Sistemas Informáticos Escuela Superior de Ingeniería de Cádiz C/Dr. Marañón s/n. Cádiz, 11003
International Conference on Modelling and Simulation

Publisher: AMSE (

ISBN: 84-699-0452-3

Year of publication: 1999

Pages: 401-407

Type: Conference paper


Random sequence generation is a central topic within the limits of much simulation systems. In this kind of systems, sometimes we need to produce an string of random numbers in order to simulate real situatitons and evaluate the performance under little changes over critical parameters. We can find the classical example when try to simulate a cashiers line of a supermarket. The arrive of the customers follows an statistic distribution, and we need a normal one to simulate it. Normally, random sequences are generated using a linear congruential generator, but in this work, we propose a method which uses cellular automata to produce them. The first approach we are going to select a specific cellular automata; over it, are going to realize statistical test in orden to verify bis randomness, like Chisquare test, gap test and others. Finally, we propose a harware implementation of the generator with less than ten logic gatesper bit of output.