Please use this identifier to cite or link to this item:
|Title:||Optimization of 2D lattice cellular automata for pseudorandom number generation|
|Keywords:||2D cellular automata|
Pseudorandom number generation
|Source:||Quieta, M.T.R., Guan, S.-U. (2005-03). Optimization of 2D lattice cellular automata for pseudorandom number generation. International Journal of Modern Physics C 16 (3) : 479-500. ScholarBank@NUS Repository. https://doi.org/10.1142/S0129183105007303|
|Abstract:||This paper proposes a generalized approach to 2D CA PRNGs - the 2D lattice CA PRNG - by introducing vertical connections to arrays of ID CA. The structure of a 2D lattice CA PRNG lies in between that of ID CA and 2D CA grid PRNGs. With the generalized approach, 2D lattice CA PRNG offers more 2D CA PRNG variations. It is found that they can do better than the conventional 2D CA grid PRNGs. In this paper, the structure and properties of 2D lattice CA are explored by varying the number and location of vertical connections, and by searching for different 2D array settings that can give good randomness based on Diehard test. To get the most out of 2D lattice CA PRNGs, genetic algorithm is employed in searching for good neighborhood characteristics. By adopting an evolutionary approach, the randomness quality of 2D lattice CA PRNGs is optimized. In this paper, a new metric, #rn is introduced as a way of finding a 2D lattice CA PRNG with the least number of cells required to pass Diehard test. Following the introduction of the new metric #rn, a cropping technique is presented to further boost the CA PRNG performance. The cost and efficiency of 2D lattice CA PRNG is compared with past works on CA PRNGs. © 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 Mar 7, 2018
WEB OF SCIENCETM
checked on Jan 24, 2018
checked on Mar 11, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.