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

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 f...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE wireless communications letters Ročník 6; číslo 1; s. 38 - 41
Hlavní autori:	Ding, Liqin, Wang, Yang, Zhang, Jiliang
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	IEEE 01.02.2017
Predmet:	Algorithms complex-valued algorithms Complexity theory Covariance matrices lattice reduction Lattices MIMO Minkowski reduction Transforms Wireless communication
ISSN:	2162-2337, 2162-2345
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!