• DocumentCode
    1850180
  • Title

    Blind spreading sequence estimation based on hill-climbing algorithm

  • Author

    Zhi-Chao Sha ; Zhi-Tao Huang ; Yi-Yu Zhou ; Feng-Hua Wang

  • Author_Institution
    Sch. of Electron. Sci. & Eng., Nat. Univ. of Defense Technol., Changsha, China
  • Volume
    2
  • fYear
    2012
  • fDate
    21-25 Oct. 2012
  • Firstpage
    1299
  • Lastpage
    1302
  • Abstract
    In this paper an efficient method is proposed for blind estimation of short-code direct sequence spread spectrum (DS-SS) signal in synchronous system. This method is based on hill-climbing algorithm (HC), which is developed to estimate the spreading sequence for the capability of efficiency and speediness local optimization search. Firstly, The fitness function is constructed to value the quality of candidate sequence. Secondly, the feasibility that HC algorithm is used to estimate the spreading sequence is analysed according to the fitness function. Lastly, simulation results show that the novel method is capable of retrieving the spreading sequences with approximate performance to previous methods, whereas the computational complexity is much lower than previous methods.
  • Keywords
    approximation theory; code division multiple access; optimisation; search problems; spread spectrum communication; DS-SS; HC algorithm; blind spreading sequence estimation; computational complexity; fitness function; hill-climbing algorithm; local optimization search efficiency capability; local optimization search speediness capability; short-code direct sequence spread spectrum signal; synchronous system; DS-SS; Hill-climbing (HC); Non-cooperative signal processing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signal Processing (ICSP), 2012 IEEE 11th International Conference on
  • Conference_Location
    Beijing
  • ISSN
    2164-5221
  • Print_ISBN
    978-1-4673-2196-9
  • Type

    conf

  • DOI
    10.1109/ICoSP.2012.6491814
  • Filename
    6491814