On the Implementation of a Margolus Neighborhood Cellular Automata on FPGA

Abstract

Abstract. 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.

Visual Spike Processing based on Cellular Automaton

“…Glider is a graphic interface that allows: (a) describing a cellular automaton composed of cells and a cellular network, (b) translating the graphical definition into a Cellular Specification Description Language (CSDL) and (c) translating CSDL into VHDL for hardware implementation of the Cellular Automaton (Cerdá et al, 2003 ;Cerdá, 2004). Glider has been implemented in Java 1.5, which makes it compatible with any platform and operating system.…”