Open Access
Subscription Access
Analysis of Elementary Cellular Automata Boundary Conditions
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
Font Size
Information
Abstract Views: 357
PDF Views: 147