Abstract: A cellular automaton which generates pseudorandom data comprises a series of cells arranged such that each cell receives signals from electrically adjacent first and second cells. Each cell comprises a D-type flip-flop for storing a data bit, and logic circuitry which couples the flip-flop of the cell to those of associated first and second adjacent cells. The logic circuitry responds to the current state of the data bits stored by a particular cell and its associated first and second electrically adjacent cells by changing the value of the data bit stored by the particular cell according to a predetermined one of the following relationships:a(t+1)=a .sub.first (t) XOR a.sub.second (t), ora(t+1)=a .sub.first (t) XOR a(t) XOR a.sub.second (t)where, a(t) represents the current state of the data bit stored by the particular cell, a(t+1) represents the next state of the data bit stored by the particular cell, a.sub.

Abstract: A cellular automaton which generates pseudorandom data comprises a series of cells arranged such that each cell receives signals from electrically adjacent first and second cells. Each cell comprises a D-type flip-flop for storing a data bit, and logic circuitry which couples the flip-flop of the cell to those of associated first and second adjacent cells. The logic circuitry responds to the current state of the data bits stored by a particular cell and its associated first and second electrically adjacent cells by changing the value of the data bit stored by the particular cell according to the following relationship:a(t+1)=.sub.first (t) XOR[a(t) OR a.sub.second (t)]where, a(t) represents the current state of the data bit stored by the particular cell, a(t+1) represents the next state of the data bit stored by the particular cell, a.sub.first (t) represents the current state of the data bit stored by the first electrically adjacent cell, and a.sub.