• DocumentCode
    329649
  • Title

    CDMA systems sequences optimization by simulated annealing

  • Author

    Jeszensky, Paul Jean Etienne ; Stolfi, Guido

  • Author_Institution
    Escola Politecnica, Sao Paulo Univ., Brazil
  • Volume
    1
  • fYear
    1998
  • fDate
    2-4 Sep 1998
  • Firstpage
    38
  • Abstract
    In this paper we consider the problem of asynchronous CDMA (code division multiple access) systems performance optimization by proper selection of spreading sequences (codes). The computational complexity involved induces the search for sub-optimal procedures and the numerical method of “simulated annealing” is applied for this particular problem. Despite the simplicity and arbitrariness of the algorithm, the results are amazing. These results confirm the possibility of performance improvement by sequence selection using the method of simulated annealing. Its advantage, in terms of argument of function Q(.) (assuming “strong signal”, that is, negligible N0/A2.T), is ≈1.0 dB when we compare, for a single user, the worst and best cases
  • Keywords
    binary sequences; code division multiple access; computational complexity; pseudonoise codes; simulated annealing; CDMA systems; Gold sequences; asynchronous code division multiple access; computational complexity; numerical method; performance optimization; simulated annealing; spreading codes; spreading sequences; sub-optimal procedures; AWGN; Additive white noise; Bit error rate; Computational complexity; Computational modeling; Gaussian noise; Multiaccess communication; Numerical simulation; Simulated annealing; System performance;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Spread Spectrum Techniques and Applications, 1998. Proceedings., 1998 IEEE 5th International Symposium on
  • Conference_Location
    Sun City
  • Print_ISBN
    0-7803-4281-X
  • Type

    conf

  • DOI
    10.1109/ISSSTA.1998.726191
  • Filename
    726191