Pseudorandom Pattern Generation by a 4-Neighborhood Cellular Automata Based on a Probabilistic Analysis

In this article, we construct a random number generator using a one dimensional, nonuniform 4-Neighborhood Cellular Automata (4NCA). A probabilistic analysis of CA rules has been done to select the appropriate rules for 4NCA random number generator (RNG). A comparison is made between the pseudo random patterns generated by using the proposed CA RNGs with those obtained using a recent Cellular Programming (CP) evolved CA RNGs. The results show that our approach outperforms CP both in terms of average time taken to evolve CA rules and in terms of quality of pseudo random patterns generated. The proposed approach is also shown to be better than the common generators such as Shift Register, Congruential Generator and Lagged Fibonacci Generator.