A symbolic dynamics approach for the complexity analysis of chaotic pseudo-random sequences

Abstract

By considering a chaotic pseudo-random sequence as a symb olic sequence, we present a symbolic dynamics approach for the complexity analys is of chaotic pseudo-random sequences. The method is applied to the cases of Logistic map and one-way coupl ed map lattice to demonstrate how it works, and a comparison is made between it and the approximate entropy method. The results show that this method is app licable to distinguish the complexities of different chaotic pseudo-random seque nces, and it is superior to the approximate entropy method.