Comparison between 2D cellular automata based pseudorandom number generators

Abstract

Pseudorandom number generators (PRNGs) should satisfy two main criteria, high randomness quality and fast computation of a sequence of numbers. In this paper, a comparative study of twodimensional Cellular Automata (CA) based PRNGs is performed to evaluate the randomness quality and the hardware constraints involved in terms of configuration parameters such as, transition rules, neighborhoods and bit extraction schemes. Experimental results show that CA-based PRNGs present good randomness quality using standard test suites, and they are well suited for parallel implementations in Field Programmable Gate Array (FPGA) technology taking advantage of the on-chip fine-grain and distributed computational resources. Keywords: Cellular automata, pseudorandom numbers, FPGA Classification: Electron devices, circuits, and systems References[1] M. Tomassini, M. Sipper, and M. Perrenoud, "On the generation of highquality random numbers by two-dimensional cellular automata," IEEE Trans.

A Fabric Component Based Approach to the Architecture and Design Automation of High-Performance Integer Arithmetic Circuits on FPGA

“…A methodology for VLSI implementation of CA algorithms, where an automatic translation scheme from CA algorithms to the corresponding VHDL was proposed in [23]. FPGA-based CA implementation was also reported in [24]. However, to the best of our knowledge, there has been no reported work regarding the principles and design philosophy for efficient low-level implementation of CA on modern families of actual FPGAs, aiming to map the CA structures optimally to the native architecture of the FPGA.…”