ABSTRACT
This chapter aims to the theoretical investigation of the achievable performance of a conventional Direct Sequence-Code Division Multiple Access systems (DS-CDMA) system when chaos-based spreading sequences are substituted to classical Gold and m-sequences. It describes the use of one-dimensional chaotic maps to generate the finite-lengthdiscrete-time sequence of symbols which is periodically repeated to obtain the infinite one needed in DS-CDMA systems to spread the spectrum of information signals. The chapter shows that chaining the results of two paths one arrives at design criteria which, depending on the environment in which the communication system is set and on the performance index considered, allows the optimization of the CBDS-CDMA system so that it results better than conventional DS-CDMA systems. It also describes the modeling of a classical DS-CDMA system correlation receiver when asynchronous multi-user access is considered over an exponentially vanishing multipath channel and in the case were selective fading can be neglected.
