• DocumentCode
    2206140
  • Title

    A modified linearly constrained Constant Modulus Algorithm to suppress multiuser interference

  • Author

    Gao, Huanqin ; Zhou, Kaiqi

  • Author_Institution
    Coll. of Commun.&Inf. Eng., Nanjing Univ. of Posts & Telecommun., Nanjing, China
  • fYear
    2008
  • fDate
    19-21 Nov. 2008
  • Firstpage
    480
  • Lastpage
    483
  • Abstract
    The Constant Modulus Algorithm (CMA) criterion has been proved to possibly capture the interference instead of the desired user. To solve this problem, linearly constrained constant modulus algorithm (LCCMA) was proposed in paper, but LCCMA can not correct the phase error of the received signal. In this paper, a modified linearly constrained constant modulus algorithm (MLCCMA) for DS-CDMA system multi-user detection is proposed, which can correct the phase error of the received signal and suppress multiple access interference (MAI) and converge to the desired user, with the same computational complexity as LCCMA. Simulation results confirm that MLCCMA recovers the phase of received signal correctly and brings about the performance improvement in both convergence and BER compared with LCCMA and 2-2CMA.
  • Keywords
    code division multiple access; interference suppression; multiuser detection; radiofrequency interference; spread spectrum communication; DS-CDMA system; computational complexity; linearly constrained constant modulus algorithm; multi-user detection; multiple access interference; multiuser interference suppression; Bit error rate; Computational complexity; Computational modeling; Convergence; Error correction; Interference constraints; Interference suppression; Multiaccess communication; Multiple access interference; Multiuser detection; DS-CDMA; LCCMA; MLCCMA; Multiuser Detection;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communication Systems, 2008. ICCS 2008. 11th IEEE Singapore International Conference on
  • Conference_Location
    Guangzhou
  • Print_ISBN
    978-1-4244-2423-8
  • Electronic_ISBN
    978-1-4244-2424-5
  • Type

    conf

  • DOI
    10.1109/ICCS.2008.4737230
  • Filename
    4737230