Monte Carlo methods. Vol. 1: basics
Monte Carlo methods. Vol. 1: basics
Random sequence generation by cellular automata
Advances in Applied Mathematics
Random number generators: good ones are hard to find
Communications of the ACM
Importance Sampling for Ising Computers Using One-Dimensional Cellular Automata
IEEE Transactions on Computers
Parallel Random Number Generation for VLSI Systems Using Cellular Automata
IEEE Transactions on Computers
A class of two-dimensional cellular automata and their applications in random pattern testing
Journal of Electronic Testing: Theory and Applications
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Generating high-quality random numbers in parallel by cellular automata
Future Generation Computer Systems - Special issue on cellular automata: promise in computational science
On the Generation of High-Quality Random Numbers by Two-Dimensional Cellular Automata
IEEE Transactions on Computers
A new kind of science
Shift Register Sequences
A High-Performance, Pipelined, FPGA-Based Genetic Algorithm Machine
Genetic Programming and Evolvable Machines
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
High Quality Uniform Random Number Generation Using LUT Optimised State-transition Matrices
Journal of VLSI Signal Processing Systems
Multivariate Gaussian Random Number Generation Targeting Reconfigurable Hardware
ACM Transactions on Reconfigurable Technology and Systems (TRETS)
Implementing a Margolus Neighborhood Cellular Automata on a FPGA
IWANN '03 Proceedings of the 7th International Work-Conference on Artificial and Natural Neural Networks: Part II: Artificial Neural Nets Problem Solving Methods
ARC'07 Proceedings of the 3rd international conference on Reconfigurable computing: architectures, tools and applications
Hash-life algorithm on 3D excitable medium application to integrative biology
Proceedings of the 2010 Summer Computer Simulation Conference
A tool for implementing and exploring SBM models: universal 1D invertible cellular automata
IWINAC'05 Proceedings of the First international conference on Mechanisms, Symbols, and Models Underlying Cognition: interplay between natural and artificial computation - Volume Part I
FPGA implementations of the RNR cellular automata to model electrostatic field
VECPAR'04 Proceedings of the 6th international conference on High Performance Computing for Computational Science
| Hi-index | 0.00 |
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.