Analysis of cellular automata used as pseudorandom pattern generators

Author

Bardell, Paul H.

Author_Institution

IBM Corp., Poughkeepsie, NY, USA

fYear

1990

fDate

10-14 Sep 1990

Firstpage

762

Lastpage

768

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

finite automata; logic testing; polynomials; random number generation; shift registers; BIST; binary polynomial; bit sequence; cyclic boundary conditions; discrete algorithms; hybrid 90/150; linear cellular automaton; linear feedback shift register; logic testing; null boundary conditions; phase shift; pseudorandom pattern generators; similarity transformation; transition matrix; Automatic testing; Boundary conditions; Built-in self-test; Calculus; Content addressable storage; Linear feedback shift registers; Nearest neighbor searches; Pattern analysis; Polynomials; Random sequences;

fLanguage

English

Publisher

ieee

Conference_Titel

Test Conference, 1990. Proceedings., International

Conference_Location

Washington, DC

Print_ISBN

0-8186-9064-X

Type

conf

DOI

10.1109/TEST.1990.114093

Filename

114093