Analysis of Periodic and Intermediate Boundary 90/150 Cellular Automata
IEEE Transactions on Computers
On the Generation of High-Quality Random Numbers by Two-Dimensional Cellular Automata
IEEE Transactions on Computers
| Hi-index | 0.00 |
The cellular automata (CA) have found its application in diverse fields. But in order to utilize the whole state space of a maximum length CA one has to run 2n茂戮驴 1 clock cycles. Using the closure property of a group CA this paper shows how to reach a state which is far from the initial state using very few cycles. It also develops two algorithms to utilize the whole state space of CA using very few cycles. Using these algorithms it creates n×npseudo-random boolean mappings having very good statistical properties.