Permutation and sampling with maximum length CA or pseudorandom number generation

Sastra Wijaya; Syn Kiat Tan; Sheng Uei Guan

doi:10.1016/j.amc.2006.06.099

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 journal › Article › peer-review

5 Citations (Scopus)

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.

Original language	English
Pages (from-to)	312-321
Number of pages	10
Journal	Applied Mathematics and Computation
Volume	185
Issue number	1
DOIs	https://doi.org/10.1016/j.amc.2006.06.099
Publication status	Published - 1 Feb 2007
Externally published	Yes

Keywords

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

Access to Document

10.1016/j.amc.2006.06.099

Cite this

@article{51074bf027924d50afca2ceda0c2f0be,

title = "Permutation and sampling with maximum length CA or pseudorandom number generation",

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.",

keywords = "Cellular automata, Data-dependent permutation, Dynamic sampling, Pseudorandom number generation, Randomness testing",

author = "Sastra Wijaya and Tan, {Syn Kiat} and Guan, {Sheng Uei}",

year = "2007",

month = feb,

day = "1",

doi = "10.1016/j.amc.2006.06.099",

language = "English",

volume = "185",

pages = "312--321",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

number = "1",

}

TY - JOUR

T1 - Permutation and sampling with maximum length CA or pseudorandom number generation

AU - Wijaya, Sastra

AU - Tan, Syn Kiat

AU - Guan, Sheng Uei

PY - 2007/2/1

Y1 - 2007/2/1

N2 - 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.

AB - 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.

KW - Cellular automata

KW - Data-dependent permutation

KW - Dynamic sampling

KW - Pseudorandom number generation

KW - Randomness testing

UR - http://www.scopus.com/inward/record.url?scp=33846903280&partnerID=8YFLogxK

U2 - 10.1016/j.amc.2006.06.099

DO - 10.1016/j.amc.2006.06.099

M3 - Article

AN - SCOPUS:33846903280

SN - 0096-3003

VL - 185

SP - 312

EP - 321

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

IS - 1

ER -

Permutation and sampling with maximum length CA or pseudorandom number generation

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this