Complex Minkowski Reduction and a Relaxation for Near-Optimal MIMO Linear Equalization
IEEE Wireless Communications Letters, pp. 38-41, 2017.
WOS EI SCOPUS
First, this letter presents a Minkowski reduction algorithm working directly on complex lattices. Then, a relaxation is proposed to Minkowski criterion by restricting the search of basis vectors within sublattices whose dimensions are determined by an integer parameter β, and a reduction algorithm following the relaxed criterion is also d...More
Full Text (Upload PDF)
PPT (Upload PPT)