Abstract
In cellular automata, a single update rule is applied simultaneously to each cell on the lattice. Therefore, many approaches with parallel and distributed systems have been researched. In this paper, we propose a computation method of three dimensional cellular automata for small FPGA systems with limited memory bandwidth. We implemented the method on a FPGA board (Celoxica RC1000 with one Virtex-E XCV2000E). The speed gain for a 3D Life Game and a 3D Forest Fires model with 128 × 128 × 128 lattice is 386 and 79 times compared with Celeron Processor 1.20GHz.
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
Tomoyoshi Kobori, Tsutomu Maruyama and Tsutomu Hoshino.“A Cellular Automata System with FPGA” Proc. FCCM’ 01, IEEE Computer Soc 2001.
C. Adler, B. M. Boghosian, E. G. Flekkoy, N. Margolus and D.H. Rothman, “SimulationThree-Dimensional Hydrodynamics on a Cellular-Automata Machine”, Journal of Statistical Physics, 1995
Norman Margolus.“An FPGA architecture for DRAM-based systolic computations” Proc. FCCM’ 97, pp. 2–11, IEEE Computer Soc 1997.
U. Frisch, D. d’Humires, B. Hasslacher, P. Lallemand, and Y. Pomeau.“Lattice gas hydrodynamics in two and three dimensions” Complex Systems, 1 PP.649–707 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kobori, T., Maruyama, T. (2002). High Speed Computation of Three Dimensional Cellular Automata with FPGA. In: Glesner, M., Zipf, P., Renovell, M. (eds) Field-Programmable Logic and Applications: Reconfigurable Computing Is Going Mainstream. FPL 2002. Lecture Notes in Computer Science, vol 2438. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46117-5_123
Download citation
DOI: https://doi.org/10.1007/3-540-46117-5_123
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44108-3
Online ISBN: 978-3-540-46117-3
eBook Packages: Springer Book Archive