ANALYSIS OF PERIODIC AND INTERMEDIATE BOUNDARY 90 150 CELLULAR-AUTOMATA/

Considerable interest has been recently generated in the study of Cell ular Automata (CA) behavior. Polynomial and matrix algebraic tools are employed to characterize some of the properties of null/periodic boun dary CA. Some other results of group CA behavior have been reported ba sed on simulation studies. This paper reports a formal proof for the c onjecture-there exists no primitive characteristic polynomial of 90/15 0 CA with periodic boundary condition. For generation of high quality pseudorandom patterns, it is necessary to employ CA having primitive c haracteristic polynomial. There exist two null boundary CA for every p rimitive polynomial. However, for such Cs the quality of pseudorandomn ess suffers in general, particularly in the regions around the termina l cells because of null boundary condition. In this background, a new concept of intermediate boundary CA has been proposed to generate pseu dorandom patterns that are better in quality than those generated with null boundary CA. Some interesting properties of intermediate boundar y CA are also reported.