Please use this identifier to cite or link to this item:
|Title:||Configurable cellular automata for pseudorandom number generation|
Configurable cellular automata
Random number generation
|Source:||Quieta, M.T., Guan, S.-U. (2005-07). Configurable cellular automata for pseudorandom number generation. International Journal of Modern Physics C 16 (7) : 1051-1073. ScholarBank@NUS Repository. https://doi.org/10.1142/S0129183105007728|
|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. © World Scientific Publishing Company.|
|Source Title:||International Journal of Modern Physics C|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 7, 2017
WEB OF SCIENCETM
checked on Nov 23, 2017
checked on Dec 18, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.