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

Authors:
Joaquín Cerdá;Rafael Gadea;Jorge Daniel Martínez;Angel Sebastiá
Affiliations:
Group of Digital Systems Design, Dept. Of Electronic Engineering, Polithecnic University of Valencia, Valencia, Spain;Group of Digital Systems Design, Dept. Of Electronic Engineering, Polithecnic University of Valencia, Valencia, Spain;Group of Digital Systems Design, Dept. Of Electronic Engineering, Polithecnic University of Valencia, Valencia, Spain;Group of Digital Systems Design, Dept. Of Electronic Engineering, Polithecnic University of Valencia, Valencia, Spain
Venue:
IWINAC'05 Proceedings of the First international conference on Mechanisms, Symbols, and Models Underlying Cognition: interplay between natural and artificial computation - Volume Part I
Year:
2005

Citing 7
Cited 0

Cryptography with cellular automata

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

Physica D
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
Universal cellular automata based on the collisions of soft spheres

Collision-based computing
Implementing a Margolus Neighborhood Cellular Automata on a FPGA

IWANN '03 Proceedings of the 7th International Work-Conference on Artificial and Natural Neural Networks: Part II: Artificial Neural Nets Problem Solving Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

The easiest form of designing Cellular Automata rules with features such as invertibility or particle conserving is to rely on a partitioning scheme, the most important of which is the 2D Margolus neighborhood. In this paper we introduce a 1D Margolus-like neighborhood that gives support to a complete set of Cellular Automata models. We present a set of models called Sliding Ball Models based on this neighborhood and capable of universal computation. We show the way of designing logic gates with these models, propose a digital structure to implement them and finally we present SBMTool, a software development system capable of working with the new models.