CHAOTIC COMPLEX SPREADING SEQUENCES FOR ASYNCHRONOUS DS-CDMA .1. SYSTEM MODELING AND RESULTS

This paper and its companion are devoted to the evaluation of the impa ct of chaos-based techniques on communications systems with asynchrono us code division multiple access, Sequences obtained by repeating a tr uncated and quantized chaotic time series are compared with classical m-sequences and Gold sequences by means of a performance index taken f rom communication theory which is here defined and thoroughly discusse d. This analysis reveals that, unlike conventional sequences, chaotic spreading codes can be generated for any number of users and allocated bandwidth. Numerical simulations are reported, showing that systems b ased on chaotic spreading sequences perform generally better than the conventional ones. Some analytical tools easing the comprehension of t hese advantages are here summarized and proved in Part II where formal arguments are developed and discussed to ensure general applicability of chaotic spreading codes.