Complex Minkowski Reduction and a Relaxation for Near-Optimal MIMO Linear Equalization

Ding Liqin
Ding Liqin
Zhang Jiliang
Zhang Jiliang

IEEE Wireless Communications Letters, pp. 38-41, 2017.

Cited by: 0|Bibtex|Views7|DOI:https://doi.org/10.1109/LWC.2016.2628746
WOS EI SCOPUS
Other Links: dblp.uni-trier.de|academic.microsoft.com

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments