Brunel University Research Archive (BURA) >
College of Engineering, Design and Physical Sciences >
Dept of Electronic and Computer Engineering >
Dept of Electronic and Computer Engineering Research Papers >

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/1116

Title: Pseudorandom number generation with self programmable cellular automata
Authors: Guan, SU
Tan, SK
Keywords: Cellular automata
Pseudorandom number generation
Publication Date: 2004
Publisher: IEEE
Citation: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 23 (7): 1095 - 1101, Jul 2004
Abstract: In this paper, we propose a new class of cellular automata – self programming cellular automata (SPCA) with specific application to pseudorandom number generation. By changing a cell's state transition rules in relation to factors such as its neighboring cell's states, behavioral complexity can be increased and utilized. Interplay between the state transition neighborhood and rule selection neighborhood leads to a new composite neighborhood and state transition rule that is the linear combination of two different mappings with different temporal dependencies. It is proved that when the transitional matrices for both the state transition and rule selection neighborhood are non-singular, SPCA will not exhibit non-group behavior. Good performance can be obtained using simple neighborhoods with certain CA length, transition rules etc. Certain configurations of SPCA pass all DIEHARD and ENT tests with an implementation cost lower than current reported work. Output sampling methods are also suggested to improve output efficiency by sampling the outputs of the new rule selection neighborhoods.
URI: http://bura.brunel.ac.uk/handle/2438/1116
ISSN: 0278-0070
Appears in Collections:Electronic and Computer Engineering
Dept of Electronic and Computer Engineering Research Papers

Files in This Item:

File Description SizeFormat
Pseudorandom number 2004.pdf279.51 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.