Tensor function analysis of quantized chaotic piecewise-affine pseudo-Markov systems. II. Higher order correlations and self-similarity

For pt. I see ibid., vol. 49, pp. 137-49 (2002).The general approach developed in the companion paper for the statistical analysis of trajectories produced by a class of chaotic systems generalizing the classical view of piecewise-affine Markov maps is here applied to the computation of higher order correlations. For any given order m, a procedure is given to write a closed form expression in the z-transformed domain for the mth dimensional tensor encoding the contribution of the system dynamics to the correlation functions of that order. After having defined and discussed a suitable generalization of the concept of second-order self-similarity, we finally use this general procedure to show that simple chaotic maps may exhibit highly nontrivial behaviors also in their higher order statistics.

[1]  Stefano Isola,et al.  Renewal Sequences and Intermittency , 1999 .

[2]  Stefano Isola.  RETURN TIMES AND MIXING PROPERTIES , 2000 .

[3]  Tohru Kohda.  Information sources using chaotic dynamics , 2001 .

[4]  Parag Pruthi,et al.  An application of deterministic chaotic maps to model packet traffic , 1995, Queueing Syst. Theory Appl..

[5]  Riccardo Rovatti,et al.  Enhanced rake receivers for chaos-based DS-CDMA , 2001 .

[6]  K. Kelber,et al.  Discrete-time chaotic encryption systems. III. Cryptographical analysis , 1998 .

[7]  Martin Hasler,et al.  Noise Filtering in chaos-based communication , 2000 .

[8]  L. Baum,et al.  Statistical Inference for Probabilistic Functions of Finite State Markov Chains , 1966 .

[9]  Gianluca Mazzini,et al.  A tensor approach to higher order expectations of chaotic trajectories. II. Application to chaos-based DS-CDMA in multipath environments , 2000 .

[10]  Tohru Kohda,et al.  Design of sequences of i.i.d. p-ary random variables , 1997, Proceedings of IEEE International Symposium on Information Theory.

[11]  Andrew M. Odlyzko,et al.  Analytic methods in asymptotic enumeration , 1996, Discret. Math..

[12]  T. Kohda,et al.  Statistics of chaotic binary sequences , 1997, IEEE Trans. Inf. Theory.

[13]  Makoto Mori.  ON THE INTERMITTENCY OF A PIECEWISE LINEAR MAP , 1993 .

[14]  Riccardo Rovatti,et al.  Chaotic Electronics in Telecommunications , 2000 .

[15]  J. Kemeny,et al.  Denumerable Markov chains , 1969 .

[16]  Michael C. Mackey,et al.  Chaos, Fractals, and Noise , 1994 .

[17]  Tohru Kohda,et al.  Explicit evaluations of correlation functions of Chebyshev binary and bit sequences based on Perron-Frobenius operator , 1994 .

[18]  M. Gotz,et al.  Discrete-time chaotic encryption systems. I. Statistical design approach , 1997 .

[19]  S. Wiggins.  Introduction to Applied Nonlinear Dynamical Systems and Chaos , 1989 .

[20]  H. Dedieu.  Overview of nonlinear noise reduction algorithms for systems with known dynamics , 1998 .

[21]  A. Odlyzko.  Asymptotic enumeration methods , 1996 .

[22]  Gianluca Mazzini,et al.  A tensor approach to higher order expectations of quantized chaotic trajectories. I. General theory and specialization to piecewise affine Markov systems , 2000 .

[23]  Walter Willinger,et al.  On the self-similar nature of Ethernet traffic , 1993, SIGCOMM '93.