Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/1133
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Guan, SU | - |
dc.contributor.author | Zhang, S | - |
dc.date.accessioned | 2007-08-07T10:50:33Z | - |
dc.date.available | 2007-08-07T10:50:33Z | - |
dc.date.issued | 2003 | - |
dc.identifier.citation | International Journal of Modern Physics C. 14 (07): 881-896, Sep 2003 | en |
dc.identifier.issn | 0129-1831 | - |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/1133 | - |
dc.description.abstract | Cellular automata (CA) have been used in pseudorandom number generation for over a decade. Recent studies show that controllable CA (CCA) can generate better random sequences than conventional one-dimensional (1-d) CA and compete with two-dimensional (2-d) CA. Yet the structural complexity of CCA is higher than that of 1-d PCA. It would be good if CCA can attain good randomness quality with the least structural complexity. In this paper, we evolve PCA/CCA to their lowest complexity level using genetic algorithms (GAs). Meanwhile, the randomness quality and output efficiency of PCA/CCA are also evolved. The evolution process involves two algorithms a multi-objective genetic algorithm (MOGA) and an algorithm for incremental evolution. A set of PCA/CCA are evolved and compared in randomness, complexity, and efficiency. The results show that without any spacing, CCA could generate good random number sequences that could pass DIEHARD. And, to obtain the same randomness quality, the structural complexity of CCA is not higher than that of 1-d CA. Furthermore, the methodology developed could be used to evolve other CA or serve as a yardstick to compare different types of CA. | en |
dc.format.extent | 199227 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | World Scientific Publishing | en |
dc.source | Electronic version of an article published as Sheng-Uei Guan and Shu Zhang, “Incremental Evolution of Cellular Automata for Random Number Generation”, International Journal of Modern Physics C, Volume 14, Issue 07, pp. 881-896 (2003); Article DOI http://dx.doi.org/10.1142/S0129183103005017; © copyright World Scientific Publishing Company; Journal URL http://www.worldscinet.com/ijmpc/ijmpc.shtml | en |
dc.subject | Controllable cellular automata | en |
dc.subject | Pseudorandom number generation | en |
dc.subject | Multi-objective optimization | en |
dc.subject | Incremental evolution | en |
dc.title | Incremental evolution of cellular automata for random number generation | en |
dc.type | Research Paper | en |
Appears in Collections: | Electronic and Electrical Engineering Dept of Electronic and Electrical Engineering Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Incremental Evolution of Cellular Automata for Random Number Generation.pdf | 194.56 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.