Random sequence generation by cellular automata
Advances in Applied Mathematics
A new kind of science
The Emergence of Cellular Computing
Computer
Two-Pattern Test Capabilities of Autonomous TPG Circuits
Proceedings of the IEEE International Test Conference on Test: Faster, Better, Sooner
A Hardware Random Number Generator
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
A Cellular Automata System with FPGA
FCCM '01 Proceedings of the the 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
Sparse Matrix-Vector Multiplication Design on FPGAs
FCCM '07 Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
The research of self-repairing digital circuit based on embryonic cellular array
Neural Computing and Applications
Modeling urban traffic: a cellular automata approach
IEEE Communications Magazine
Adder Designs and Analyses for Quantum-Dot Cellular Automata
IEEE Transactions on Nanotechnology
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Cellular automata-based pseudorandom number generators for built-in self-test
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Pseudorandom number generation with self-programmable cellular automata
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Measuring the Gap Between FPGAs and ASICs
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Design and Simulation of 2-D 2-Dot Quantum-Dot Cellular Automata Logic
IEEE Transactions on Nanotechnology
| Hi-index | 0.00 |
Cellular computing represents a new paradigmfor implementing high-speed massively parallel machines. Cellular automata (CA), which consist of an array of locally connected processing elements, are a basic formof a cellular-based architecture. The use of field programmable gate arrays (FPGAs) for implementing CA accelerators has shown promising results. This paper investigates the design of CA-based pseudo-random number generators (PRNGs) using an FPGA platform. To improve the quality of the random numbers that are generated, the basic CA structure is enhanced in two ways. First, the addition of a superrule to each CA cell is considered. The resulting self-programmable CA (SPCA) uses the superrule to determine when to make a dynamic rule change in each CA cell. The superrule takes its inputs from neighboring cells and can be considered itself a second CA working in parallel with the main CA. When implemented on an FPGA, the use of lookup tables in each logic cell removes any restrictions on how the super-rules should be defined. Second, a hybrid configuration is formed by combining a CA with a linear feedback shift register (LFSR). This is advantageous for FPGA designs due to the compactness of the LFSR implementations. A standard software package for statistically evaluating the quality of random number sequences known as Diehard is used to validate the results. Both the SPCA and the hybrid CA/LFSR were found to pass all the Diehard tests.