Abstract
Margolus neighborhood is the easiest form of designing Cellular Automata Rules with features such as invertibility or particle conserving. In this paper we introduce a notation to describe completely a rule based on this neighborhood and implement it in two ways: The first corresponds to a classical RAM-based implementation, while the second, based on concurrent cells, is useful for smaller systems in which time is a critical parameter. This implementation has the feature that the evolution of all the cells in the design is performed in the same clock cycle.
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
Wolfram, S.: Cellular Automata. Los Alamos Science, 9 (1983) 2–21
Wolfram, S.: Statistical mechanics of cellular automata. Reviews of Modern Physics, 55 (1983) 601–644
Margolus, N.: Physics-Like models of computation. Physica 10D (1984) 81–95
Toffoli, T.: Cellular Automata as an alternative to (rather tah an approximation of) Differential Equations in Modeling Physics. Physica 10D (1984) 117–127
Toffoli, T.: Occam, Turing, von Neumann, Jaynes: How much can you get for how little? (A conceptual introduction to cellular automata). The Inter journal (October 1994)
Toffoli, T., Margolus, N.: Invertible cellular automata: a review. Physica D, Nonlinear Phenomena, 45 (1990) 1–3
Gruau, F. C, Tromp, J. T.: Cellular Gravity. Parallel Processing Letters, Vol. 10, No. 4 (2000) 383–393
Smith, M. A.: Cellular Automata Methods in Mathematical Physics. Ph.D. Thesis. MIT Department of Physics (May 1994).
Wolfram, S.: Cryptography with Cellular Automata. Advances in Cryptology: Crypto’ 85 Proceedings, Lecture Notes in Computer Science, 218 (Springer-Verlag, 1986) 429–432
Sarkar, P.: A brief history of cellular automata. ACM Computing Surveys, Vol. 32, Issue 1 (2000) 80–107
Shackleford, B., Tanaka, M., Carter, R.J., Snider, G.: FPGA Implementation of Neighborhood-of-Four Cellular Automata Random Number Generators. Proceedings of FPGA 2002 (2002) 106–112
Vichniac, G. Y.: Simulating Physics with Cellular Automata. Physica 10D (1984) 96–116
Popovici, A., Popovici, D.: Celluar Automata in Image Processing. Proceedings of MTNS 2002 (2002)
Wolfram, S.: A New Kind of Science. Wolfram media (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cerda, J., Gadea, R., Paya, G. (2003). Implementing a Margolus Neighborhood Cellular Automata on a FPGA. In: Mira, J., Álvarez, J.R. (eds) Artificial Neural Nets Problem Solving Methods. IWANN 2003. Lecture Notes in Computer Science, vol 2687. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44869-1_16
Download citation
DOI: https://doi.org/10.1007/3-540-44869-1_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40211-4
Online ISBN: 978-3-540-44869-3
eBook Packages: Springer Book Archive