Low-complexity adaptive tree search algorithm for MIMO detection

Author

Lai, Kuei-Chiang ; Lin, Li-Wei

Author_Institution

Dept. of Electr. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan

Volume

8

Issue

7

fYear

2009

fDate

7/1/2009 12:00:00 AM

Firstpage

3716

Lastpage

3726

Abstract

In this paper, a reduced-complexity multiple-input multiple-output (MIMO) detector for the spatial multiplexing systems is described. It incorporates the idea of Ungerboeck´s set partitioning in the tree search to reduce the computational complexity. An algorithm that adapts the number of partitions based on the channel conditions is 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; communication complexity; mobile radio; multiplexing; signal detection; tree searching; wireless channels; Ungerboeck set partitioning; adaptive tree search algorithm; channel condition; computational complexity; mobile wireless communication system; multiple-input multiple-output detector; reduced-complexity MIMO detection; signal detection; spatial multiplexing system; Computational complexity; Detection algorithms; Detectors; MIMO; Maximum likelihood decoding; Object detection; Partitioning algorithms; Receiving antennas; Throughput; Transmitting antennas; MIMO detection, signal set partitioning, tree search.;

fLanguage

English

Journal_Title

Wireless Communications, IEEE Transactions on

Publisher

ieee

ISSN

1536-1276

Type

jour

DOI

10.1109/TWC.2009.080902

Filename

5165334