The search functionality is under construction.

The search functionality is under construction.

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.

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E85-A No.12 pp.2612-2623

- Publication Date
- 2002/12/01

- Publicized

- Online ISSN

- DOI

- Type of Manuscript
- Special Section PAPER (Special Section on VLSI Design and CAD Algorithms)

- Category
- VLSI Design

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.

Copy

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

Copy

@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},}

Copy

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 -