Implementing a Margolus Neighborhood Cellular Automata on a FPGA

Authors:
Joaquín Cerda;Rafael Gadea;Guillermo Paya
Affiliations:
Group of Digital Systems Design, Dept. of Electronic Engineering, Polithecnic University of Valencia, Valencia, Spain 46022;Group of Digital Systems Design, Dept. of Electronic Engineering, Polithecnic University of Valencia, Valencia, Spain 46022;Group of Digital Systems Design, Dept. of Electronic Engineering, Polithecnic University of Valencia, Valencia, Spain 46022
Venue:
IWANN '03 Proceedings of the 7th International Work-Conference on Artificial and Natural Neural Networks: Part II: Artificial Neural Nets Problem Solving Methods
Year:
2009

Citing 6
Cited 1

Cryptography with cellular automata

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Ininvertible cellular automata: a review

Physica D
Cellular automata methods in mathematical physics

Cellular automata methods in mathematical physics
A brief history of cellular automata

ACM Computing Surveys (CSUR)
FPGA implementation of neighborhood-of-four cellular automata random number generators

FPGA '02 Proceedings of the 2002 ACM/SIGDA tenth international symposium on Field-programmable gate arrays
A new kind of science

A new kind of science

A tool for implementing and exploring SBM models: universal 1D invertible cellular automata

IWINAC'05 Proceedings of the First international conference on Mechanisms, Symbols, and Models Underlying Cognition: interplay between natural and artificial computation - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

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.