Peculiarities of hardware implementation of generalized cellular tetra automaton

Authors

DOI:

https://doi.org/10.15587/2312-8372.2015.37693

Keywords:

postbinary cellular automaton, tetra automaton, advanced code-logical basis, data storage device, cell, tetracode

Abstract

Cellular automata are widely used in many fields of knowledge for the study of variety of complex real processes: computer engineering and computer science, cryptography, mathematics, physics, chemistry, ecology, biology, medicine, epidemiology, geology, architecture, sociology, theory of neural networks. Thus, cellular automata (CA) and tetra automata are gaining relevance taking into account the hardware and software solutions.

Also it is marked a trend towards an increase in the number of possible states of CA that led to the emergence of new types of CA, which are united in this paper under a common name – postbinary cellular automata.

This article proposes a variant of generalized structure of CA cell using asynchronous data storage device, software configurable via the user interface. Several ways of hardware implementation of initial values record in register of the cell status and read the results from the current layer of states in the register of reading the results: serial, block, using a layer of initial states through direct serial or block addressing, or cascade addressing on the basis of tetracodes. It is considered the CTA structure when used as a coprocessor in the local computers. At the same time the detailed descriptions are given, problems are identified, corresponding schematic structure are given. It is considered in detail the generalized block diagram of a multi-layer cellular automaton and it is proposed a generalized block diagram of a multi-layer CA cell that improves performance and extended functionality compared with the known CA.

The main advantage of the proposed implementation of cellular automata is functional diversity of elements and flexibility, the ability to change the laws of transitions immediately in all cells (matrix elements). Therefore, CA mass production (as well as CTA) on this technology can get a testing ground for numerous experiments in various fields of science.

Author Biographies

Александр Яковлевич Аноприенко, Donetsk National Technical University, st. Artem, 58, Donetsk, Ukraine, 83000

Ph.D., Professor

Department of Computer Engineering

Евгений Евгениевич Федоров, Donetsk National Technical University, Sq. Shibankova, 2, Krasnoarmeysk

Ph.D., Professor

Department of Computer Sciences

Сергей Васильевич Иваница, Donetsk National Technical University, st. Artem, 58, Donetsk, Ukraine, 83000

Аssistant

Department of Computer Engineering

Хамза Альрабаба, Donetsk National Technical University, st. Artem, 58, Donetsk, Ukraine, 83000

Graduate

Department of Computer Engineering

References

  1. Konopleva, A. P., Anoprienko, A. Ja. (2007). Igra «Zhizn’» Dzh. Konveja na baze giperkodov. Materialy III mezhdunarodnoj nauchno-tehnicheskoj konferencii «Informatika i komp'juternye tehnologii — 2007», 11–13 December 2007. Donetsk: DonNTU, 254–257.
  2. Anoprienko, A. Ja., Konopleva, A. P. (2008). Razvitie idei primenenija giperkodov v modelirovanii kletochnyh avtomatov. Naukovі pracі Donec’kogo nacіonal’nogo tehnіchnogo unіversitetu, serіja «Іnformatika, kіbernetika ta obchisljuval’na tehnіka», 9 (132), 115–118.
  3. Anoprienko, A. Ja., Konopleva, A. P. (2011). Upravljaemyj postbinarnyj kletochnyj avtomat. Materialy II vseukrainskoj nauchno-tehnicheskoj konferencii «Informacionnye upravljajushhie sistemy i komp'juternyj monitoring (IUS i KM 2011)», 12–13 aprelja 2011 g., T. 2. Donetsk: DonNTU, 215-219.
  4. Anoprienko, A. Ja., Ivanica, S. V. (2011). Postbinarnyj komp’juting i interval’nye vychislenija v kontekste kodo-logicheskoj jevoljucii. Donetsk: DonNTU, UNITEH, 248 s.
  5. Anoprienko, A. Ja., Ivanica, S. V. (2011). Osobennosti realizacii postbinarnyh logiches-kih operacij. Nauchno-teoreticheskij zhurnal «Iskusstvennyj intellekt», № 2, 110–121.
  6. Anoprienko, A. Ja., Ivanica, S. V. (2012). Tetralogika, tetravychislenija i nookomp’juting. Donetsk: DonNTU, UNITEH, 308.
  7. Piwonska, A., Seredynski, F., Szaban, M. (2012). Searching Cellular Automata Rules for Solving Two-Dimensional Binary Classification Problem. Lecture Notes in Computer Science, Vol. 7495, 121–130. doi:10.1007/978-3-642-33350-7_13
  8. Martínez, G. J., Adamatzky, A., McIntosh, H. V. (2010). Localization Dynamics in a Binary Two-Dimensional Cellular Automaton: The Diffusion Rule. Game of Life Cellular Automata, 291–315. doi:10.1007/978-1-84996-217-9_16
  9. Schiff, J. L. (2008). Cellular automata: a discrete view of the world. A John Wiley&Sons inc, Publication. University of Auckland, 279.
  10. Cenek, M., Mitchell, M. (2009). Evolving Cellular Automata. Encyclopedia of Complexity and Systems Science, 3233–3242. doi:10.1007/978-0-387-30440-3_191
  11. Sutner, K. (1999). Linear Cellular Automata and de Bruijn Automata. Cellular Automata, Vol. 460, 303–319. doi:10.1007/978-94-015-9153-9_12
  12. Pivato, M. (2009). Ergodic Theory of Cellular Automata. Encyclopedia of Complexity and Systems Science, 2980–3015. doi:10.1007/978-0-387-30440-3_178
  13. Breukelaar, R., Bäck, T. (2005). Using a genetic algorithm to evolve behavior in multi dimensional cellular automata. Proceedings of the 2005 conference on Genetic and evolutionary computation - GECCO ’05. ACM Press, 107-114. doi:10.1145/1068009.1068024
  14. Schiff, J. L. (2007). Cellular Automata. John Wiley & Sons, Inc., 254. doi:10.1002/9781118032381
  15. Boccara, N. (2009). Phase Transitions in Cellular Automata. Encyclopedia of Complexity and Systems Science, 6771–6782. doi:10.1007/978-0-387-30440-3_405
  16. Tempesti, G., Mange, D., Stauffer, A. (2009). Self-Replication and Cellular Automata. Encyclopedia of Complexity and Systems Science, 1–24. doi:10.1007/978-3-642-27737-5_477-7
  17. Weisstein, E. W. Elementary Cellular Automaton. MathWorld – A Wolfram Web Resource. Available: http://mathworld.wolfram.com/ElementaryCellularAutomaton.html
  18. Cook, M. (2004). Universality in Elementary Cellular Automata. Complex Systems, 15, 1–40. Available: http://www.complex-systems.com/pdf/15-1-1.pdf
  19. Stepancov, M. E. (2002). Kletochnye avtomaty kak modeli nelinejnyh javlenij. Trudy devjatyh matematicheskih chtenij "Matematicheskie metody i prilozhenija". Moskva: MGSU, 141–142.

Downloads

Published

2015-01-28

How to Cite

Аноприенко, А. Я., Федоров, Е. Е., Иваница, С. В., & Альрабаба, Х. (2015). Peculiarities of hardware implementation of generalized cellular tetra automaton. Technology Audit and Production Reserves, 1(3(21), 68–74. https://doi.org/10.15587/2312-8372.2015.37693

Issue

Vol. 1 No. 3(21) (2015): Mathematical modeling. Systems and control processes. Information and control systems

Section

Information and control systems

License

Copyright (c) 2016 Александр Яковлевич Аноприенко, Евгений Евгениевич Федоров, Сергей Васильевич Иваница, Хамза Альрабаба

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.