Lattice-reduction-aided K-best algorithm for low complexity and high performance communications

摘要

Systems and methods are disclosed for detecting a symbol in large-scale multiple-input multiple-output communication systems. The detection is based on an improved lattice-reduction-aided K-best algorithm. The detection finds K best candidate symbols with minimum costs for each layer based on a priority queue and an on-demand expansion. In a complex domain, the detection may include a 2-dimensional Schnorr-Euchner expansion or, in the alternative, a two-stage 1-dimensional Schnorr-Euchner expansion.