Ackermann, J., U. Tangen, B. Bödekker, J. Breyer, E. Stoll, and J. S. McCaskill. “Parallel random number generator for inexpensive configurable hardware cells.” Computer physics communications 140, no. 3 (2001): 293-302.
A new random number generator (rng) adapted to parallel processors has been created. This rng can be implemented with inexpensive hardware cells. The correlation between neighboring cells is suppressed with smart connections. With such connection structures, sequences of pseudo-random numbers are produced. Numerical tests including a self-avoiding random walk test and the simulation of the order parameter and energy of the 2D Ising model give no evidence for correlation in the pseudo-random sequences. Because the new random number generator has suppressed the correlation between neighboring cells which is usually observed in cellular automaton implementations, it is applicable for extended time simulations. It gives an immense speed-up factor if implemented directly in configurable hardware, and has recently been used for long time simulations of spatially resolved molecular evolution.