Binary and finer discretized time series generated by logistic chaotic maps

Discretization of the logistic chaotic map to binary and finer alphabets is investigated, motivated by potential use in chaos-based communication systems. Results are reported on the ensuing dependency and independency of the alphabet sequences. Binary results are expressed in terms of a parameter representing the balance of probabilities. Developments to multiple binary discretizations and to finer discretizations with uniformly distributed alphabet sequences, are presented. This latter type of process is shown to posses a form of local independence, but not full independence.