Constructing chaotic discrete sequences for digital communications based on correlation analysis

We introduce a model of chaotic systems that can provide predictable probab ility distribution to generate discrete sequences for digital communication s. Some well-known chaotic maps belong to its special cases. We generalize the spirit of a paper by Kohda and Tsuneda to explicitly express the covari ance functions of the chaotic discrete sequences generated by this model. B ased on the model, a scheme is proposed to construct the chaotic orthonorma l discrete sequences, which are characterized by the asymptotic normalized (partial) delta-like autocovariance and near-zero cross covariance, Compare d with the conventional algebraic sequences, such chaotic discrete sequence s have quite a large number of choices. All empirical results well correspo nd to theoretic prediction.