Abstract
An application of cellular automata (CA) has been proposed for building parallel processing systems, cryptographic hashing functions, and VLSI technology. Recently, Das et al. have reported characterization of reachable/non-reachable CA states. Their algorithm has only offered the characterization under a null boundary CA (NBCA). However, in the simplifications of hardware implementation, a periodic boundary CA (PBCA) is suitable for constructing cost-effective algorithms such as a linear feedback shift register (LFSR) structure because of its circular property. Therefore Kang et al. have provided an algorithm for deciding of group/non-group CA based on periodic boundary condition. However, they did not have provided an algorithm for constructing of group CA rules. Thus, this paper presents an efficient evolutionary algorithm for constructing of group CA rules based on periodic boundary condition. We expect that the proposed algorithm will be efficiently used in variety of applications including cryptography and VLSI technology.
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
References
J. V. Neumann, The Theory of Self Reproducing Automata, University of Illinois Press, Urbana and London, 1996.
S. Wolfram, “Statistical Mechanics of Cellular Automata”, Reviews of Modern Physics, APS physics, 1983, Vol. 55, pp. 601-644.
O. Martin, A. M. Odlyzko, and S. Wolfram, “Algebraic properties of cellular automata”, Communications in Mathematical Physics, Springer-Verlag, New York, 1984, Vol. 93, pp. 219-258.
W. Pries, A. Thanailakis, and H. C. Card, “Group properties of cellular automata and VLSI application”, IEEE Transactions on Computers, IEEE, 1986, Vol. 35, No. 12, pp. 1013-1024.
A. J. Atrubin, “A One–Dimensional Real-Time Iterative Multiplier”, IEEE Transactions on Computers, IEEE, 1965, Vol. EC-14, No. 13, pp. 394-399.
P. C. Fischer, Generation of Primes by a One-Dimensional Real-Time Iterative Array”, Journal of ACM, ACM Press, New York, 1965, Vol. 12, No. 3, pp. 388-394.
F. B. Manning, An Approach to Highly Integrated, Computer-Maintained Cellular Arrays”, IEEE Transactions on Computers, IEEE, 1977, Vol. C-26, No. 6, pp. 536-552.
A. Rosenfeld, Picture Language, Academic Press, New York, 1979.
S. Das, B. K. Sikdar and P. P. Chaudhuri, “Characterization of Reachable/Nonreachable Cellular Automata States”, Lecture Notes in Computer Science, Springer-Verlag, New York, 2004, LNCS 3305, pp. 813-822.
B. H. Kang, J. C. Jeon and K. Y. Yoo, “Decision Algorithms for Cellular Automata States Based on Periodic Boundary Condition”, Lecture Notes in Computer Science, Springer-Verlag, New York, 2006, LNCS 4173, pp. 104-111.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media B.V.
About this paper
Cite this paper
Kang, BH., Lee, DH., Hong, CP. (2008). Construction of Group Rules for VLSI Application. In: Sobh, T. (eds) Advances in Computer and Information Sciences and Engineering. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-8741-7_43
Download citation
DOI: https://doi.org/10.1007/978-1-4020-8741-7_43
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-8740-0
Online ISBN: 978-1-4020-8741-7
eBook Packages: Computer ScienceComputer Science (R0)