Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/1403
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Tan, SK | - |
dc.contributor.author | Guan, SU | - |
dc.coverage.spatial | 31 | en |
dc.date.accessioned | 2007-12-14T10:07:06Z | - |
dc.date.available | 2007-12-14T10:07:06Z | - |
dc.date.issued | 2007 | - |
dc.identifier.citation | Electronic version of an article published as International Journal of Modern Physics C, 18(2): 217-234, Feb 2007 | en |
dc.identifier.issn | 0096-3003 | - |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/1403 | - |
dc.description.abstract | The proposed Layered Cellular Automata (L-LCA), which comprises of a main CA with L additional layers of memory registers, has simple local interconnections and high operating speed. The time-varying L-LCA transformation at each clock can be reduced to a single transformation in the set formed by the transformation matrix of a maximum length Cellular Automata (CA), and the entire transformation sequence for a single period can be obtained. The analysis for the period characteristics of state sequences is simplified by analyzing representative transformation sequences determined by the phase difference between the initial states for each layer. The L-LCA model can be extended by adding more layers of memory or through the use of a larger main CA based on widely available maximum length CA. Several L-LCA (L=1,2,3,4) with 10- to 48-bit main CA are subjected to the DIEHARD test suite and better results are obtained over other CA designs reported in the literature. The experiments are repeated using the well-known nonlinear functions and in place of the linear function used in the L-LCA. Linear complexity is significantly increased when or is used. | en |
dc.format.extent | 219857 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | World Scientific Publishing Company | en |
dc.subject | Cellular automata | en |
dc.subject | Programmable cellular automata | en |
dc.subject | Pseudorandom number generation | en |
dc.title | Layered cellular automata for pseudorandom number generation | en |
dc.type | Research Paper | en |
dc.identifier.doi | http://dx.doi.org/10.1142/S0129183107010413 | - |
Appears in Collections: | Electronic and Electrical Engineering Dept of Electronic and Electrical Engineering Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Layered Cellular Automata for Pseudorandom Number Generation - IJMPC.pdf | 214.7 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.