Please use this identifier to cite or link to this item:
Title: Layered cellular automata for pseudorandom number generation
Authors: Tan, SK
Guan, SU
Keywords: Cellular automata;Programmable cellular automata;Pseudorandom number generation
Issue Date: 2007
Publisher: World Scientific Publishing Company
Citation: Electronic version of an article published as International Journal of Modern Physics C, 18(2): 217-234, Feb 2007
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.
ISSN: 0096-3003
Appears in Collections:Electronic and Computer Engineering
Dept of Electronic and Computer Engineering Research Papers

Files in This Item:
File Description SizeFormat 
Layered Cellular Automata for Pseudorandom Number Generation - IJMPC.pdf214.7 kBAdobe PDFView/Open

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