Open Access Open Access  Restricted Access Subscription Access

Analysis of Elementary Cellular Automata Boundary Conditions


Affiliations
1 Middle Tennessee State University, Murfreesboro, TN 37132, United States
 

We present the findings of analysis of elementary cellular automata (ECA) boundary conditions. Fixed and variable boundaries are attempted. The outputs of linear feedback shift registers (LFSRs) act as continuous inputs to the two boundaries of a one-dimensional (1-D) Elementary Cellular Automata (ECA) are analyzed and compared. The results show superior randomness features and the output string has passed the Diehard statistical battery of tests. The design has strong correlation immunity and it is inherently amenable for VLSI implementation. Therefore it can be considered to be a good and viable candidate for parallel pseudo random number generation.

Keywords

Linear Feedback Shift Registers, Cellular Automata, Boundary Conditions, Diehard.
User
Notifications
Font Size

Abstract Views: 357

PDF Views: 147




  • Analysis of Elementary Cellular Automata Boundary Conditions

Abstract Views: 357  |  PDF Views: 147

Authors

K. Salman
Middle Tennessee State University, Murfreesboro, TN 37132, United States

Abstract


We present the findings of analysis of elementary cellular automata (ECA) boundary conditions. Fixed and variable boundaries are attempted. The outputs of linear feedback shift registers (LFSRs) act as continuous inputs to the two boundaries of a one-dimensional (1-D) Elementary Cellular Automata (ECA) are analyzed and compared. The results show superior randomness features and the output string has passed the Diehard statistical battery of tests. The design has strong correlation immunity and it is inherently amenable for VLSI implementation. Therefore it can be considered to be a good and viable candidate for parallel pseudo random number generation.

Keywords


Linear Feedback Shift Registers, Cellular Automata, Boundary Conditions, Diehard.