TY - JOUR
T1 - An evolutionary approach to the design of controllable cellular automata structure for random number generation
AU - Guan, Sheng Uei
AU - Zhang, Shu
N1 - Funding Information:
Manuscript received December 4, 2001; revised June 3, 2002 and September 10, 2002. This work was supported by A*Star under Research Grant (ICT/00/013/014). The authors are with the Department of Electrical and Computer Engineering, National University of Singapore, Singapore 119260 (e-mail: eleguans@nus.edu.sg; elezs@nus.edu.sg). Digital Object Identifier 10.1109/TEVC.2002.806856
PY - 2003/2
Y1 - 2003/2
N2 - Cellular automata (CA) has been used in pseudorandom number generation for over a decade. Recent studies show that two-dimensional (2-D) CA pseudorandom number generators (PRNGs) may generate better random sequences than conventional one-dimensional (1-D) CA PRNGs, but they are more complex to implement in hardware than 1-D CA PRNGs. In this paper, we propose a new class of 1-D CA-controllable cellular automata (CCA)-without much deviation from the structural simplicity of conventional 1-D CA. We first give a general definition of CCA and then introduce two types of CCA: CCA0 and CCA2. Our initial study shows that these two CCA PRNGs have better randomness quality than conventional 1-D CA PRNGs, but that their randomness is affected by their structures. To find good CCA0/CCA2 structures for pseudorandom number generation, we evolve them using evolutionary multiobjective optimization techniques. Three different algorithms are presented. One makes use of an aggregation function; the other two are based on the vector-evaluated genetic algorithm. Evolution results show that these three algorithms all perform well. Applying a set of randomness tests on the evolved CCA PRNGs, we demonstrate that their randomness is better than that of 1-D CA PRNGs and can be comparable to that of 2-D CA PRNGs.
AB - Cellular automata (CA) has been used in pseudorandom number generation for over a decade. Recent studies show that two-dimensional (2-D) CA pseudorandom number generators (PRNGs) may generate better random sequences than conventional one-dimensional (1-D) CA PRNGs, but they are more complex to implement in hardware than 1-D CA PRNGs. In this paper, we propose a new class of 1-D CA-controllable cellular automata (CCA)-without much deviation from the structural simplicity of conventional 1-D CA. We first give a general definition of CCA and then introduce two types of CCA: CCA0 and CCA2. Our initial study shows that these two CCA PRNGs have better randomness quality than conventional 1-D CA PRNGs, but that their randomness is affected by their structures. To find good CCA0/CCA2 structures for pseudorandom number generation, we evolve them using evolutionary multiobjective optimization techniques. Three different algorithms are presented. One makes use of an aggregation function; the other two are based on the vector-evaluated genetic algorithm. Evolution results show that these three algorithms all perform well. Applying a set of randomness tests on the evolved CCA PRNGs, we demonstrate that their randomness is better than that of 1-D CA PRNGs and can be comparable to that of 2-D CA PRNGs.
KW - Controllable cellular automata
KW - Genetic algorithms (GAs)
KW - Multiobjective optimization
UR - http://www.scopus.com/inward/record.url?scp=84884209923&partnerID=8YFLogxK
U2 - 10.1109/TEVC.2002.806856
DO - 10.1109/TEVC.2002.806856
M3 - Article
AN - SCOPUS:84884209923
SN - 1089-778X
VL - 7
SP - 23
EP - 36
JO - IEEE Transactions on Evolutionary Computation
JF - IEEE Transactions on Evolutionary Computation
IS - 1
M1 - 1179906
ER -