• DocumentCode
    1830016
  • Title

    Combining Sphere Decoding with M-Algorithm

  • Author

    Zheng, Jianping ; Bai, Baoming ; Wang, Xinmei

  • Author_Institution
    State Key Lab of ISN, Xidian Univ., Xi´´an
  • fYear
    2006
  • fDate
    22-26 Oct. 2006
  • Firstpage
    175
  • Lastpage
    178
  • Abstract
    The sequence detection problem for fading channels in multiple-input multiple-output (MIMO) wireless systems is investigated. The sphere decoding (SD) algorithm provides an exact maximum-likelihood (ML) solution, while has expected worst-case complexity which is exponential in the number of symbols jointly detected. On the other hand, the M-algorithm (MA) is a suboptimal solution. Its complexity is linear in the product of the list number and the number of symbols jointly detected. We combined the sphere-constrained search strategy of SD with the M-constrained search principle of the MA. The resulting algorithms can achieve good performance in term of bit error rate (BER) while lower complexity
  • Keywords
    MIMO communication; channel coding; error statistics; fading channels; maximum likelihood decoding; search problems; BER; M-algorithm; M-constrained search principle; MIMO wireless systems; bit error rate; fading channels; maximum-likelihood solution; multiple-input multiple-output; sequence detection problem; sphere decoding; Bit error rate; Detectors; Fading; Information theory; Lattices; MIMO; Maximum likelihood decoding; Quadrature amplitude modulation; Random variables; Receiving antennas;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Workshop, 2006. ITW '06 Chengdu. IEEE
  • Conference_Location
    Chengdu
  • Print_ISBN
    1-4244-0067-8
  • Electronic_ISBN
    1-4244-0068-6
  • Type

    conf

  • DOI
    10.1109/ITW2.2006.323782
  • Filename
    4119280