Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/1120
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Quieta, MT | - |
dc.contributor.author | Guan, SU | - |
dc.date.accessioned | 2007-08-06T11:55:46Z | - |
dc.date.available | 2007-08-06T11:55:46Z | - |
dc.date.issued | 2005 | - |
dc.identifier.citation | Journal of Modern Physics C. 16 (3): 479-500, Mar 2005 | en |
dc.identifier.issn | 0129-1831 | - |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/1120 | - |
dc.description.abstract | This paper proposes a generalized approach to 2-d CA PRNGs – the 2-d lattice CA PRNG – by introducing vertical connections to arrays of 1-d CA. The structure of a 2-d lattice CA PRNG lies in between that of 1-d CA and 2-d CA grid PRNGs. With the generalized approach, 2-d lattice CA PRNG offers more 2-d CA PRNG variations. It is found that they can do better than the conventional 2-d CA grid PRNGs. In this paper, the structure and properties of 2-d lattice CA are explored by varying the number and location of vertical connections, and by searching for different 2-d array settings that can give good randomness based on Diehard test. To get the most out of 2-d lattice CA PRNGs, genetic algorithm is employed in searching for good neighborhood characteristics. By adopting an evolutionary approach, the randomness quality of 2-d lattice CA PRNGs is optimized. In this paper, a new metric, #rn is introduced as a way of finding a 2-d 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 2-d lattice CA PRNG is compared with past works on CA PRNGs. | en |
dc.format.extent | 105486 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | World Scientific | en |
dc.source | Electronic version of an article published asJournal of Modern Physics C, Vol. 16, No. 3, Mar. 2005; Article DOI http://dx.doi.org/10.1142/S0129183105007303; © copyright World Scientific Publishing Company; Journal URL http://www.worldscinet.com/ijmpc/ijmpc.shtml | en |
dc.subject | Pseudorandom number generation | en |
dc.subject | Cellular automata | en |
dc.subject | 2-d cellular automata | en |
dc.title | Optimization of 2-d lattice cellular automata for pseudorandom 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 | |
---|---|---|---|---|
OPTIMIZATION OF 2-D LATTICE CELLULAR AUTOMATA FOR PSEUDORANDOM NUMBER GENERATION.pdf | 103.01 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.