Abstract
Cellular Automata(CA) has been used as modeling and computing paradigm for a long time. And CA has been used to model many physical systems. While studying the models of such systems, it is seen that as the complexity of the physical system increase, the CA based model becomes very complex and difficult to track analytically. Also such models fail to recognize the presence of inherent hierarchical nature of a physical system. In this paper we give the characterization of linear group GF(2p) CA. Especially we analyze the relationship between characteristic polynomial and transition rule of linear group GF(2p) CA.
This work was supported by the Korea Research Foundation Grant funded by the Korean Government(MOEHRD)(KRF-2006-331-D00458).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Von Neumann, J.: The Theory of Self-Reproducing Automata. In: Burks, A.W. (ed.), University of Illinois Press, Urbana (1966)
Wolfram, S.: Statistical Mechanics of Cellular Automata. Rev. Mod. Phys. 55, 601–644 (1983)
Das, A.K.: Additive Cellular Automata: Theory and Applications as a Built-In Self-Test Structure, Ph.D Thesis, I.I.T. Kharagpur, India (1990)
Das, A.K., Chaudhuri, P.P.: Vector space theoretic analysis of additive cellular automata and its application for pseudo-exhaustive test pattern generation. IEEE Trans. Comput. 42, 340–352 (1993)
Das, A.K., Chaudhuri, P.P.: Efficient characterization of cellular automata. Proc. IEE(Part E) 137(1), 81–87 (1990)
Cho, S.J., Choi, U.S., Hwang, Y. H., Kim, H.D., Kim, J.G., Heo, S.H.: New synthesis of one-dimensional 90/150 linear hybrid group cellular automata. IEEE Trans. Comput.-Aided Design Integr. Circuits Syst. 26(9), 1720–1724 (2007)
Cho, S.J., Choi, U.S., Hwang, Y.H., Pyo, Y.S., Kim, H.D., Heo, S.H.: Computing Phase Shifts of Maximum-Length 90/150 Cellular Automata Sequences. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds.) ACRI 2004. LNCS, vol. 3305, pp. 31–39. Springer, Heidelberg (2004)
Cho, S.J., Choi, U.S., Kim, H.D.: Analysis of complemented CA derived from a linear TPMACA. Computers Math. Applic. 45, 689–698 (2003)
Cho, S.J., Choi, U.S., Kim, H.D.: Behavior of complemented CA whose complement vector is acyclic in a linear TPMACA. Mathl. Comput. Modelling 36, 979–986 (2002)
Nandi, S., Kar, B.K., Chaudhuri, P.P.: Theory and applications of cellular automata in cryptography. IEEE Trans. Computers 43, 1346–1357 (1994)
Paul, K.: Theory and application of GF(2p) Cellular automata, Ph.D Thesis, Departmen of Computer Science and Technology, Bengal Engineering College (A Deemed University) (2002)
Sikdar, B.K., Majumder, P., Mukherjee, M., Ganguly, N., Das, D.K., Chaudhuri, P.P.: Hierarchical Cellular automata as an on-chip test pattern generator. In: VLSI Design, Fourteenth International Conference on 2001, pp. 403–408 (2001)
Cho, S.J., Choi, U.S., Hwang, Y.H., Kim, H.D., Choi, H.H.: Behaviors of single attractor cellular automata over Galois field GF(2p). In: El Yacoubi, S., Chopard, B., Bandini, S. (eds.) ACRI 2006. LNCS, vol. 4173, pp. 232–237. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Choi, US., Cho, SJ., Hwang, YH., Kim, HD. (2008). Analysis of Linear Group GF(2p) Cellular Automata. In: Umeo, H., Morishita, S., Nishinari, K., Komatsuzaki, T., Bandini, S. (eds) Cellular Automata. ACRI 2008. Lecture Notes in Computer Science, vol 5191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79992-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-79992-4_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79991-7
Online ISBN: 978-3-540-79992-4
eBook Packages: Computer ScienceComputer Science (R0)