• DocumentCode
    3274746
  • Title

    Reduced-Complexity MIMO Detection Using Adaptive Set Partitioning

  • Author

    Lai, Kuei-Chiang

  • Author_Institution
    Nat. Cheng Kung Univ., Tainan
  • fYear
    2008
  • fDate
    March 31 2008-April 3 2008
  • Firstpage
    159
  • Lastpage
    164
  • Abstract
    In this paper, a reduced-complexity multiple-input multiple-output (MIMO) detector for the Bell Labs Layered Space-Time Architecture (BLAST) is described. It incorporates the idea of set partitioning in the tree search to reduce the number of multiplications and comparisons. An algorithm that adapts the number of partitions based on the channel conditions is also proposed to achieve a better tradeoff between complexity and performance. Simulation results are presented to demonstrate the efficacy of the proposed algorithm under the assumptions of perfect channel and noise power estimates.
  • Keywords
    MIMO communication; search problems; trees (mathematics); wireless channels; Bell Labs Layered Space-Time Architecture; adaptive set partitioning; channel condition; reduced-complexity MIMO detection; tree search; Communications Society; Computer architecture; Detectors; Fading; MIMO; OFDM; Partitioning algorithms; Power system reliability; Receiving antennas; Transmitting antennas;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Communications and Networking Conference, 2008. WCNC 2008. IEEE
  • Conference_Location
    Las Vegas, NV
  • ISSN
    1525-3511
  • Print_ISBN
    978-1-4244-1997-5
  • Type

    conf

  • DOI
    10.1109/WCNC.2008.33
  • Filename
    4489064