Issue No. 01 - January (1996 vol. 45)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.481481
<p><b>Abstract</b>—Considerable interest has been recently generated in the study of Cellular Automata (CA) behavior. Polynomial and matrix algebraic tools are employed to characterize some of the properties of null/periodic boundary CA. Some other results of group CA behavior have been reported based on simulation studies. This paper reports a formal proof for the conjecture—there exists no primitive characteristic polynomial of 90/150 CA with periodic boundary condition. For generation of high quality pseudorandom patterns, it is necessary to employ CA having primitive characteristic polynomial. There exist two null boundary CA for every primitive polynomial. However, for such Cs the quality of pseudorandomness suffers in general, particularly in the regions around the terminal cells because of null boundary condition. In this background, a new concept of intermediate boundary CA has been proposed to generate pseudorandom patterns that are better in quality than those generated with null boundary CA. Some interesting properties of intermediate boundary CA are also reported.</p>
Periodic boundary cellular automata, intermediate boundary cellular automata, matrix algebra, primitive polynomial, pseudorandom pattern.
P. Chaudhuri and S. Nandi, "Analysis of Periodic and Intermediate Boundary 90/150 Cellular Automata," in IEEE Transactions on Computers, vol. 45, no. , pp. 1-12, 1996.