Locking-time and Information Capacity in CML with Statistical Periodicity

In this work we address the statistical periodicity phenomenon on a coupled map lattice. The study was done based on the asymptotic binary patterns. The pattern multiplicity gives us the lattice information capacity, while the entropy rate allows us to calculate the locking-time. Our results suggest...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2010-11
Main Authors: Szmoski, Romeu Miqueias, Rodrigo Frehse Pereira, Fabiano Alan Serafim Ferrari, Sandro Ely de Souza Pinto
Format: Article
Language:English
Subjects:
Entropy (Information theory)
Locking
Neural networks
Periodic variations
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this work we address the statistical periodicity phenomenon on a coupled map lattice. The study was done based on the asymptotic binary patterns. The pattern multiplicity gives us the lattice information capacity, while the entropy rate allows us to calculate the locking-time. Our results suggest that the lattice has low locking-time and high capacity information when the coupling is weak. This is the condition for the system to reproduce a kind of behavior observed in neural networks.
ISSN:2331-8422