Analysis of cellular automata used as pseudorandom pattern generators
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 762-768
- https://doi.org/10.1109/test.1990.114093
Abstract
The consequences of the similarity transformation between the transition matrix of a linear cellular automaton (CA) and that of a linear feedback shift register (LFSR) are explored. It is shown that the bit sequence from a stage of a CA is identical to that from the LFSR found by the similarity transformation. The concept of discrete algorithms of a binary polynomial is introduced and used with an operational calculus to calculate the phase shift between the bit sequences emitted by different stages of a linear CA. The simulation of hybrid 90/150 CA done during the course of this work leads to some conjectures about the realizability of cellular automata exhibiting maximum length sequences with null and cyclic boundary conditions.Keywords
This publication has 5 references indexed in Scilit:
- Boundary scan with cellular-based built-in self-testPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Parallel random number generation for VLSI systems using cellular automataIEEE Transactions on Computers, 1989
- Group Properties of Cellular Automata and VLSI ApplicationsIEEE Transactions on Computers, 1986
- Random sequence generation by cellular automataAdvances in Applied Mathematics, 1986
- Statistical mechanics of cellular automataReviews of Modern Physics, 1983