Chaos-based asynchronous DS-CDMA systems and enhanced Rake receivers: measuring the improvements

Results of recent theoretical investigations highlighted that the use of chaos in direct-sequence code-division multiple access (DS-CDMA) systems may lead to nonnegligible improvements in communication quality for several scenarios. We here briefly review the main steps in this derivation and report the experimental verifications of the corresponding theoretical prediction. With this, we confirm that chaos-based spreading sequences outperform classical pseudo-random sequences in at least two important cases. Over nonselective channels, the ability of chaos-based spreading of minimizing multiple-access interference leads to a measured 60% improvement in P/sub err/ with respect to classical spreading. Over selective channels, the possibility of jointly optimizing chaos-based spreading and Rake receiver profiles leads to improvements of up to 38% in P/sub err/ with respect to systems with either conventional spreading or conventional Rake policies.

[1]  Riccardo Rovatti,et al.  Enhanced rake receivers for chaos-based DS-CDMA , 2001 .

[2]  Riccardo Rovatti,et al.  Chaotic complex spreading sequences for asynchronous DS-CDMA. I. System modeling and results , 1997 .

[3]  Michael C. Mackey,et al.  Chaos, Fractals, and Noise , 1994 .

[4]  Tohru Kohda,et al.  Explicit evaluations of correlation functions of Chebyshev binary and bit sequences based on Perron-Frobenius operator , 1994 .

[5]  Horst A. Eiselt,et al.  Continuous Optimization Models , 1987 .

[6]  Riccardo Rovatti,et al.  Chaos-Based Spreading Sequence Optimization for DS-CDMA Synchronization , 1998 .

[7]  Gianluca Mazzini,et al.  A tensor approach to higher order expectations of quantized chaotic trajectories. I. General theory and specialization to piecewise affine Markov systems , 2000 .

[8]  Gianluca Mazzini,et al.  RAKE RECEIVERS FOR CHAOS-BASED ASYNCHRONOUS DS-CDMA , 2000 .

[9]  C.D. McGillem,et al.  A novel multiple-address digital communication system using chaotic signals , 1992, [Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications.

[10]  Gianluca Mazzini,et al.  Interference bounds for DS-CDMA systems based on chaotic piecewise-affine Markov maps , 2000 .

[11]  Velio Tralli,et al.  Performance evaluation of DS-CDMA systems on multipath propagation channels with multilevel spreading sequences and RAKE receivers , 1998, IEEE Trans. Commun..

[12]  Heinz Ochsner,et al.  Direct-Sequence Spread-Spectrum Receiver for Communication on Frequency-Selective Fading Channels , 1987, IEEE J. Sel. Areas Commun..

[13]  Tohru Kohda,et al.  Even- and odd-correlation functions of chaotic Chebyshev bit sequences for CDMA , 1994, Proceedings of IEEE 3rd International Symposium on Spread Spectrum Techniques and Applications (ISSSTA'94).

[14]  Tohru Kohda,et al.  Chaotic Binary Sequences by Chebyshev Maps and Their Correlation Properties , 1992, IEEE Second International Symposium on Spread Spectrum Techniques and Applications.

[15]  Gianluca Mazzini,et al.  Tensor-Based Theory for Quantized Piecewise-Affine Markov Systems: Analysis of Some Map Families , 2001 .

[16]  Clare D. McGillem,et al.  A chaotic direct-sequence spread-spectrum communication system , 1994, IEEE Trans. Commun..

[17]  G. Heidari-Bateni,et al.  Chaotic sequences for spread spectrum: an alternative to PN-sequences , 1992, 1992 IEEE International Conference on Selected Topics in Wireless Communications.

[18]  Gianluca Mazzini,et al.  Interference minimisation by auto-correlation shaping in asynchronous DS-CDMA systems: chaos-based spreading is nearly optimal , 1999 .

[19]  R. Rovatti,et al.  Chaotic complex spreading sequences for asynchronous DS-CDMA. Part II. Some theoretical performance bounds , 1998 .

[20]  M. Pursley,et al.  Performance Evaluation for Phase-Coded Spread-Spectrum Multiple-Access Communication - Part I: System Analysis , 1977, IEEE Transactions on Communications.