Please use this identifier to cite or link to this item:
Title: Permutation and sampling with maximum length CA for pseudorandom number generation
Authors: Wijaya, S
Tan, SK
Guan, SU
Keywords: Cellular automata; Pseudorandom number generation; Randomness testing; Data-dependent permutation; Dynamic sampling
Issue Date: 2007
Publisher: Elsevier
Citation: Applied Mathematics and Computation, 185(1): 312-321, Feb 2007
Abstract: In this paper, we study the effect of dynamic permutation and sampling on the randomness quality of sequences generated by cellular automata (CA). Dynamic permutation and sampling have not been explored in previous CA work and a suitable implementation is shown using a two CA model. Three different schemes that incorporate these two operations are suggested - Weighted Permutation Vector Sampling with Controlled Multiplexing, Weighted Permutation Vector Sampling with Irregular Decimation and Permutation Programmed CA Sampling. The experiment results show that the resulting sequences have varying degrees of improvement in DIEHARD results and linear complexity compared to the CA.
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 
Permutation and Sampling with Maximum Length CA for Pseudorandom Number Generation.pdf89.79 kBAdobe PDFView/Open

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