• DocumentCode
    2563375
  • Title

    A Low Complexity Soft-Output QRD-M Algorithm for MIMO-OFDM Systems

  • Author

    Jian, Haifang ; Yi, Yong ; Cui, Xiuling ; Shi, Yin

  • Author_Institution
    Inst. of Semicond., Chinese Acad. of Sci., Beijing, China
  • fYear
    2010
  • fDate
    23-25 Sept. 2010
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    In this paper, a low-complexity soft-output QRD-M detection algorithm is proposed for high-throughput Multiple-input multiple-output (MIMO) systems. By employing novel expansion and sorting scheme, the proposed algorithm can greatly reduce the numbers of the fundamental operations during the tree search process, especially the comparison operations which play a key role in the QRD-M detector´ computational complexity. Furthermore, the proposed algorithm can yield the Log-likelihood ratio (LLR) values of the coded bits without any additional likelihood function or an appropriate constant. Simulation results show that the proposed algorithm can achieve a near-ML detection performance under TGn channel Models.
  • Keywords
    MIMO communication; OFDM modulation; channel coding; computational complexity; maximum likelihood detection; search problems; trees (mathematics); LLR; MIMO-OFDM systems; QRD-M detector computational complexity; channel decoder; high-throughput multiple-input multiple-output systems; log-likelihood ratio; low complexity soft-output QRD-M detection algorithm; maximum likelihood detection; sorting scheme; tree search process; Bit error rate; Complexity theory; Decoding; Detectors; MIMO; Quadrature amplitude modulation; Sorting;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Communications Networking and Mobile Computing (WiCOM), 2010 6th International Conference on
  • Conference_Location
    Chengdu
  • Print_ISBN
    978-1-4244-3708-5
  • Electronic_ISBN
    978-1-4244-3709-2
  • Type

    conf

  • DOI
    10.1109/WICOM.2010.5601149
  • Filename
    5601149