Low complexity hybrid layered tabu‐likelihood ascent search for large MIMO detection with perfect and estimated channel state information

Abstract

AbstractIn this work, we proposed a low‐complexity hybrid layered tabu‐likelihood ascent search (LTLAS) algorithm for large multiple‐input multiple‐output (MIMO) system. The conventional layered tabu search (LTS) approach involves many partial reactive tabu searches (RTSs), and each RTS requires an initialization and searching phase. In the proposed algorithm, we restricted the upper limit of the number of RTS operations. Once RTS operations exceed the limit, RTS will be replaced by low‐complexity likelihood ascent search (LAS) operations. The block‐based detection approach is considered to maintain a higher signal‐to‐noise ratio (SNR) detection performance. An efficient precomputation technique is derived, which can suppress redundant computations. The simulation results show that the bit error rate (BER) performance of the proposed detection method is close to the conventional LTS method. The complexity analysis shows that the proposed method has significantly lower computational complexity than conventional methods. Also, the proposed method can reduce almost 50% of real operations to achieve a BER of 10−3.