Low-complexity adaptive tree search algorithm for MIMO detection

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.