[Randomness in many-connection CAs] - A New Kind of Science: The NKS Forum
A New Kind of Science: The NKS Forum
Randomness in many-connection CAs(Click here to view the original thread with full colors/images)
Posted by: Jason Cawley
A paper at a recent conference explored random number generation from CAs with more general connections between sites. They found a number that pass standard tests for randomness.
Shackleford, B., M. Tanaka, R. J. Carter and G. Snider
FPGA implementation of neighborhood-of-four cellular automata random number generators
Abstract: Random number generators (RNGs) based upon neighborhood-of-four cellular automata (CA) with asymmetrical, non-local connections are explored. A number of RNGs that pass Marsaglia's rigorous Diehard suite of random number tests have been discovered. A neighborhood size of four allows a single CA cell to be implemented with a four-input lookup table and a one-bit register which are common building blocks in popular field programmable gate arrays (FPGAs). The investigated networks all had periodic (wrap around) boundary conditions with either 1-d, 2-d, or 3-d interconnection topologies. Trial designs of 64-bit networks using a Xilinx XCV1000-6 FPGA predict a maximum clock rate of 214 MHz to 230 MHz depending upon interconnection topology.
Forum Sponsored by Wolfram Research
© 2004-2013 Wolfram Research, Inc. | Powered by vBulletin 2.3.0 © 2000-2002 Jelsoft Enterprises, Ltd. |
vB Easy Archive Final - Created by Xenon and modified/released by SkuZZy from the Job Openings