Low-complexity near-optimal signal detection in underdetermined large-MIMO systems

In this paper, we consider signal detection in n
_t
× n
_r
underdetermined MIMO (UD-MIMO) systems, where i) n
_t
>; n
_r
with a overload factor α = n
_t
over n
_r
>; 1, ii) n
_t
symbols are transmitted per channel use through spatial multiplexing, and iii) n
_t
, n
_r
are large (in the range of tens). A low-complexity detection algorithm based on reactive tabu search is considered. A variable threshold based stopping criterion is proposed which offers near-optimal performance in large UD-MIMO systems at low complexities. A lower bound on the maximum likelihood (ML) bit error performance of large UD-MIMO systems is also obtained for comparison. The proposed algorithm is shown to achieve BER performance close to the ML lower bound within 0.6 dB at an uncoded BER of 10
^-2
in 16 × 8 V-BLAST UD-MIMO system with 4-QAM (32 bps/Hz). Similar near-ML performance results are shown for 32 × 16, 32 × 24 V-BLAST UD-MIMO with 4-QAM/16-QAM as well. A performance and complexity comparison between the proposed algorithm and the λ-generalized sphere decoder (λ-GSD) algorithm for UD-MIMO shows that the proposed algorithm achieves almost the same performance of λ-GSD but at a significantly lesser complexity.