Analysis of Elementary Cellular Automata Boundary Conditions | Zendy

K Salman | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Analysis of Elementary Cellular Automata Boundary Conditions

Author(s) -

K Salman

Publication year - 2013

Publication title -

international journal of computer science and information technology

Language(s) - English

Resource type - Journals

eISSN - 0975-4660

pISSN - 0975-3826

DOI - 10.5121/ijcsit.2013.5403

Subject(s) - computer science , cellular automaton , boundary (topology) , automaton , theoretical computer science , artificial intelligence , mathematics , mathematical analysis

We presentthe findings of analysis of elementary cellular automata(ECA)boundary conditions. Fixed andvariable boundaries are attempted.The outputs of linear feedback shift registers (LFSRs) act as continuousinputs to the two boundaries of a one-dimensional (1-D) Elementary Cellular Automata (ECA)areanalyzed and compared.The results show superior randomness features and the output string has passedthe Diehard statistical battery of tests. The design has strong correlation immunity and it is inherentlyamenable for VLSI implementation.Thereforeitcan be considered to be agoodand viablecandidate forparallelpseudo random number generation

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research