Advertisement

Optimum Spreading Sequences for Asynchronous CDMA System Based on Nonlinear Dynamical and Ergodic Theories

  • Kung Yao
  • Chi-Chung Chen
Part of the Institute for Nonlinear Science book series (INLS)

Summary

This chapter presents a tutorial and overview of the interplay among nonlinear dynamical system theory, ergodic theory, and the design and analysis of spreading sequences for CDMA communication systems. We first address some motivational factors in information theory, communication theory, and communication systems to chaotic communication systems. Then we consider some basic issues in CDMA communication system. Next we summarize some properties of nonlinear dynamical system and ergodic theories needed for this study. Some history and details on the design and analysis of optimum chaotic asynchronous and chip-synchronous spreading sequences for CDMA systems are given. These optimum spreading sequences allow about 15% more users than random white sequences/Gold codes in an asynchronous system and 73% more users in a chip-synchronous system. Comparisons of performance of these system under ideal and practical conditions are also made. Finally, some brief conclusions are given.

Keywords

Optimal Sequence CDMA System Spreading Sequence Chaotic Dynamical System Rician Fading Channel 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Abel, A. Bauer, K. Kelber, and W. Schwarz, Chaotic codes for CDMA applications, Proc. ECCTD’97, pp. 306–311, 1999.Google Scholar
  2. 2.
    R. L. Adler, and T. J. Rivlin, Ergodic and mixing properties of Chebyshev polynomials, Proc. Amer. Math. Soc., vol. 15, pp. 794–796, 1964.zbMATHMathSciNetCrossRefGoogle Scholar
  3. 3.
    V. I. Arnold and A. Avez, Ergodic Problems of Classical Mechanics (W. A. Benjamin, New York, 1968).zbMATHGoogle Scholar
  4. 4.
    D. S. Broomhead, J. P. Huke, and M. R. Muldoon, Codes for spread spectrum applications generated using chaotic dynamical systems, Dynamics and Stability of Systems, vol. 14, no. 1, pp. 95–105, 1999.zbMATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    C. C. Chen, E. Biglieri, and K. Yao, Design of spread spectrum sequences using Ergodic Theory, International Symposium on Information Theory, Sorrento, Italy, p. 379, 2000.Google Scholar
  6. 6.
    C. C. Chen, K. Yao, K. Umeno, and E. Biglieri, Design of spread spectrum sequences using chaotic dynamical systems and Ergodic Theory, IEEE Trans. on Circuits and Systems, I, Vol. 48, pp. 1110–1113, 2001.zbMATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    C. C. Chen, Chaotic signals for communication systems, Ph. D. Dissertation, UCLA, 2000.Google Scholar
  8. 8.
    C.C. Chen, K. Yao, and E. Biglieri, Optimal spread spectrum sequences constructed from Gold codes, Proc. IEEE Globecom, pp. 867–871, 2000.Google Scholar
  9. 9.
    E. Geraniotis, Direct-sequence spread-spectrum multiple-access communications over nonselective and frequency-selective Rician fading channels, IEEE Trans. Communications, vol. 34, no. 8, pp. 756–764, 1986.zbMATHADSCrossRefGoogle Scholar
  10. 10.
    M. Götz and A. Abel, Design of infinite chaotic polyphase sequences with perfect correlation properties, Proc. IEEE ISCAS’98, pp. III 279–282, 1999.Google Scholar
  11. 11.
    J. K. Holmes and Chang C. Chen, Acquisition time performance of PN spreadspectrum systems, IEEE Trans. Communications, vol. 25, pp. 778–784, 1977.zbMATHCrossRefADSGoogle Scholar
  12. 12.
    T. Kodha and A. Tsuneda, Statistics of chaotic binary sequences, IEEE Trans. Information Theory, vol. 43, pp. 104–112, 1997.CrossRefGoogle Scholar
  13. 13.
    A. Lasota, and M. C. Mackey, Chaos, Fractals, and Noise: Stochastic Aspects of Dynamics (Springer-Verlag, New York, 1994).zbMATHGoogle Scholar
  14. 14.
    G. Mazzini, R. Rovatti, and G. Setti, Interference minimization by autocorrelation shaping in asynchronous DS-CDMA systems: Chaos-based spreading is nearly optimal, Electronics Letters, vol. 35, pp. 1054–1055, 1999.CrossRefGoogle Scholar
  15. 15.
    L.M. Pecora and T.L. Carroll, Synchronization in Chaotic Systems, Phys. Rev. Lett., vol. 64, pp. 821–824, 1990.zbMATHMathSciNetCrossRefADSGoogle Scholar
  16. 16.
    M. B. Pursley, Performance evaluation for phased-coded spread-spectrum multiple-access communication-Part I: System Aanalysis, IEEE Trans. Communications, vol. 25, pp. 795–799, 1977.zbMATHCrossRefADSGoogle Scholar
  17. 17.
    M. B. Pursley and D. V. Sarwate, Performance evaluation for phased-coded spread-spectrum multiple-access communication-Part II: Code sequence Aanalysis, IEEE Trans. Communications, vol. 25, pp. 800–803, 1977.zbMATHCrossRefADSGoogle Scholar
  18. 18.
    D. V. Sarwate and M. B. Pursley, Crosscorrelation properties of pseudorandom and related sequences, Proc. of IEEE, vol. 68, no. 5, pp. 593–619, 1980.CrossRefGoogle Scholar
  19. 19.
    J. Schweizer and M. Hasler, Multiple access communications using chaotic signals, Proc. ISCAS’96, pp. 108–111, 1996.Google Scholar
  20. 20.
    K. Umeno, Chaotic Monte Carlo computation: a dynamical effect of randomnumber generations, Japan Journal of Applied Physics, vol. 39, Part 1, pp. 1442–1456, 2000.CrossRefADSGoogle Scholar
  21. 21.
    K. Umeno and K. I. Kitayama, Improvement of SNR with chaotic spreading sequences for CDMA, IEEE Information Theory Workshop, South Africa, June, 1999.Google Scholar
  22. 22.
    K. Yao, Error probability of asynchronous spread spectrum multiple access communication systems, IEEE Trans. Communications, vol. 25, pp. 803–809, 1977.zbMATHCrossRefADSGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2006

Authors and Affiliations

  • Kung Yao
    • 1
  • Chi-Chung Chen
    • 1
  1. 1.Electrical Engineering DepartmentUniversity of California, Los AngelesLos Angeles

Personalised recommendations