Nonlinear Sciences – Chaotic Dynamics
Scientific paper
2011-01-23
Nonlinear Sciences
Chaotic Dynamics
4 pages (revtex4 format), 3 figures, 2 tables. This paper is being presented at the Sixth National Conference on Nonlinear Sys
Scientific paper
We investigate the complexity of short symbolic sequences of chaotic dynamical systems by using lossless compression algorithms. In particular, we study Non-Sequential Recursive Pair Substitution (NSRPS), a lossless compression algorithm first proposed by W. Ebeling et al. [Math. Biosc. 52, 1980] and Jim\'{e}nez-Monta\~{n}o et al. [arXiv:cond-mat/0204134, 2002]) which was subsequently shown to be optimal. NSPRS has also been used to estimate Entropy of written English (P. Grassberger [arXiv:physics/0207023, 2002]). We propose a new measure of complexity - defined as the number of iterations of NSRPS required to transform the input sequence into a constant sequence. We test this measure on symbolic sequences of the Logistic map for various values of the bifurcation parameter. The proposed measure of complexity is easy to compute and is observed to be highly correlated with the Lyapunov exponent of the original non-linear time series, even for very short symbolic sequences (as short as 50 samples). Finally, we construct symbolic sequences from the Skew-Tent map which are incompressible by popular compression algorithms like WinZip, WinRAR and 7-Zip, but compressible by NSRPS.
Arjun Venugopal T.
Kavalekalam Mathew Shaji
Krishnan Nithin
Nagaraj Nithin
No associations
LandOfFree
Lossless Compression and Complexity of Chaotic Sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Lossless Compression and Complexity of Chaotic Sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lossless Compression and Complexity of Chaotic Sequences will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-586655