Unitary Cellular Automata and Convolution Algebras

The original local, discrete example of Linear Unitary Cellular Automata (LUCA) is analyzed in terms of a new representation previously introduced in [1] for classical CA. Several important underlying symmetries are reviewed and their tight relationship with both signal and coding theory as well as...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2016-08
Main Author: Raptis, T E
Format: Article
Language:English
Subjects:
Cellular automata
Combinatorial analysis
Convolution
Emulators
Transmission lines
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The original local, discrete example of Linear Unitary Cellular Automata (LUCA) is analyzed in terms of a new representation previously introduced in [1] for classical CA. Several important underlying symmetries are reviewed and their tight relationship with both signal and coding theory as well as with combinatorics is underlined. A class of analog implementations in the form of Linear Transmission Line Networks (LTLN) is described as possible emulators of this type of dynamics.
ISSN:2331-8422