scholarly journals BINARY TIME SERIES GENERATED BY CHAOTIC LOGISTIC MAPS

2003 ◽  
Vol 03 (04) ◽  
pp. 529-544 ◽  
Author(s):  
A. J. LAWRANCE ◽  
RODNEY C. WOLFF

This paper examines stochastic pairwise dependence structures in binary time series obtained from discretised versions of standard chaotic logistic maps. It is motivated by applications in communications modelling which make use of so-called chaotic binary sequences. The strength of non-linear stochastic dependence of the binary sequences is explored. In contrast to the original chaotic sequence, the binary version is non-chaotic with non-Markovian non-linear dependence, except in a special case. Marginal and joint probability distributions, and autocorrelation functions are elicited. Multivariate binary and more discretised time series from a single realisation of the logistic map are developed from the binary paradigm. Proposals for extension of the methodology to other cases of the general logistic map are developed. Finally, a brief illustration of the place of chaos-based binary processes in chaos communications is given.

2016 ◽  
Vol 2016 ◽  
pp. 1-9 ◽  
Author(s):  
Kelin Lu ◽  
K. C. Chang ◽  
Rui Zhou

This paper addresses the problem of distributed fusion when the conditional independence assumptions on sensor measurements or local estimates are not met. A new data fusion algorithm called Copula fusion is presented. The proposed method is grounded on Copula statistical modeling and Bayesian analysis. The primary advantage of the Copula-based methodology is that it could reveal the unknown correlation that allows one to build joint probability distributions with potentially arbitrary underlying marginals and a desired intermodal dependence. The proposed fusion algorithm requires no a priori knowledge of communications patterns or network connectivity. The simulation results show that the Copula fusion brings a consistent estimate for a wide range of process noises.


Sign in / Sign up

Export Citation Format

Share Document