Optimization of 1D and 2D Cellular Automata for Pseudo Random Number Generator
The present day communication systems require low power consumption and low complexity of their implementation solutions. In this paper, the authors have implemented 1D binary cellular automata with wrap around at the edges (i.e. a ring). The default update rule used is rule 30 discovered by the researcher. Rule 30 is an update rule that when applied to the CA will produce a class III, a periodic, chaotic behavior. The response with respect to rule 2 and rule 90 is also verified on Xilinx Spartan 3E FPGA and this can be applied for modeling PRNG.