Permutation and sampling with maximum length CA or pseudorandom number generation

Sastra Wijaya, Syn Kiat Tan, Sheng Uei Guan*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)312-321
Number of pages10
JournalApplied Mathematics and Computation
Issue number1
Publication statusPublished - 1 Feb 2007
Externally publishedYes


  • Cellular automata
  • Data-dependent permutation
  • Dynamic sampling
  • Pseudorandom number generation
  • Randomness testing


Dive into the research topics of 'Permutation and sampling with maximum length CA or pseudorandom number generation'. Together they form a unique fingerprint.

Cite this