• DocumentCode
    3431829
  • Title

    A Low Complexity Viterbi-Like Detection Algorithm Based on Sorted QR decomposition in V-BLAST System

  • Author

    Xiang, Xingyu ; Zhong, Wen

  • Author_Institution
    Nat. Commun. Res. Lab., Southeast Univ., Nanjing
  • fYear
    2008
  • fDate
    12-14 Oct. 2008
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    Vertical Bell labs layered space-time (V-BLAST) is designed to exploit the capacity advantage of multiple antenna system in rich-scattering environments. In this paper, we propose a low complexity detection algorithm with respect to the maximum-likelihood (ML) criterion. This algorithm deploys sorted QR decomposition to construct a ML trellis. A Viterbi-like algorithm is used to find a near optimal solution in the trellis. The complexity of this algorithm is lower than that of full ML. When small size constellation is used, the proposed algorithm is less complex than MMSE-OSIC. The performance of the proposed algorithm is close to that of full ML.
  • Keywords
    Viterbi detection; antenna arrays; data communication; least mean squares methods; maximum likelihood detection; trellis codes; MMSE-OSIC; V-BLAST system; Viterbi-like detection; low complexity detection; maximum-likelihood trellis; multiple antenna system; sorted QR decomposition; vertical Bell labs layered space-time; Algorithm design and analysis; Detection algorithms; Detectors; Matrix decomposition; Maximum likelihood detection; Noise cancellation; Receiving antennas; Transmitting antennas; Viterbi algorithm; Wireless communication;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Communications, Networking and Mobile Computing, 2008. WiCOM '08. 4th International Conference on
  • Conference_Location
    Dalian
  • Print_ISBN
    978-1-4244-2107-7
  • Electronic_ISBN
    978-1-4244-2108-4
  • Type

    conf

  • DOI
    10.1109/WiCom.2008.377
  • Filename
    4678286