Please use this identifier to cite or link to this item:
Title: Configurable cellular automata for pseudorandom number generation
Authors: Quieta, MT
Guan, SU
Keywords: Random number generation;Cellular automata;Configurable cellular automata
Issue Date: 2005
Publisher: World Scientific
Citation: International Journal of Modern Physics C. 16 (7): 1051-1073, Jul 2005
Abstract: This paper proposes a generalized structure of cellular automata (CA) – the configurable cellular automata (CoCA). With selected properties from programmable CA (PCA) and controllable CA (CCA), a new approach to cellular automata is developed. In CoCA, the cells are dynamically reconfigured at run-time via a control CA. Reconfiguration of a cell simply means varying the properties of that cell with time. Some examples of properties to be reconfigured are rule selection, boundary condition, and radius. While the objective of this paper is to propose CoCA as a new CA method, the main focus is to design a CoCA that can function as a good pseudorandom number generator (PRNG). As a PRNG, CoCA can be a suitable candidate as it can pass 17 out of 18 Diehard tests with 31 cells. CoCA PRNG’s performance based on Diehard test is considered superior over other CA PRNG works. Moreover, CoCA opens new rooms for research not only in the field of random number generation, but in modeling complex systems as well.
ISSN: 0129-1831
Appears in Collections:Electronic and Computer Engineering
Dept of Electronic and Computer Engineering Research Papers

Files in This Item:
File Description SizeFormat 
Configurable Cellular Automata for Pseudorandom Number Generation.pdf146.82 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.