The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Estudos de geradores de números aleatórios (RNGs) baseados em autômatos celulares (CA) concentraram-se principalmente em redes conectadas simetricamente com tamanhos de vizinhança de três ou cinco. Configurações populares de array de portas programáveis em campo apresentam uma tabela de pesquisa de quatro entradas (ou seja, 16 linhas). A utilização total da tabela de pesquisa de quatro entradas leva ao potencial para redes de autômatos celulares conectadas assimetricamente com um tamanho de vizinhança de quatro. De cada uma das várias redes 1-d, 2-d e 3-d com condições de contorno periódicas, os 1000 CA RNGs de maior entropia foram selecionados do conjunto de 65,536 possíveis implementações uniformes (todas as tabelas verdade de CA iguais). Cada conjunto de 1000 CA de alta entropia foi então submetido ao conjunto DIEHARD de testes de números aleatórios de Marsaglia. Foram descobertos vários RNGs baseados em CA de 64 bits, vizinhos de quatro, que passam em todos os testes no DIEHARD sem recorrer ao espaçamento de site ou de tempo para melhorar a qualidade do RNG.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Barry SHACKLEFORD, Motoo TANAKA, Richard J. CARTER, Greg SNIDER, "Random Number Generators Implemented with Neighborhood-of-Four, Non-locally Connected Cellular Automata" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 12, pp. 2612-2623, December 2002, doi: .
Abstract: Studies of cellular automata (CA) based random number generators (RNGs) have focused mainly upon symmetrically connected networks with neighborhood sizes of three or five. Popular field programmable gate array configurations feature a four-input (i.e., 16-row) lookup table. Full utilization of the four-input lookup table leads to the potential for asymmetrically connected cellular automata networks with a neighborhood size of four. From each of various 1-d, 2-d, and 3-d networks with periodic boundary conditions, the 1000 highest entropy CA RNGs were selected from the set of 65,536 possible uniform (all CA truth tables the same) implementations. Each set of 1000 high-entropy CA was then submitted to Marsaglia's DIEHARD suite of random number tests. A number of 64-bit, neighbor-of-four CA-based RNGs have been discovered that pass all tests in DIEHARD without resorting to either site spacing or time spacing to improve the RNG quality.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_12_2612/_p
Copiar
@ARTICLE{e85-a_12_2612,
author={Barry SHACKLEFORD, Motoo TANAKA, Richard J. CARTER, Greg SNIDER, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Random Number Generators Implemented with Neighborhood-of-Four, Non-locally Connected Cellular Automata},
year={2002},
volume={E85-A},
number={12},
pages={2612-2623},
abstract={Studies of cellular automata (CA) based random number generators (RNGs) have focused mainly upon symmetrically connected networks with neighborhood sizes of three or five. Popular field programmable gate array configurations feature a four-input (i.e., 16-row) lookup table. Full utilization of the four-input lookup table leads to the potential for asymmetrically connected cellular automata networks with a neighborhood size of four. From each of various 1-d, 2-d, and 3-d networks with periodic boundary conditions, the 1000 highest entropy CA RNGs were selected from the set of 65,536 possible uniform (all CA truth tables the same) implementations. Each set of 1000 high-entropy CA was then submitted to Marsaglia's DIEHARD suite of random number tests. A number of 64-bit, neighbor-of-four CA-based RNGs have been discovered that pass all tests in DIEHARD without resorting to either site spacing or time spacing to improve the RNG quality.},
keywords={},
doi={},
ISSN={},
month={December},}
Copiar
TY - JOUR
TI - Random Number Generators Implemented with Neighborhood-of-Four, Non-locally Connected Cellular Automata
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2612
EP - 2623
AU - Barry SHACKLEFORD
AU - Motoo TANAKA
AU - Richard J. CARTER
AU - Greg SNIDER
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E85-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2002
AB - Studies of cellular automata (CA) based random number generators (RNGs) have focused mainly upon symmetrically connected networks with neighborhood sizes of three or five. Popular field programmable gate array configurations feature a four-input (i.e., 16-row) lookup table. Full utilization of the four-input lookup table leads to the potential for asymmetrically connected cellular automata networks with a neighborhood size of four. From each of various 1-d, 2-d, and 3-d networks with periodic boundary conditions, the 1000 highest entropy CA RNGs were selected from the set of 65,536 possible uniform (all CA truth tables the same) implementations. Each set of 1000 high-entropy CA was then submitted to Marsaglia's DIEHARD suite of random number tests. A number of 64-bit, neighbor-of-four CA-based RNGs have been discovered that pass all tests in DIEHARD without resorting to either site spacing or time spacing to improve the RNG quality.
ER -