The problem of computing any-order expectations of trajectories generated by discrete-time one-dimensional chaotic systems is addressed by means of a suitable generalization of the Perron-Frobenius operator and its quantization. Tools from tensor algebra are introduced and analytical expressions for the special case of piecewise-affine Markov maps are obtained. Results are further specialized for a family of maps with quite general features. As an example application, some cross- and self-interference terms are computed, which are involved in the evaluation of the performance of chaos-based DS-CDMA systems in an asynchronous multipath environment.
No takes yet. Share an insight, caveat, or question.
Rovatti et al. (2000) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: