Skip to main content

On the Implementation of a Margolus Neighborhood Cellular Automata on FPGA

  • Conference paper
  • First Online:
Field Programmable Logic and Application (FPL 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2778))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Wolfram, S.: Cellular Automata. Los Alamos Science 9, 2–21 (1983)

    Google Scholar 

  2. Wolfram, S.: Statistical mechanics of cellular automata. Reviews of Modern Physics 55, 601–644 (1983)

    Article  MathSciNet  Google Scholar 

  3. Margolus, N.: Physics-Like models of computation. Physica 10D, 81–95 (1984)

    MathSciNet  MATH  Google Scholar 

  4. Toffoli, T.: Cellular Automata as an alternative to (rather than an approximation of) Differential Equations in Modeling Physics. Physica 10D, 117–127 (1984)

    MathSciNet  MATH  Google Scholar 

  5. Toffoli, T.: Occam, Turing, von Neumann, Jaynes: How much can you get for how little (A conceptual introduction to cellular automata). The Interjournal (October 1994)

    Google Scholar 

  6. Toffoli, T., Margolus, N.: Invertible cellular automata: a review. Physica D, Nonlinear Phenomena 45, 1–3 (1990)

    Article  MathSciNet  Google Scholar 

  7. Gruau, F.C., Tromp, J.T.: Cellular Gravity. Parallel Processing Letters 10(4), 383–393 (2000)

    Article  MathSciNet  Google Scholar 

  8. Smith, M.A.: Cellular Automata Methods in Mathematical Physics. Ph.D. Thesis. MIT Department of Physics (May 1994)

    Google Scholar 

  9. Wolfram, S.: Cryptography with Cellular Automata. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 429–432. Springer, Heidelberg (1986)

    Google Scholar 

  10. Sarkar, P.: A brief history of cellular automata. ACM Computing Surveys 32(1), 80–107 (2000)

    Article  Google Scholar 

  11. Shackleford, B., Tanaka, M., Carter, R.J., Snider, G.: FPGA Implementation of Neighborhood-of-Four Cellular Automata Random Number Generators. In: Proceedings of FPGA, pp. 106–112 (2002)

    Google Scholar 

  12. Vichniac, G.Y.: Simulating Physics with Cellular Automata. Physica 10D, 96–116 (1984)

    MathSciNet  MATH  Google Scholar 

  13. Popovici, A., Popovici, D.: Cellular Automata in Image Processing. In: Proceedings of MTNS 2002 (2002)

    Google Scholar 

  14. Wolfram, S.: A New Kind of Science. Wolfram media (2002)

    Google Scholar 

  15. Corno, F., Rebaudengo, M., Reorda, M.S., Squillero, G., Violante, M.: Low power BIST via hybrid cellular automata. In: 18th IEEE VLSI Test Symposium (2000)

    Google Scholar 

  16. Corno, F., Reorda, M.S., Squillero, G.: Exploiting the selfish gene algorithm for evolving hardware cellular automata. In: Proceedings of Congress of Evolutionary Computation (CEC 2000) (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cerdá, J., Gadea, R., Herrero, V., Sebastiá, A. (2003). On the Implementation of a Margolus Neighborhood Cellular Automata on FPGA. In: Y. K. Cheung, P., Constantinides, G.A. (eds) Field Programmable Logic and Application. FPL 2003. Lecture Notes in Computer Science, vol 2778. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45234-8_75

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45234-8_75

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40822-2

  • Online ISBN: 978-3-540-45234-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics