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

Chaotic complex spreading sequences for asynchronous DS-CDMA - Part II: Some theoretical performance bounds / Rovatti, Riccardo; Setti, Gianluca; Mazzini, Gianluca. - In: IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I. FUNDAMENTAL THEORY AND APPLICATIONS. - ISSN 1057-7122. - STAMPA. - 45:4(1998), pp. 496-506. [10.1109/81.669073]

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

SETTI, Gianluca;
1998

Abstract

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
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/2696640
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo