Chip Pulse Shaping in Asynchronous Chaos-Based DS-CDMA

This paper extends and fully formalizes some previous results by developing an analytical method to account for the general chip pulse for DS-CDMA systems in an asynchronous environment with an integrate-and-dump receiver, applying it to commonly used pulses. Given the pulse, such a formal method allows us to define the optimum spreading code autocorrelation to be used and the relative signal-to-interference ratio performance. A chaos-based spreading code is plugged into this model to show that such an optimum performance can be very well approximated by practical sequence generators. This is shown by analyzing some typical bandlimited and substantially bandlimited pulses and determining the optimum spreading for each of them. These results prove that the gain of chaos-based spreading over conventional i.i.d.-like spreading can reach 75% when practical bandlimited pulses are considered.

[1]  G. Mazzini,et al.  Statistical modeling of discrete-time chaotic processes-basic finite-dimensional tools and applications , 2002, The IEEE International Symposium on Circuits and Systems, 2003. Tutorial Guide: ISCAS 2003..

[2]  Wayne E. Stark,et al.  DS-CDMA chip waveform design for minimal interference under bandwidth, phase, and envelope constraints , 1999, IEEE Trans. Commun..

[3]  Gianluca Mazzini,et al.  Synchronization mechanism and optimization of spreading sequences in chaos-based DS/CDMA systems , 1999 .

[4]  Gianluca Mazzini,et al.  Performance of chaos-based asynchronous DS-CDMA with different pulse shapes , 2004, IEEE Communications Letters.

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

[6]  Gianluca Mazzini,et al.  On the ultimate limits of chaos-based asynchronous DS-CDMA-I: basic definitions and results , 2004, IEEE Transactions on Circuits and Systems I: Regular Papers.

[7]  Young C. Yoon.  A simple and accurate method of probability of bit error analysis for asynchronous band-limited DS-CDMA systems , 2002, IEEE Trans. Commun..

[8]  Tohru Kohda,et al.  Variances of multiple access interference code average against data average , 2000 .

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

[10]  Joon Ho Cho,et al.  An optimal signal design for band-limited asynchronous DS-CDMA Communications , 2002, IEEE Trans. Inf. Theory.

[11]  Young C. Yoon,et al.  Quadriphase DS-CDMA with pulse shaping and the accuracy of the Gaussian approximation for matched filter receiver performance analysis , 2002, IEEE Trans. Wirel. Commun..

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

[13]  Tohru Kohda,et al.  Spread-spectrum Markovian-code acquisition in asynchronous DS/CDMA systems , 2003, Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03..

[14]  Gianluca Mazzini,et al.  Capacity of chaos-based asynchronous DS-CDMA systems with exponentially vanishing autocorrelations , 2002 .

[15]  Riccardo Rovatti,et al.  Chaotic Electronics in Telecommunications , 2000 .

[16]  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 .

[17]  Gianluca Mazzini,et al.  On the ultimate limits of chaos-based asynchronous DS-CDMA-II: analytical results and asymptotics , 2004, IEEE Transactions on Circuits and Systems I: Regular Papers.