Chaotic complex spreading sequences for asynchronous DS-CDMA. Part II. Some theoretical performance bounds

For pt.I see G. Mazzini et al., vol.44, pp.937-47 (Oct. 1997). This paper and its companion (Part I) are devoted to the evaluation of the impact of chaos-based techniques on communications systems with asynchronous Code Division Multiple Access. In Part I, a performance index was introduced and exploited to a priori estimate the performance of DS-CDMA communications systems based on chaotic spreading sequences, and to compare it to that of conventional systems. Here, tools from nonlinear dynamical system theory are employed to give a formal ground for those results. Analytical bounds on the expected partial cross correlation between spreading sequences obtained by quantizing and repeating a chaotic time series are derived, ensuring general applicability of such a technique in a real environment. Further analytical arguments guarantee that, when particular chaotic generators are used, expected performance is not worse than that of a well-behaving communications system. This analysis ensures also that, unlike conventional sequences, chaotic spreading codes can be generated for any number of users and allocated bandwidth