Margolus neighborhood is the easiest form of designing Cellular Automata Rules with features such as invertibility or particle conserving. In this paper we propose two different implementations of systems based on this neighborhood: The first one 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. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Cerdá, J., Gadea, R., Herrero, V., & Sebastià, A. (2003). On the implementation of a Margolus neighborhood Cellular Automata on FPGA. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2778, 776–785. https://doi.org/10.1007/978-3-540-45234-8_75
Mendeley helps you to discover research relevant for your work.