Abstract
Many researchers have been studied synthesis method of 90/150 group CA. However, there is a lack of researches for synthesis method of 90/150 nongroup CA. In this paper we propose an algorithm for finding 90/150 Two Predecessor Cellular Automata. Using the proposed algorithm we analyze 90/150 two predecessor CA. Especially, we analyze 90/150 TPSACA and TPMACA which are useful to study hashing. Also we analyze two types of 90/150 two predecessor CA. One is two predecessor CA for the minimal polynomial whose type is of the form x p(x) which is useful to study two predecessor CA whose depth is 1. Another is two predecessor CA for the minimal polynomial whose type is of the form x(x + 1) p(x) which is useful to study pseudorandom number generation based on 90/150 two predecessor CA, where p(x) is some primitive polynomial.
This work was supported by grant No. (R01-2006-000-10260-0) from the Basic Research Program of the Korea Science and Engineering Foundation.
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.
Similar content being viewed by others
References
Von Neumann, J.: The theory of self-reproducing automata. In: Burks, A.W. (ed.). University of Illinois Press, Urban (1966)
Wolfram, S.: Statistical mechanics of cellular automata. Rev. Mod. Phys. 55, 601–644 (1983)
Chakraborty, S., Chowdhury, D.R., Chaudhuri, P.P.: Theory and application of nongroup cellular automata for synthesis of easily testable finite state machines. IEEE Trans. Computers 45(7), 769–781 (1996)
Chattopadhyay, S., Chaudhuri, P.P.: Theory and application of nongroup cellular automata in pattern classification, IEEE Trans. Computers, communicated
De la Guia Martinez, D., Peinado Dominguez, A.: Pseudorandom number generation based on nongroup cellular automata. In: Security Technology, 1999, Proceedings, IEEE 33rd Annual 1999 International Carnahan Conference, vol. 45, pp. 370–376 (1999)
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)
Serra, M., Slater, T., Muzio, J.C., Miller, D.M.: The analysis of one dimensional linear cellular automata and their aliasing properties. IEEE Trans Computer-Aided Design 9, 767–778 (1990)
Hortensius, P.D., McLeod, R.D., Card, H.C.: Parallel random number generation for VLSI systems using cellular automata. IEEE Trans. Computers 38, 1466–1473 (1989)
Hortensius, P.D., McLeod, R.D., Miller, D.M., Card, H.C.: Cellular automata based pseudorandom number generations for built-in self test. IEEE Trans. on CAD of Integrated Circuits ans Systems 8, 842–859 (1989)
Tsalides, P., York, T.A., Thanailakis, A.: Pseudorandom number generators for systems based on linear cellular automata. IEE Proc(Part E) Computers Digital Techniques 138, 241–249 (1991)
Pries, W., Thanailakis, A., Card, H.C.: Group properties of cellular automata and VLSI applications. IEEE Trans. Computers 35, 1013–1024 (1986)
Nandi, S., Kar, B.K., Chaudhuri, P.P.: Theory and application of cellular automata in cryptography. IEEE Trans. Computers 43, 1346–1357 (1994)
Cattell, K., Muzio, J.C.: Synthesis of one-dimensional linear hybrid cellular automata. IEEE Trans. on Computer Aided Design of Circuits and Systems 15-3, 325–335 (1996)
Cho, S.J., Choi, U.S., Hwang, Y.H., Pyo, Y.S., Kim, H.D., Kim, K.S., 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., Hwang, Y.H., Kim, J.G., Heo, S.H.: New synthesis of one-dimensional 90/150 linear hybrid group cellular automata. IEEE Trans. Comput-Aided Des. Integr. Circuits Syst. 26(9), 1720–1724 (2007)
Chaudhuri, P.P., Chowdhury, D.R., Nandy, S., Chattopadhyay, C.: Additive cellular automata theory and applications, vol. 1. IEEE Computer Society Press, California (1997)
Cho, S.J., Choi, U.S., Hwang, Y.H., Kim, H.D.: Analysis of hybrid group cellular automata. In: El Yacoubi, S., Chopard, B., Bandini, S. (eds.) ACRI 2006. LNCS, vol. 4173, pp. 222–231. Springer, Heidelberg (2006)
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. Math. Comput. Modelling 36, 979–986 (2002)
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)
Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1985)
Chattopadhyay, S.: Some studies on theory and application of additive cellular automata, PhD thesis, I.I.T., Kharagpur, India (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cho, SJ., Choi, US., Kim, HD., Hwang, YH., Kim, JG. (2008). Analysis of 90/150 Two Predecessor Nongroup 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_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-79992-4_17
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)