论文信息 - Chaotic complex spreading sequences with multiple access performance better than purely random sequences

Chaotic complex spreading sequences with multiple access performance better than purely random sequences

The paper presents a theoretic analysis on a performance index of the recently proposed chaotic complex spreading sequences, which characterizes the multiple access interference introduced by cross-correlation of a sequence set in asynchronous DS/CDMA systems. Based on this analysis it is possible to design chaotic spreading sequences outperforming ideal random sequences. Numerical results on biphase and quadriphase chaotic sequences are given.

[1] M. Pursley,et al. Performance Evaluation for Phase-Coded Spread-Spectrum Multiple-Access Communication - Part II: Code Sequence Analysis , 1977, IEEE Transactions on Communications.

[2] Tohru Kohda,et al. Pseudonoise Sequences by Chaotic Nonlinear Maps and Their Correlation Properties , 1993 .

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

[4] J. Cernák. Digital generators of chaos , 1996 .

[5] G. Mazzini,et al. Corrections to "Chaotic Complex Spreading Sequences for Asynchronous DS-CDMA—Part I: System Modeling and Results" 1 , 1998 .

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

[7] D. Ruelle,et al. Ergodic theory of chaos and strange attractors , 1985 .

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